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

Proved

D1Bound5.PairLightAdaptivePrepared42.right_prefix_000_checked

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

diophantine-tuplesnumber-theory

For prepared pair 42, right list, the selected-floor certificate succeeds for at most 242 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 ν = 3, and the sieve is PairLightPrepared42.sieve. Heads 0 through 241; every head retains its entire tail.

Preamble

import Init
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_SmallPairLightAdaptiveData42_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData42_Definitions_001

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared42
set_option maxRecDepth 100000
set_option maxHeartbeats 0


theorem _root_.D1Bound5.PairLightAdaptivePrepared42.right_prefix_000_checked :
    pairLightSelectedFloorPrefixBool 1 3 PairLightPrepared42.sieve 242
      rightCached000 rightRows000 = true := by sorry

end D1Bound5.PairLightAdaptivePrepared42
end

Source

D1Bound5/SmallPairLightAdaptiveRight42_000.lean, lines 7-11, SHA-256 89d7ba3eda06997de81ac048f9add9d55153fd779ba06ffed0210b18e75ebc66. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph