Selected-floor prefix certificate for prepared pair 26, right list

Proved

D1Bound5.PairLightAdaptivePrepared26.right_prefix_005_checked

by tp · Oct 24, 2026 · Mathlib 0df444a (Lean v4.33.1)

diophantine-tuplesnumber-theory

For prepared pair 26, right list, the selected-floor certificate succeeds for at most 107 head rows of the supplied cached vertex list. Each selected head is checked against its complete remaining tail, including vertices beyond the end of this chunk. The quadratic coordinate parameters are τ = 1 and ν = 1, and the sieve is PairLightPrepared26.sieve. Exact original head block with every complete later-vertex tail retained.

Preamble

import Init
import Mathlib.Data.List.Basic
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_SmallPairLightAdaptiveData26_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData26_Definitions_001

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared26
set_option maxRecDepth 100000


theorem _root_.D1Bound5.PairLightAdaptivePrepared26.right_prefix_005_checked :
    pairLightSelectedFloorPrefixBool 1 1 PairLightPrepared26.sieve 107
      rightCached005 rightRows005 = true := by sorry

end D1Bound5.PairLightAdaptivePrepared26
end

Source

D1Bound5/SmallPairLightAdaptiveRight26_005.lean, lines 15-69, SHA-256 f1d8a40f095d69822cd37aa92ca9fb5c930399d05ba853e5f8033caefc20d63b. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph