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

Proved

D1Bound5.PairLightAdaptivePrepared26.left_prefix_001_part13_checked

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

diophantine-tuplesnumber-theory

For prepared pair 26, left list, part 13, 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. Original heads 93 through 95; all later vertices 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_001_part13_checked :
    pairLightSelectedFloorPrefixBool 1 1 PairLightPrepared26.sieve 3
      (leftCached001.drop 39) (leftRows001.drop 39) = true := by sorry

end D1Bound5.PairLightAdaptivePrepared26
end

Source

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

View graph