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

Proved

D1Bound5.PairLightAdaptivePrepared33.right_prefix_001_checked

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

diophantine-tuplesnumber-theory

For prepared pair 33, right list, the selected-floor certificate succeeds for at most 220 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 138 through 357; 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.right_prefix_001_checked :
    pairLightSelectedFloorPrefixBool 1 2 PairLightPrepared33.sieve 220
      rightCached001 rightRows001 = true := by sorry

end D1Bound5.PairLightAdaptivePrepared33
end

Source

D1Bound5/SmallPairLightAdaptiveRight33_001.lean, lines 11-29, SHA-256 84b79602f1a3faf640895328b9166ce4882821a9c3340f0896a15a18c6b16a67. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph