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

Proved

D1Bound5.PairLightAdaptivePrepared8.right_prefix_004_checked

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

diophantine-tuplesnumber-theory

For prepared pair 8, right list, the selected-floor certificate succeeds for at most 101 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 PairLightPrepared8.sieve.

Preamble

import Init
import Mathlib.Data.List.Basic
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_SmallPairLightAdaptiveData8_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData8Sieve_Definitions

Formal statement

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

theorem _root_.D1Bound5.PairLightAdaptivePrepared8.right_prefix_004_checked :
    pairLightSelectedFloorPrefixBool 0 1 PairLightPrepared8.sieve 101
      rightCached004 rightRows004 = true := by sorry

end D1Bound5.PairLightAdaptivePrepared8
end

Source

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

View graph