Selected-floor prefix certificate for prepared pair 10, right list, part 2

Proved

D1Bound5.PairLightAdaptivePrepared10.right_prefix_000_part02_checked

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

diophantine-tuplesnumber-theory

For prepared pair 10, right list, part 2, 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 τ = 0 and ν = 1, and the sieve is PairLightPrepared10.sieve. Original heads 22 through 33, retaining complete original tails.

Preamble

import Init
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_PairLightArithmetic_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData10RightCached_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData10RightRows_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData10Sieve_Definitions

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared10
set_option autoImplicit false
set_option maxRecDepth 100000
set_option maxHeartbeats 0


theorem _root_.D1Bound5.PairLightAdaptivePrepared10.right_prefix_000_part02_checked :
    pairLightSelectedFloorPrefixBool 0 1 PairLightPrepared10.sieve 12
      (PairLightPrepared10.rightCached.drop 22)
      (PairLightPrepared10.rightRows.drop 22) = true := by sorry

end D1Bound5.PairLightAdaptivePrepared10
end

Source

D1Bound5/SmallPairLightAdaptiveRight10_000Part02.lean, lines 11-16, SHA-256 a67ea96414903e9681ed0c050fa7f85b3504eb403792058ce50e298e7fe343d4. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph