Vanishing mean deficits along algebraic roots force subgroup membership
ProvedMeasureEquivalenceRigidity.ae_mem_of_root_mean_affinitybenchmark-operator-20261026descriptive-set-theoryoperator-algebras
Let be a probability measure and let be additive subgroups of an abelian group . Fix and roots with natural multiplicities satisfying . Assume the sets are measurable. Suppose measurable functions vanish almost everywhere when , and
Then for -almost every . The conclusion uses only the algebraic root identities and the averaged estimates.
Preamble
import Mathlib.Data.Real.Basic
import Mathlib.MeasureTheory.Integral.Bochner.Set
import Mathlib.MeasureTheory.Measure.ProbabilityMeasure
import Mathlib.Topology.Order.OrderClosed
set_option autoImplicit false
namespace MeasurableEquiv
end MeasurableEquiv
namespace MeasureEquivalenceCompactAveraging
end MeasureEquivalenceCompactAveraging
namespace MeasureEquivalenceDenseInvariance
end MeasureEquivalenceDenseInvariance
namespace MeasureEquivalenceDensity
end MeasureEquivalenceDensity
namespace MeasureEquivalenceDensityGraph
end MeasureEquivalenceDensityGraph
namespace MeasureEquivalenceEquidecomposition
end MeasureEquivalenceEquidecomposition
namespace MeasureEquivalenceEquidecomposition.greedyRemainder
end MeasureEquivalenceEquidecomposition.greedyRemainder
namespace MeasureEquivalenceErgodicDecomposition
end MeasureEquivalenceErgodicDecomposition
namespace MeasureEquivalenceHellinger
end MeasureEquivalenceHellinger
namespace MeasureEquivalenceInducedCorners
end MeasureEquivalenceInducedCorners
namespace MeasureEquivalenceInvariantGraph
end MeasureEquivalenceInvariantGraph
namespace MeasureEquivalenceInverseAC
end MeasureEquivalenceInverseAC
namespace MeasureEquivalenceL2Coefficients
end MeasureEquivalenceL2Coefficients
namespace MeasureEquivalenceL2Restriction
end MeasureEquivalenceL2Restriction
namespace MeasureEquivalenceL2Transport
end MeasureEquivalenceL2Transport
namespace MeasureEquivalenceMarkov
end MeasureEquivalenceMarkov
namespace MeasureEquivalenceMarkov.kernelIterate
end MeasureEquivalenceMarkov.kernelIterate
namespace MeasureEquivalenceRNGraph
end MeasureEquivalenceRNGraph
namespace MeasureEquivalenceRNPresentation
end MeasureEquivalenceRNPresentation
namespace MeasureEquivalenceResearch
end MeasureEquivalenceResearch
namespace MeasureEquivalenceRestrictedPhase
end MeasureEquivalenceRestrictedPhase
namespace MeasureEquivalenceRestrictedProduct
end MeasureEquivalenceRestrictedProduct
namespace MeasureEquivalenceRestrictedProduct.CompatibleStages
end MeasureEquivalenceRestrictedProduct.CompatibleStages
namespace MeasureEquivalenceRestrictedProduct.CompatibleStages.mk
end MeasureEquivalenceRestrictedProduct.CompatibleStages.mk
namespace MeasureEquivalenceRestrictedRoots
end MeasureEquivalenceRestrictedRoots
namespace MeasureEquivalenceRigidity
end MeasureEquivalenceRigidity
namespace MeasureEquivalenceRootContinuity
end MeasureEquivalenceRootContinuity
namespace MeasureEquivalenceSharedDensity
end MeasureEquivalenceSharedDensity
namespace MeasureEquivalenceSolenoid
end MeasureEquivalenceSolenoid
namespace MeasureEquivalenceTopology
end MeasureEquivalenceTopology
namespace MeasureEquivalenceZeroSumAffinity
end MeasureEquivalenceZeroSumAffinity
namespace MeasureUnitary
end MeasureUnitary
namespace MeasureUnitary.FiniteBorelSection
end MeasureUnitary.FiniteBorelSection
namespace OperatorCoding
end OperatorCoding
namespace OperatorCoding.operatorUnitaryPair
end OperatorCoding.operatorUnitaryPair
namespace lp
end lp
/-!
The countable-roots step in the manuscript's quasi-invariance rigidity argument.
This module is a helper for Theorems 1.3 and 1.4. It does not assert the
ergodic decomposition, affinity estimate, or representation construction.
The hypotheses below are precisely the quantitative component estimates
needed after those analytic steps have been established.
-/
open Filter MeasureTheory
open scoped Topology ENNReal
namespace MeasureEquivalenceRigidity
end MeasureEquivalenceRigidity
open MeasureEquivalenceRigidity
variable {Y : Type*} [MeasurableSpace Y] {μ : Measure Y}
variable {K : Type*} [AddCommGroup K]
Formal statement
theorem MeasureEquivalenceRigidity.ae_mem_of_root_mean_affinity
[IsProbabilityMeasure μ]
(S : Y → AddSubgroup K) (x : K) (root : ℕ → K)
(multiplicity : ℕ → ℕ)
(hroot : ∀ n, multiplicity n • root n = x)
(A : ℕ → Y → ℝ)
(hbad : ∀ n, MeasurableSet {y | root n ∉ S y})
(hA : ∀ n, Measurable (A n))
(hA_nonneg : ∀ n y, 0 ≤ A n y)
(hA_le : ∀ n y, A n y ≤ 1)
(hzero : ∀ n, ∀ᵐ y ∂μ, root n ∉ S y → A n y = 0)
(ε : ℕ → ℝ)
(hmean : ∀ n, 1 - ε n ≤ ∫ y, A n y ∂μ)
(hε : Tendsto ε atTop (𝓝 0)) :
∀ᵐ y ∂μ, x ∈ S y := by sorry
Source
Ruijun Wang, Comparisons of benchmark equivalence relations, Theorem 1.5 (formerly MeasureEquivalence.tex, Theorem 1.3); supporting declaration MeasureEquivalenceRigidity.ae_mem_of_root_mean_affinity in RigidityRoots.lean, lines 118–154; local source SHA-256 2065c065a8ef889655833f9182163ac012be4432afb18eec37736d74e9464056. Designated upload repository: https://github.com/RayjunWang/Benchmark (no source commit published yet).