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

Proved

D1Bound5.PairLightAdaptivePrepared36.right_prefix_003_checked

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

diophantine-tuplesnumber-theory

For prepared pair 36, right list, the selected-floor certificate succeeds for at most 273 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 ν = 2, and the sieve is PairLightPrepared36.sieve.

Preamble

import Init
import Mathlib.Data.List.Basic
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_SmallPairLightAdaptiveData36_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData36Sieve_Definitions

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared36
set_option maxRecDepth 100000
set_option maxHeartbeats 0

theorem _root_.D1Bound5.PairLightAdaptivePrepared36.right_prefix_003_checked :
    pairLightSelectedFloorPrefixBool 1 2 PairLightPrepared36.sieve 273
      rightCached003 rightRows003 = true := by sorry

end D1Bound5.PairLightAdaptivePrepared36
end

Source

D1Bound5/SmallPairLightAdaptiveRight36_003.lean, lines 31-168, SHA-256 525993c75d45bcc7d4428afbd6c653f0e1791c40a5a760db20180ef0a0537e18. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph