Selected-floor prefix certificate for prepared pair 26, left list, part 10

Proved

D1Bound5.PairLightAdaptivePrepared26.left_prefix_000_part10_checked

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

diophantine-tuplesnumber-theory

For prepared pair 26, left list, part 10, the selected-floor certificate succeeds for at most 3 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 PairLightPrepared26.sieve. Heads 30 through 32 of the original first block; every full tail is retained.

Preamble

import Init
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_PairLightArithmetic_Definitions
import Definitions.Def_D1Bound5_SmallPairLightAdaptiveData26_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData26_Definitions_001

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared26
set_option maxRecDepth 100000
set_option maxHeartbeats 0


theorem _root_.D1Bound5.PairLightAdaptivePrepared26.left_prefix_000_part10_checked :
    pairLightSelectedFloorPrefixBool 1 1 PairLightPrepared26.sieve 3
      (leftCached000.drop 30) (leftRows000.drop 30) = true := by sorry

end D1Bound5.PairLightAdaptivePrepared26
end

Source

D1Bound5/SmallPairLightAdaptiveLeft26_000Part10.lean, lines 7-11, SHA-256 825b5731fe7eb121a32d807fcd137e399bc0ee11cc141c1c844b5e6c90e09911. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph