All proofs
Project-declaredLean 4.33.0-rc1 · mathlib@79d0395a1825

Tau min exists measure

tau_min_exists_measure

Plain-language statement

A pair of measures minimizing τ\tau 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

Canonical source
Full Lean sourceLean 4
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

Project-declaredLean 4.33.0-rc1

Approx hom pfr

approx_hom_pfr

Project documentation

An approximate-homomorphism theorem for finite elementary abelian 22-groups. Let f:GGf:G\to G' and K>0K>0. If at least a proportion K1K^{-1} of pairs (x,y)G2(x,y)\in G^2 satisfy f(x+y)=f(x)+f(y)f(x+y)=f(x)+f(y), then there are an additive homomorphism φ:GG\varphi:G\to G' and a constant cGc\in G' such that f(x)=φ(x)+cf(x)=\varphi(x)+c for at least G/(2144K122)|G|/(2^{144}K^{122}) values of xx.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Better PFR conjecture

better_PFR_conjecture

Plain-language statement

If AF2nA \subset {\bf F}_2^n is finite non-empty with A+AKA|A+A| \leq K|A|, then there exists a subgroup HH of F2n{\bf F}_2^n with HA|H| \leq |A| such that AA can be covered by at most 2K92K^9 translates of HH.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record
Project-declaredLean 4.33.0-rc1

Better PFR conjecture

better_PFR_conjecture'

Project documentation

Polynomial Freiman-Ruzsa theorem with exponent 99, without a finite ambient-group assumption. Let AA be a nonempty finite subset of an elementary abelian 22-group. If A+AKA|A+A|\le K|A|, then there are a finite subspace HH and a finite set cc such that Ac+HA\subseteq c+H, c<2K9|c|<2K^9, and HA|H|\le|A|.

additive combinatoricsentropyprobability

Source project: Polynomial Freiman-Ruzsa project

Person-level attribution pending.

View proof record