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

Proved

D1Bound5.PairLightAdaptivePrepared28.right_prefix_001_checked

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

diophantine-tuplesnumber-theory

For prepared pair 28, 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 PairLightPrepared28.sieve.

Preamble

import Init
import Mathlib.Data.List.Basic
import Definitions.Def_D1Bound5_PairLightArithmeticChunks_Definitions
import Definitions.Def_D1Bound5_SmallPairLightAdaptiveData28_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData28Sieve_Definitions

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared28
set_option maxRecDepth 100000
set_option maxHeartbeats 0

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

end D1Bound5.PairLightAdaptivePrepared28
end

Source

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

View graph