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

Proved

D1Bound5.PairLightAdaptivePrepared26.right_prefix_005_part00_checked

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

diophantine-tuplesnumber-theory

For prepared pair 26, right list, part 0, the selected-floor certificate succeeds for at most 12 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. Original heads 336 through 347; every full later-vertex tail retained.

Preamble

import Init
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_PairLightArithmetic_Definitions
import Definitions.Def_D1Bound5_SmallPairLightAdaptiveData26_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData26_Definitions_001

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared26
set_option maxRecDepth 100000
set_option maxHeartbeats 0


theorem _root_.D1Bound5.PairLightAdaptivePrepared26.right_prefix_005_part00_checked :
    pairLightSelectedFloorPrefixBool 1 1 PairLightPrepared26.sieve 12
      (rightCached005.drop 0) (rightRows005.drop 0) = true := by sorry

end D1Bound5.PairLightAdaptivePrepared26
end

Source

D1Bound5/SmallPairLightAdaptiveRight26_005Part00.lean, lines 7-11, SHA-256 418d9aff6a9399a088d777c44c243e601d89bc02348a839aa53e3f897cec7a0a. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph