Selected-floor prefix certificate for prepared pair 33, left list

Proved

D1Bound5.PairLightAdaptivePrepared33.left_prefix_000_checked

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

diophantine-tuplesnumber-theory

For prepared pair 33, left list, the selected-floor certificate succeeds for at most 137 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 ν = 2, and the sieve is PairLightPrepared33.sieve. Heads 0 through 136; every head retains its entire tail.

Preamble

import Init
import Mathlib.Data.List.Basic
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_SmallPairLightAdaptiveData33_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData33_Definitions_001

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared33
set_option maxRecDepth 100000
set_option maxHeartbeats 0


theorem _root_.D1Bound5.PairLightAdaptivePrepared33.left_prefix_000_checked :
    pairLightSelectedFloorPrefixBool 1 2 PairLightPrepared33.sieve 137
      leftCached000 leftRows000 = true := by sorry

end D1Bound5.PairLightAdaptivePrepared33
end

Source

D1Bound5/SmallPairLightAdaptiveLeft33_000.lean, lines 13-43, SHA-256 2d72d53ffa0cd3f2fe2ba068ded43c88d6be23d1af689e1cbd7188f9049ca7df. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph