Selected-floor prefix certificate for prepared pair 12, right list, part 3

Proved

D1Bound5.PairLightAdaptivePrepared12.right_prefix_000_part03_checked

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

diophantine-tuplesnumber-theory

For prepared pair 12, right list, part 3, the selected-floor certificate succeeds for at most 41 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 τ = 0 and ν = 1, and the sieve is PairLightPrepared12.sieve. Original heads 95 through 135; every head retains its complete original tail.

Preamble

import Init
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_PairLightArithmetic_Definitions
import Definitions.Def_D1Bound5_SmallPairLightAdaptiveData12_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData12_Definitions_001

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared12
set_option maxRecDepth 100000
set_option maxHeartbeats 0


theorem _root_.D1Bound5.PairLightAdaptivePrepared12.right_prefix_000_part03_checked :
    pairLightSelectedFloorPrefixBool 0 1 PairLightPrepared12.sieve 41
      (rightCached000.drop 95) (rightRows000.drop 95) = true := by sorry

end D1Bound5.PairLightAdaptivePrepared12
end

Source

D1Bound5/SmallPairLightAdaptiveRight12_000Part03.lean, lines 7-11, SHA-256 92a1675e28060bffed0c0ac1d066419f3f200d0408ab056683d80e4c4a971b26. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph