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.
Exact Lean statement
lemma geometryBound_set_finite :
Set.Finite
{ max 1 (∑ i ∈ I, i * a i + ∑ i ∈ I', i * b i + ∑ i ∈ I'', i * c i) -
(∑ i ∈ I, a i + ∑ i ∈ I', b i + ∑ i ∈ I'', c i) |
(I ⊆ Finset.Icc 1 d) (I' ⊆ Finset.Icc 1 d) (I'' ⊆ Finset.Icc 1 d) }Formal artifact
Lean source
lemma geometryBound_set_finite : Set.Finite { max 1 (∑ i ∈ I, i * a i + ∑ i ∈ I', i * b i + ∑ i ∈ I'', i * c i) - (∑ i ∈ I, a i + ∑ i ∈ I', b i + ∑ i ∈ I'', c i) | (I ⊆ Finset.Icc 1 d) (I' ⊆ Finset.Icc 1 d) (I'' ⊆ Finset.Icc 1 d) } := by let f (I I' I'' : Finset ℕ) : ℝ := max 1 (∑ i ∈ I, i * a i + ∑ i ∈ I', i * b i + ∑ i ∈ I'', i * c i) - (∑ i ∈ I, a i + ∑ i ∈ I', b i + ∑ i ∈ I'', c i) have : { f I I' I'' | (I ⊆ Finset.Icc 1 d) (I' ⊆ Finset.Icc 1 d) (I'' ⊆ Finset.Icc 1 d) } = (fun x ↦ f x.1 x.2.1 x.2.2) '' ((Finset.Icc 1 d).powerset ×ˢ (Finset.Icc 1 d).powerset ×ˢ (Finset.Icc 1 d).powerset) := by ext y simp only [Set.mem_setOf_eq, Set.mem_image, Set.mem_prod, Finset.mem_coe, Finset.mem_powerset, Prod.exists] constructor · rintro ⟨I, hI, I', hI', I'', hI'', rfl⟩ exact ⟨I, I', I'', ⟨hI, hI', hI''⟩, rfl⟩ · rintro ⟨I, I', I'', ⟨hI, hI', hI''⟩, rfl⟩ exact ⟨I, hI, I', hI', I'', hI'', rfl⟩ rw [this] exact Set.Finite.image _ (Set.toFinite _)- Project
- ABC Exceptions
- License
- Apache-2.0
- Commit
- d8ace7bbaa23
- Source
- ABCExceptions/Section4.lean:298-318
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
Determinant Bound application
DeterminantBound.application
Plain-language statement
A particular application of the determinant bound used in subcase 2.1
Source project: ABC Exceptions
Person-level attribution pending.
Exists nice factorization
exists_nice_factorization
Plain-language statement
Proposition 2.5. The bulk of the proof is in the section NiceFactorization.
Source project: ABC Exceptions
Person-level attribution pending.
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.
Source project: ABC Exceptions
Person-level attribution pending.