All proofs
Project-declaredLean 4.21.0-rc3 · mathlib@6455ba8ab6d2

Determinant Bound application

DeterminantBound.application

Plain-language statement

A particular application of the determinant bound used in subcase 2.1

Exact Lean statement

lemma DeterminantBound.application (hd : 4 ≤ d) (M : ℝ)
    (hM : M = sSup {max (b i) (c i) | i ∈ Set.Icc 4 d}) :
    ν < 1 + δ - a 3 - M + min (a 3 / 4) (M / 3)

Formal artifact

Lean source

Canonical source
Full Lean sourceLean 4
lemma DeterminantBound.application (hd : 4  d) (M : )    (hM : M = sSup {max (b i) (c i) | i  Set.Icc 4 d}) :    ν < 1 + δ - a 3 - M + min (a 3 / 4) (M / 3) := by  have hM' : M  {max (b i) (c i) | i  Set.Icc 4 d} := by    rw [hM]    exact ((Set.nonempty_Icc.2 hd).image _).csSup_mem ((Set.finite_Icc 4 d).image _)  obtain i, hi₁, hi₂, hM' := hM'  wlog hbc : c i  b i generalizing b c  · exact this hdac hdab (by simp [hM, max_comm]) (by simp [hM', max_comm]) (le_of_not_le hbc)  replace hM' : M = b i := by simp [ hM', hbc]  refine hdab.trans_le ?_  refine csInf_le_of_le determinantBound_set_finite.bddBelow    3, i, by simp; omega, by simp; omega, rfl ?_  simp only [hM']  gcongr _ + min (_ / ?_) _  · exact ha.nonneg 3  · simpa
Project
ABC Exceptions
License
Apache-2.0
Commit
d8ace7bbaa23
Source
ABCExceptions/Section4.lean:181-197

Reuse this declaration

Bring the exact result into your workflow

The import identifies the source module. Your project still needs the pinned package dependency shown on this page.

What this badge means

This completion status comes from the project or community source. It has not yet been represented here as an independent rebuild and axiom audit.

Continue in this project

Related declarations

Project-declaredLean 4.21.0-rc3

Exists nice factorization

exists_nice_factorization

Plain-language statement

Proposition 2.5. The bulk of the proof is in the section NiceFactorization.

number theoryABC conjectureDiophantine equations

Source project: ABC Exceptions

Person-level attribution pending.

View proof record
Project-declaredLean 4.21.0-rc3

Exists nice factorization

exists_nice_factorization'

Plain-language statement

Some basic consequences of Proposition 2.5, phrased in a way that make them more useful in the proof of Proposition 2.6.

number theoryABC conjectureDiophantine equations

Source project: ABC Exceptions

Person-level attribution pending.

View proof record
Project-declaredLean 4.21.0-rc3

Geometry Bound set finite

geometryBound_set_finite

Plain-language statement

The set that we are taking the infimum over in the geometry bound is a finite set.

number theoryABC conjectureDiophantine equations

Source project: ABC Exceptions

Person-level attribution pending.

View proof record