Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Classical positive direction for the range 1≤p≤21\le p\le21≤p≤2

Proved
MeasureEquivalenceMission.classical_positive

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

borel-reducibilitydescriptive-set-theorymeasure-theory

For every real exponent 1≤p≤21\le p\le21≤p≤2, equivalence modulo an ℓp\ell_pℓp​ difference on all real sequences has a Borel reduction to mutual absolute continuity of Cantor probabilities:

Ep≤B≡m.E_p\le_B\equiv_m.Ep​≤B​≡m​.

The map is required to preserve and reflect equivalence on every pair. This classical result supplies the positive-range milestone without adding continuity or special image conditions.

Preamble
import Definitions.Def_MeasureEquivalenceSequences

open MeasureEquivalenceMission

Formal statement
theorem MeasureEquivalenceMission.classical_positive (p : ℝ)
    (hp : 1 ≤ p) (hp2 : p ≤ 2) :
    BorelReducesToMeasureEquivalence (LpDifference p) := by sorry
Source
Sequence-space equivalence relations and mutual absolute continuity, owner-supplied research manuscript, 24 October 2026; Proposition labelled prop:positive; Kakutani (1948), https://doi.org/10.2307/1969123; Dougherty–Hjorth (1999), https://doi.org/10.1090/S0002-9947-99-02261-8.
Read-back

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

For every real number ppp satisfying both 1≤p1\le p1≤p and p≤2p\le2p≤2, there exists a function f:RN→P(C)f:\mathbb R^{\mathbb N}\to\mathcal P(C)f:RN→P(C), where C={false,true}NC=\{\mathrm{false},\mathrm{true}\}^{\mathbb N}C={false,true}N with its product Borel σ\sigmaσ-algebra and P(C)\mathcal P(C)P(C) consists of all probability measures of total mass 111 on CCC, such that fff is measurable from the product Borel σ\sigmaσ-algebra on RN\mathbb R^{\mathbb N}RN to the σ\sigmaσ-algebra on P(C)\mathcal P(C)P(C) generated by the evaluations μ↦μ(B)\mu\mapsto\mu(B)μ↦μ(B) for all Borel B⊆CB\subseteq CB⊆C, and, for every pair of arbitrary real sequences x,y:N→Rx,y:\mathbb N\to\mathbb Rx,y:N→R, ∑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 if and only if f(x)f(x)f(x) and f(y)f(y)f(y) have the same null subsets. Explicitly, the latter condition is both ∀A⊆C, f(y)(A)=0⇒f(x)(A)=0\forall A\subseteq C,\ f(y)(A)=0\Rightarrow f(x)(A)=0∀A⊆C, f(y)(A)=0⇒f(x)(A)=0 and ∀A⊆C, f(x)(A)=0⇒f(y)(A)=0\forall A\subseteq C,\ f(x)(A)=0\Rightarrow f(y)(A)=0∀A⊆C, f(x)(A)=0⇒f(y)(A)=0, with arbitrary subsets, including the empty set and nonmeasurable subsets, evaluated by outer measure. Measurability of fff equivalently requires x↦f(x)(B)x\mapsto f(x)(B)x↦f(x)(B) to be Borel measurable for every Borel BBB. The exponent range includes p=1p=1p=1 and p=2p=2p=2, and the function may depend on ppp. The series starts at n=0n=0n=0, uses real powers of nonnegative numbers with 0p=00^p=00p=0 in this exponent range, and is tested for all sequences without separate boundedness, convergence, or summability assumptions, including x=yx=yx=y.

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