Tau min exists measure
tau_min_exists_measure
Plain-language statement
A pair of measures minimizing exists.
Exact Lean statement
lemma tau_min_exists_measure [MeasurableSingletonClass G] :
∃ (μ : Measure G × Measure G),
IsProbabilityMeasure μ.1 ∧ IsProbabilityMeasure μ.2 ∧
∀ (ν₁ : Measure G) (ν₂ : Measure G), IsProbabilityMeasure ν₁ → IsProbabilityMeasure ν₂ →
τ[id ; μ.1 # id ; μ.2 | p] ≤ τ[id ; ν₁ # id ; ν₂ | p]Formal artifact
Lean source
lemma tau_min_exists_measure [MeasurableSingletonClass G] : ∃ (μ : Measure G × Measure G), IsProbabilityMeasure μ.1 ∧ IsProbabilityMeasure μ.2 ∧ ∀ (ν₁ : Measure G) (ν₂ : Measure G), IsProbabilityMeasure ν₁ → IsProbabilityMeasure ν₂ → τ[id ; μ.1 # id ; μ.2 | p] ≤ τ[id ; ν₁ # id ; ν₂ | p] := by let _i : TopologicalSpace G := (⊥ : TopologicalSpace G) -- Equip G with the discrete topology. have : DiscreteTopology G := ⟨rfl⟩ let T : ProbabilityMeasure G × ProbabilityMeasure G → ℝ := -- restrict τ to the compact subspace fun ⟨μ₁, μ₂⟩ ↦ τ[id ; μ₁ # id ; μ₂ | p] have T_cont : Continuous T := by apply continuous_tau_restrict_probabilityMeasure have : Inhabited G := ⟨0⟩ -- Need to record this for Lean to know that proba measures exist. obtain ⟨μ, _, hμ⟩ := @IsCompact.exists_isMinOn ℝ (ProbabilityMeasure G × ProbabilityMeasure G) _ _ _ _ Set.univ isCompact_univ ⟨default, trivial⟩ T T_cont.continuousOn use ⟨μ.1.toMeasure, μ.2.toMeasure⟩ refine ⟨μ.1.prop, μ.2.prop, ?_⟩ intro ν₁ ν₂ Pν₁ Pν₂ rw [isMinOn_univ_iff] at hμ let ν : ProbabilityMeasure G × ProbabilityMeasure G := ⟨⟨ν₁, Pν₁⟩, ν₂, Pν₂⟩ exact hμ ν- Project
- Polynomial Freiman-Ruzsa project
- License
- Apache-2.0
- Commit
- a177b2e4abe4
- Source
- PFR/TauFunctional.lean:126-144
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
Approx hom pfr
approx_hom_pfr
Project documentation
An approximate-homomorphism theorem for finite elementary abelian -groups. Let and . If at least a proportion of pairs satisfy , then there are an additive homomorphism and a constant such that for at least values of .
Source project: Polynomial Freiman-Ruzsa project
Person-level attribution pending.
Better PFR conjecture
better_PFR_conjecture
Plain-language statement
If is finite non-empty with , then there exists a subgroup of with such that can be covered by at most translates of .
Source project: Polynomial Freiman-Ruzsa project
Person-level attribution pending.
Better PFR conjecture
better_PFR_conjecture'
Project documentation
Polynomial Freiman-Ruzsa theorem with exponent , without a finite ambient-group assumption. Let be a nonempty finite subset of an elementary abelian -group. If , then there are a finite subspace and a finite set such that , , and .
Source project: Polynomial Freiman-Ruzsa project
Person-level attribution pending.