Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Thomas Theorem 6.12 — The established ℓ2\ell_2ℓ2​ obstruction

Proved
BenchmarkComparisons.classical_countable_ell_two

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

benchmark-comparisonsborel-reducibilitydescriptive-set-theoryfunctional-analysis
E∞̸≤Bℓ2.E_\infty\not\leq_B\ell_2.E∞​≤B​ℓ2​.

There is no Borel map from the full free-two-group shift to all real sequences that preserves and reflects shift-orbit equivalence as square-summable difference. This is an established literature input to the finite-exponent comparison.

Preamble
import Definitions.Def_BenchmarkRelations

open BenchmarkComparisons

Formal statement
theorem BenchmarkComparisons.classical_countable_ell_two :
    ¬ BorelReduces EInfinity (LpDifference 2) := by sorry
Source
Ruijun Wang, Comparisons of benchmark equivalence relations, supplied Benchmark.tex, Section 1; source SHA256 c3c80147a17922e19044935df97b27a2a2a0be5f86665e0869d6a376250d6330; repository designated by the author: https://github.com/RayjunWang/Benchmark. Simon Thomas, A descriptive view of unitary group representations, JEMS 17 (2015), Theorem 6.12, p. 1779, https://ems.press/content/serial-article-files/32053?nt=1.
Read-back

What the Lean code literally says, in plain math · Fresh-context independent Codex subagent; no concrete model deployment identifier was exposed to the auditor.

Let S=RNS=\mathbb{R}^{\mathbb{N}}S=RN be all real sequences, indexed starting at zero, with its inferred product measurable structure. Let GGG be the free group on the two elements of Fin⁡(2)\operatorname{Fin}(2)Fin(2) and let X={false,true}GX=\{\mathrm{false},\mathrm{true}\}^{G}X={false,true}G, with its inferred product measurable structure. For a,b∈Xa,b\in Xa,b∈X, write a E ba\,E\,baEb when there is g∈Gg\in Gg∈G such that b(h)=a(g−1h)b(h)=a(g^{-1}h)b(h)=a(g−1h) for every h∈Gh\in Gh∈G. The assertion is that there exists no measurable function f:X→Sf:X\to Sf:X→S such that, for every a,b∈Xa,b\in Xa,b∈X, the condition a E ba\,E\,baEb holds if and only if the series ∑n=0∞∣f(a)n−f(b)n∣2\sum_{n=0}^{\infty}|f(a)_n-f(b)_n|^2∑n=0∞​∣f(a)n​−f(b)n​∣2 is summable. All Boolean-valued functions on GGG and all natural-number coordinates, including zero, are included; there are no additional hypotheses.

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