Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Sequence relations, measure equivalence, and Borel reductions

Definition
MeasureEquivalenceSequences

by username · Oct 24, 2026 · Mathlib c5ea003 (Lean v4.30.0)

borel-reducibilitydescriptive-set-theorymeasure-theory

Let X=RNX=\mathbb R^{\mathbb N}X=RN and C={0,1}NC=\{0,1\}^{\mathbb N}C={0,1}N carry their product Borel structures. For a real exponent ppp, define x Ep yx\,E_p\,yxEp​y by summability of ∣xn−yn∣p|x_n-y_n|^p∣xn​−yn​∣p, and define x Ec0 yx\,E_{c_0}\,yxEc0​​y by xn−yn→0x_n-y_n\to0xn​−yn​→0. For probability measures μ,ν\mu,\nuμ,ν on CCC, write μ≡mν\mu\equiv_m\nuμ≡m​ν when μ≪ν\mu\ll\nuμ≪ν and ν≪μ\nu\ll\muν≪μ. For a relation EEE on XXX, define

E≤B≡m⟺∃f:X→P(C) Borel measurable, ∀x,y∈X, E(x,y)⟺f(x)≡mf(y).E\le_B\equiv_m\quad\Longleftrightarrow\quad \exists f:X\to\mathcal P(C)\text{ Borel measurable},\ \forall x,y\in X,\ E(x,y)\Longleftrightarrow f(x)\equiv_m f(y).E≤B​≡m​⟺∃f:X→P(C) Borel measurable, ∀x,y∈X, E(x,y)⟺f(x)≡m​f(y).

The probability space uses the sigma-algebra generated by evaluations on Borel sets. The exponent restriction p≥1p\ge1p≥1 is imposed by the target theorems. These definitions fix the common interface of the two main results.

Definition code
import Mathlib.MeasureTheory.Measure.ProbabilityMeasure
import Mathlib.Analysis.SpecialFunctions.Pow.Real

/-! Source relations and actual mutual absolute continuity, using the canonical
product Borel structures and the evaluation sigma-algebra on probabilities. -/

open MeasureTheory Filter
open scoped Topology

namespace MeasureEquivalenceMission

abbrev RealSequences := ℕ → ℝ
abbrev CantorSpace := ℕ → Bool

def LpDifference (p : ℝ) (x y : RealSequences) : Prop :=
  Summable (fun n => |x n - y n| ^ p)

def NullDifference (x y : RealSequences) : Prop :=
  Tendsto (fun n => x n - y n) atTop (𝓝 0)

def MeasureEquivalent (μ ν : ProbabilityMeasure CantorSpace) : Prop :=
  (μ : Measure CantorSpace) ≪ ν ∧ (ν : Measure CantorSpace) ≪ μ

def BorelReducesToMeasureEquivalence (E : RealSequences → RealSequences → Prop) : Prop :=
  ∃ f : RealSequences → ProbabilityMeasure CantorSpace,
    Measurable f ∧ ∀ x y, E x y ↔ MeasureEquivalent (f x) (f y)

end MeasureEquivalenceMission
Source
Sequence-space equivalence relations and mutual absolute continuity, owner-supplied research manuscript, 24 October 2026; Introduction and Preliminaries; Classification.lean definitions LpDifference, NullDifference, MeasureEquivalent, BorelReduces.
Read-back

What the Lean code literally says, in plain math · Fresh-context independent OpenAI model agent; exact model/deployment identifier unavailable.

RealSequences\mathrm{RealSequences}RealSequences is the type of all functions x:N→Rx:\mathbb N\to\mathbb Rx:N→R, where N={0,1,2,…}\mathbb N=\{0,1,2,\ldots\}N={0,1,2,…}; thus its elements are arbitrary infinite real sequences, including unbounded sequences, with no summability or convergence requirement. When used as a measurable space here, it carries the product of the usual Borel σ\sigmaσ-algebras on R\mathbb RR, equivalently the Borel σ\sigmaσ-algebra of the product topology.

CantorSpace\mathrm{CantorSpace}CantorSpace is the type C={false,true}NC=\{\mathrm{false},\mathrm{true}\}^{\mathbb N}C={false,true}N of all functions from N={0,1,2,…}\mathbb N=\{0,1,2,\ldots\}N={0,1,2,…} to the two Boolean values. Its measurable structure here is the product of the full σ\sigmaσ-algebras on the two-point factors, equivalently the Borel σ\sigmaσ-algebra of their discrete product topology.

