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

Proved

D1Bound5.PairLightAdaptivePrepared21.right_prefix_001_checked

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

diophantine-tuplesnumber-theory

For prepared pair 21, right 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 τ = 1 and ν = 1, and the sieve is PairLightPrepared21.sieve.

Preamble

import Init
import Mathlib.Data.List.Basic
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_SmallPairLightAdaptiveData21_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData21Sieve_Definitions

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared21
set_option maxRecDepth 100000
set_option maxHeartbeats 0

theorem _root_.D1Bound5.PairLightAdaptivePrepared21.right_prefix_001_checked :
    pairLightSelectedFloorPrefixBool 1 1 PairLightPrepared21.sieve 102
      rightCached001 rightRows001 = true := by sorry

end D1Bound5.PairLightAdaptivePrepared21
end

Source

D1Bound5/SmallPairLightAdaptiveRight21_001.lean, lines 17-70, SHA-256 b182270b69eca263ab2c8b5801d5b956625915182a3d2c3fdd27d7fdefb0587f. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph