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

Proved

D1Bound5.PairLightAdaptivePrepared10.right_prefix_000_checked

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

diophantine-tuplesnumber-theory

For prepared pair 10, right list, the selected-floor certificate succeeds for at most 71 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.

Preamble

import Init
import Mathlib.Data.List.Basic
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_SmallPairLightAdaptiveData10_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_checked :
    pairLightSelectedFloorPrefixBool 0 1 PairLightPrepared10.sieve 71
      rightCached000 rightRows000 = true := by sorry

end D1Bound5.PairLightAdaptivePrepared10
end

Source

D1Bound5/SmallPairLightAdaptiveRight10_000.lean, lines 15-50, SHA-256 40bc1e12745d40c9485153cb58ba513ef1ebc597aa0890eb2459dac376f3fefc. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph