Pair Light Adaptive Prepared33 — left coverage checked

Proved

D1Bound5.PairLightAdaptivePrepared33.left_coverage_checked

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

diophantine-tuplesnumber-theory

Auxiliary result PairLightAdaptivePrepared33.left_coverage_checked in the proof of the bound five for Diophantine D(1) sets in imaginary quadratic integer rings. The formal statement specifies its hypotheses and conclusion; a mathematical prose description remains to be supplied.

Preamble

import Init
import Definitions.Def_D1Bound5_PairLightArithmetic_Definitions
import Definitions.Def_D1Bound5_SmallPairLightData33_Definitions_001
import Definitions.Def_D1Bound5_SmallPairLightData33_Definitions_002

Formal statement

section
namespace D1Bound5.PairLightAdaptivePrepared33
set_option maxRecDepth 100000
set_option maxHeartbeats 0

theorem _root_.D1Bound5.PairLightAdaptivePrepared33.left_coverage_checked :
    decide (PairLightPrepared33.leftCached.map Prod.fst = PairLightPrepared33.leftVertices) = true := by sorry








end D1Bound5.PairLightAdaptivePrepared33
end

Source

D1Bound5/SmallPairLightAdaptiveValidation33.lean, lines 7-9, SHA-256 f88406379aa255963057cd7eff34bdcd8ea0dba164081daedb45f919ca5b7be9. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph