Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Theorem 1.1 — an FσF_\sigmaFσ​ linear-subspace obstruction for every target

Proved
NoUniversalFSigma.theorem1_1

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

arxiv-2610-31052descriptive-set-theoryequivalence-relationstopology

Let YYY be any Polish space and let FFF be any equivalence relation on YYY whose graph is FσF_\sigmaFσ​. There is a real linear subspace H⊆ℓ2H\subseteq\ell_2H⊆ℓ2​ such that HHH is FσF_\sigmaFσ​, its coset equivalence relation xEHx′  ⟺  x−x′∈HxE_Hx'\iff x-x'\in HxEH​x′⟺x−x′∈H has an FσF_\sigmaFσ​ graph, and

¬∃f:ℓ2→Y[f is Baire measurable ∧ ∀x,x′∈ℓ2, (x−x′∈H  ⟺  F(f(x),f(x′)))].\neg\exists f:\ell_2\to Y\quad\bigl[f\text{ is Baire measurable}\ \land\ \forall x,x'\in\ell_2,\ (x-x'\in H\iff F(f(x),f(x')))\bigr].¬∃f:ℓ2​→Y[f is Baire measurable ∧ ∀x,x′∈ℓ2​, (x−x′∈H⟺F(f(x),f(x′)))].

The norm topology is used on real ℓ2\ell_2ℓ2​. The subspace is not required to be closed or Polish. Empty target spaces are included, and the target space may lie in any Lean universe. This is the full existence assertion of Theorem 1.1; the separate nonuniversality target records its concluding consequence.

Preamble
import Definitions.Def_NoUniversalFSigma261031052

set_option autoImplicit false

universe u

/-- Theorem 1.1 of arXiv:2610.31052v1, main existence assertion. -/
Formal statement
theorem NoUniversalFSigma.theorem1_1
    {Y : Type u} [TopologicalSpace Y] [PolishSpace Y]
    (F : Setoid Y) (hF : NoUniversalFSigma.IsFSigmaRelation F.r) :
    ∃ H : Submodule ℝ NoUniversalFSigma.RealL2,
      NoUniversalFSigma.IsFSigma (H : Set NoUniversalFSigma.RealL2) ∧
      NoUniversalFSigma.IsFSigmaRelation (NoUniversalFSigma.CosetRelation H) ∧
      ¬ ∃ f : NoUniversalFSigma.RealL2 → Y,
        NoUniversalFSigma.IsBaireMeasurable f ∧
        NoUniversalFSigma.IsReduction f (NoUniversalFSigma.CosetRelation H) F.r := by sorry
Source
Ruijun Wang, There is no universal F_sigma equivalence relation, arXiv:2610.31052v1 (22 October 2026), Theorem 1.1, main existence assertion, Section 1, https://arxiv.org/html/2610.31052v1
Read-back

What the Lean code literally says, in plain math · GPT-6 (exact deployment identifier unavailable)

For any type YYY in an arbitrary universe, equipped with a Polish topology, meaning a separable and completely metrizable topology, and any specified equivalence relation FFF on YYY, assume that the graph {(a,b)∈Y×Y:F(a,b)}\{(a,b)\in Y\times Y:F(a,b)\}{(a,b)∈Y×Y:F(a,b)} is a countable union of closed subsets of Y×YY\times YY×Y with its product topology. Then there exists a real linear subspace HHH of ℓ2(N;R)\ell^2(\mathbb N;\mathbb R)ℓ2(N;R), the space of real sequences indexed by the natural numbers including 000 whose squares have finite sum, such that HHH is a countable union of closed subsets of ℓ2(N;R)\ell^2(\mathbb N;\mathbb R)ℓ2(N;R) in its usual norm topology, the graph {(x,y):x−y∈H}\{(x,y):x-y\in H\}{(x,y):x−y∈H} is a countable union of closed subsets of ℓ2(N;R)×ℓ2(N;R)\ell^2(\mathbb N;\mathbb R)\times\ell^2(\mathbb N;\mathbb R)ℓ2(N;R)×ℓ2(N;R) in the product topology, and there is no function f:ℓ2(N;R)→Yf:\ell^2(\mathbb N;\mathbb R)\to Yf:ℓ2(N;R)→Y satisfying both of the following conditions: for every open subset U⊆YU\subseteq YU⊆Y, there is an open subset V⊆ℓ2(N;R)V\subseteq\ell^2(\mathbb N;\mathbb R)V⊆ℓ2(N;R) whose symmetric difference with f−1(U)f^{-1}(U)f−1(U) is meagre in the norm topology; and for every x,y∈ℓ2(N;R)x,y\in\ell^2(\mathbb N;\mathbb R)x,y∈ℓ2(N;R), including x=yx=yx=y, x−y∈Hx-y\in Hx−y∈H holds if and only if F(f(x),f(y))F(f(x),f(y))F(f(x),f(y)) holds. A meagre set here means a set contained in a countable union of nowhere dense sets. The subspace quantifier imposes no additional topological closedness or dimension condition on HHH. The hypotheses permit an empty YYY; in that case the nonexistence clause holds because ℓ2(N;R)\ell^2(\mathbb N;\mathbb R)ℓ2(N;R) contains the zero sequence and no function from it to the empty set exists.

Human review
  • Endorsed by Shuze Chen · Oct 23, 2026

    Confirmed by the moderator at approval.

  • Endorsed by username · Oct 23, 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