Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Pair Light Prepared44 — right checked

Proved
D1Bound5.PairLightPrepared44.right_checked

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

diophantine-tuplesnumber-theory

Auxiliary result PairLightPrepared44.right_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 Mathlib.Algebra.Order.Ring.Abs
import Mathlib.Algebra.QuadraticAlgebra.Basic
import Mathlib.Algebra.Ring.Basic
import Mathlib.Algebra.Ring.Equiv
import Mathlib.Analysis.Complex.Basic
import Mathlib.Analysis.Complex.Norm
import Mathlib.Analysis.Complex.Polynomial.Basic
import Mathlib.Data.Finset.Card
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Int.GCD
import Mathlib.Data.Int.Interval
import Mathlib.Data.Int.Sqrt
import Mathlib.Data.List.Basic
import Mathlib.Data.List.Range
import Mathlib.Data.ZMod.Basic
import Mathlib.LinearAlgebra.Dimension.Free
import Mathlib.NumberTheory.NumberField.InfinitePlace.TotallyRealComplex
import Mathlib.NumberTheory.NumberField.Norm
import Mathlib.Tactic.FieldSimp
import Mathlib.Tactic.Linarith
import Mathlib.Tactic.LinearCombination
import Mathlib.Tactic.Ring
import Definitions.Def_D1Bound5_Coordinates_Definitions
import Definitions.Def_D1Bound5_PairBipartiteCheck_Definitions
import Definitions.Def_D1Bound5_SmallPairGraphData44_Definitions_002
import Definitions.Def_D1Bound5_SmallPairSieve_1_4_Definitions

Formal statement
section
/- Preserved body from D1Bound5.SmallPairGraphInputs44; original SHA256 b443d2cf11af364c9d9082712786db2cf3a153851a5eaea7bdbb30c84d99fec0. -/

namespace D1Bound5
set_option maxRecDepth 100000

open QuadInt








namespace PairGraphPrepared44



end PairGraphPrepared44
end D1Bound5

/- Preserved body from D1Bound5.SmallPairGraphArithmetic44; original SHA256 f6bdb5a40012c0b78d1ce6330b64244084b8e6a6e3c41c9a3690017b0eb6f558. -/

namespace D1Bound5
set_option maxRecDepth 100000
set_option maxHeartbeats 0







end D1Bound5

/- Preserved body from D1Bound5.SmallPairGraphWitnessData44; original SHA256 f3c4a787d1e9f9d4f74a295674b17167e04ca7bbd68b05e1aafe83388608421d. -/

namespace D1Bound5.PairGraphPrepared44
set_option maxRecDepth 100000









end D1Bound5.PairGraphPrepared44

/- Preserved body from D1Bound5.SmallPairGraphClosure44; original SHA256 4dfcf91b3104c4a07c5f9491b4956fa7d08ee63ada7f4c55131fc45e109a31eb. -/

namespace D1Bound5
set_option maxRecDepth 100000
set_option maxHeartbeats 0

open PairGraphPrepared44





end D1Bound5

/- Preserved body from D1Bound5.SmallPairRawSelectedData44; original SHA256 6f4738d9d44c74a5377009120c16bff87092df004b921c6c5d7740d606704914. -/

namespace D1Bound5.PairSelectedPrepared44
set_option maxRecDepth 100000









end D1Bound5.PairSelectedPrepared44

/- Preserved body from D1Bound5.SmallPairLightAssembly44; original SHA256 72a386daf4c4fbc03e4bc740cfffed37a9495da0a7c0832f363d927056f2fbd1. -/

namespace D1Bound5.PairLightPrepared44
set_option maxRecDepth 100000
set_option maxHeartbeats 0

















theorem _root_.D1Bound5.PairLightPrepared44.right_checked :
    pairIndependentBool smallPairSieve_1_4 (pairSplitByMask smallPairLarge_44 PairGraphPrepared44.colors).2 = true := by sorry

end D1Bound5.PairLightPrepared44

/- Preserved body from D1Bound5.SmallPairGraphTriangle44; original SHA256 b0b577b7778dee384454132602d0d9a1898801dd28bbf0a19bb7e4a67095b933. -/

namespace D1Bound5
set_option maxRecDepth 100000



end D1Bound5

/- Preserved body from D1Bound5.SmallPairGraphData44; original SHA256 71cc4347dc31ae756ab45cd633715fbc8dd66b09ec47b721c35b4874848ddc7a. -/
end
Source
D1Bound5/SmallPairGraphData44.lean, lines 2794-2799, SHA-256 2cda01d4abc3f0157d6caedb7a925e8772556fd7a6431a753622456b3a5428da. Project: https://github.com/tomislav-math/d1-bound5-lean

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me