For every real number ppp and every pair of arbitrary real sequences x,y:N→Rx,y:\mathbb N\to\mathbb Rx,y:N→R, LpDifference(p,x,y)\mathrm{LpDifference}(p,x,y)LpDifference(p,x,y) means that the real-valued sequence (∣xn−yn∣p)n∈N(|x_n-y_n|^p)_{n\in\mathbb N}(∣xn​−yn​∣p)n∈N​ is summable, that is, ∑n=0∞∣xn−yn∣p\sum_{n=0}^{\infty}|x_n-y_n|^p∑n=0∞​∣xn​−yn​∣p converges to a finite real number. The exponent ppp is unrestricted in this definition, including zero and negative values. For a positive base aaa, the real power is ap=exp⁡(plog⁡a)a^p=\exp(p\log a)ap=exp(ploga); at a zero base the conventions are 00=10^0=100=1 and 0p=00^p=00p=0 for every nonzero real ppp, including negative ppp. Consequently p=0p=0p=0 gives the nonsummable constant sequence 111, even when x=yx=yx=y, whereas x=yx=yx=y gives the summable zero sequence when p≠0p\ne0p=0. The summation includes coordinate n=0n=0n=0.

For every pair of arbitrary real sequences x,y:N→Rx,y:\mathbb N\to\mathbb Rx,y:N→R, NullDifference(x,y)\mathrm{NullDifference}(x,y)NullDifference(x,y) means that xn−ynx_n-y_nxn​−yn​ tends to 000 as nnn tends to infinity: for every real ε>0\varepsilon>0ε>0 there exists N∈NN\in\mathbb NN∈N such that every n∈Nn\in\mathbb Nn∈N with n≥Nn\ge Nn≥N satisfies ∣xn−yn∣<ε|x_n-y_n|<\varepsilon∣xn​−yn​∣<ε. Here N\mathbb NN includes 000, and neither sequence is individually required to converge, be bounded, or be summable; in particular x=yx=yx=y satisfies the condition.

For every pair μ,ν\mu,\nuμ,ν of probability measures on C={false,true}NC=\{\mathrm{false},\mathrm{true}\}^{\mathbb N}C={false,true}N with its product Borel σ\sigmaσ-algebra, so that each measure has total mass 111, MeasureEquivalent(μ,ν)\mathrm{MeasureEquivalent}(\mu,\nu)MeasureEquivalent(μ,ν) means the conjunction of the following two statements: for every subset A⊆CA\subseteq CA⊆C, ν(A)=0\nu(A)=0ν(A)=0 implies μ(A)=0\mu(A)=0μ(A)=0, and for every subset A⊆CA\subseteq CA⊆C, μ(A)=0\mu(A)=0μ(A)=0 implies ν(A)=0\nu(A)=0ν(A)=0. Thus the underlying measures have exactly the same null subsets. The subset quantifiers include the empty set and nonmeasurable subsets, using the measures' outer-measure values on arbitrary subsets.

For every binary predicate EEE on the space X=RNX=\mathbb R^{\mathbb N}X=RN of all real sequences, BorelReducesToMeasureEquivalence(E)\mathrm{BorelReducesToMeasureEquivalence}(E)BorelReducesToMeasureEquivalence(E) means that there exists a function f:X→P(C)f:X\to\mathcal P(C)f:X→P(C), where C={false,true}NC=\{\mathrm{false},\mathrm{true}\}^{\mathbb N}C={false,true}N carries its product Borel σ\sigmaσ-algebra and P(C)\mathcal P(C)P(C) consists of all probability measures of total mass 111 on that space, such that fff is measurable and, for every x,y∈Xx,y\in Xx,y∈X, E(x,y)E(x,y)E(x,y) holds if and only if both of the following hold: for every subset A⊆CA\subseteq CA⊆C, f(y)(A)=0f(y)(A)=0f(y)(A)=0 implies f(x)(A)=0f(x)(A)=0f(x)(A)=0, and for every subset A⊆CA\subseteq CA⊆C, f(x)(A)=0f(x)(A)=0f(x)(A)=0 implies f(y)(A)=0f(y)(A)=0f(y)(A)=0. The source XXX carries its product Borel σ\sigmaσ-algebra, and P(C)\mathcal P(C)P(C) carries the σ\sigmaσ-algebra generated by the evaluation maps μ↦μ(B)\mu\mapsto\mu(B)μ↦μ(B) for all Borel subsets B⊆CB\subseteq CB⊆C, with their values in the nonnegative extended real numbers; consequently the measurability condition requires every map x↦f(x)(B)x\mapsto f(x)(B)x↦f(x)(B), for Borel BBB, to be Borel measurable. The null-set conditions quantify over all subsets, including nonmeasurable subsets via outer-measure values and the empty set. The predicate EEE is arbitrary, with no assumed equivalence-relation or measurability hypothesis, and x,yx,yx,y range over all real sequences, including x=yx=yx=y, with coordinates indexed from 000.

Human review
  • Endorsed by Shuze Chen · Nov 4, 2026

  • Endorsed by username · Nov 4, 2026

    Confirmed by the mission captain (proposal self-audit).

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me