Selected-floor prefix certificate for prepared pair 30, right list, part 4

Proved

D1Bound5.PairLightAdaptivePrepared30.right_parallel_002_part04_checked

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

diophantine-tuplesnumber-theory

For prepared pair 30, right list, part 4, 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 τ = 1 and ν = 1, and the sieve is PairLightPrepared30.sieve. Original heads 262 through 273, with every original tail comparison.

Preamble

import Init
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_PairLightArithmetic_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData30RightCached_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData30RightRows_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData30Sieve_Definitions

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared30
set_option maxRecDepth 100000
set_option maxHeartbeats 0


theorem _root_.D1Bound5.PairLightAdaptivePrepared30.right_parallel_002_part04_checked :
    pairLightSelectedFloorPrefixBool 1 1 PairLightPrepared30.sieve 12
      (PairLightPrepared30.rightCached.drop 262) (PairLightPrepared30.rightRows.drop 262) = true := by sorry

end D1Bound5.PairLightAdaptivePrepared30
end

Source

D1Bound5/SmallPairParallelRight30_002Part04.lean, lines 10-14, SHA-256 1eb601991003bcd06d762fbef310371fbf278f660094217e6e88f2df5658194b. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph