Selected-floor prefix certificate for prepared pair 4, left list

Proved

D1Bound5.PairLightAdaptivePrepared4.left_prefix_002_checked

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

diophantine-tuplesnumber-theory

For prepared pair 4, left list, the selected-floor certificate succeeds for at most 102 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 PairLightPrepared4.sieve.

Preamble

import Init
import Mathlib.Data.List.Basic
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_SmallPairLightAdaptiveData4_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData4Sieve_Definitions

Formal statement

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

theorem _root_.D1Bound5.PairLightAdaptivePrepared4.left_prefix_002_checked :
    pairLightSelectedFloorPrefixBool 0 1 PairLightPrepared4.sieve 102
      leftCached002 leftRows002 = true := by sorry

end D1Bound5.PairLightAdaptivePrepared4
end

Source

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

View graph