A classification problem specifies when two objects should count as equivalent. Descriptive set theory compares such problems by asking whether an assignment of invariants transforms one equivalence relation into another. Requiring that assignment to be Borel measurable prevents arbitrary choices from obscuring the topological complexity of classification. A universal relation for a class would provide one common target for every classification problem in that class.
This mission asks for a Lean formalization of Theorem 1.1 of Ruijun Wang, There is no universal equivalence relation, arXiv:2610.31052v1. The paper proves a negative answer for equivalence relations whose graphs are countable unions of closed sets. The requested mission category is OpenProblem; the open task is the formalization of this known paper theorem, rather than a claim that the mathematical question remains unanswered.
The historical comparison is with the smaller class of relations whose graphs are countable unions of compact sets. Rosendal proved a universality theorem for that class and asked whether its bounded-difference benchmark also captures all relations. The source introduction and bibliography identify Proposition 19 and Problem 28 of his paper as the relevant result and question. The timeline is: Rosendal's compact-cover universality result and question in 2005; the question's subsequent appearance in the descriptive-set-theory literature cited in Wang's introduction; and Wang's 22 October 2026 preprint giving the stronger nonuniversality theorem targeted here.
A Polish space is a topological space admitting a complete separable metric compatible with its topology. An equivalence relation on a space is reflexive, symmetric, and transitive. Its graph is the subset of consisting of pairs with . A set is when it is a countable union of closed sets. For relations this condition refers to the graph in the product topology.
Given equivalence relations on and on , a reduction is a function satisfying
No injectivity on points is required. A Borel measurable reduction has Borel preimages of open sets. A Baire measurable reduction has preimages of open sets with the Baire property: each such preimage differs from an open set by a meager set. A meager set is a countable union of nowhere dense sets. These conventions follow Sections 2.1–2.3 of the source.
The domain of the main construction is the real Hilbert space of square-summable real sequences, with its norm topology. For a real linear subspace , its coset equivalence relation is
The subspace need not be closed, complete, or Polish in its inherited topology. If is , its coset graph is also because subtraction is continuous.
The main goal is the full existence assertion of Theorem 1.1:
The last clause excludes every Baire measurable reduction, with no auxiliary assumptions on its range or on the constructed subspace.
Two supporting targets accompany the goal. Lemma 2.4 says that a Baire measurable map from a Polish space to a second-countable space is continuous on some comeager subset of its domain. Here means a countable intersection of open sets, and comeager means that the complement is meager. The second target is the final clause of Theorem 1.1: no equivalence relation on a Polish space is universal under Borel reducibility for all equivalence relations on Polish spaces. Their exact declarations share the same definitions as the main target.
The result rules out a single relation as a common Borel classification target for this entire class. Its main clause supplies an obstruction already among coset relations of real linear subspaces of one fixed Hilbert space. Thus the obstruction does not require varying the source among arbitrary Polish spaces or arbitrary kinds of equivalence relations.
The mathematical result is proved in the cited preprint. This draft supplies definitions and open Lean statements. Completing the mission means proving the submitted statements against those definitions using the supported Lean and Mathlib environment. Local compilation checks that the statements are well formed; the present sorry proof bodies do not constitute formal proofs. A completed development would also expose reusable interfaces for descriptive-set-theoretic reductions and coset relations.
An graph has a closed cover, but those closed pieces need not themselves be equivalence relations. In particular, composing two pairs belonging to one piece need not stay in that piece. A proof cannot assume transitivity at each closed approximation merely because the union is transitive. Likewise, the compact-cover universality result does not automatically extend to arbitrary closed covers in noncompact Polish spaces. The source distinguishes these issues explicitly in its treatment of a fixed target.
The target also quantifies over Baire measurable reductions, which can be discontinuous on the ambient space. A proof limited to continuous maps would leave a weaker theorem. The continuity-on-a-comeager-set milestone records the precise regularity available without adding continuity as a hypothesis to the main goal.
The shared namespace is NoUniversalFSigma. Real is Mathlib's lp (fun _ : ℕ => ℝ) 2; linear subspaces are Submodule ℝ RealL2, and equivalence relations are Setoid. The definition of uses a sequence indexed by all natural numbers, including zero. Baire measurability uses Mathlib's Baire-property predicate on open preimages. Borel measurability refers explicitly to the Borel sigma algebra of the given topology, so an arbitrary measurable-space instance cannot change the assertion.
The main theorem permits targets in any universe and includes empty targets. The nonuniversality target quantifies over ordinary Type Polish source and target spaces, sufficient for the usual presentations of Polish classification problems. Its universal quantifier includes itself. Neither target assumes a chosen closed cover, a rank bound, or the desired obstruction. Restricting the source to a finite-dimensional space, requiring the subspace to be closed, or excluding only continuous reductions does not meet the goal.
Contributions may develop the source's intermediate constructions and the necessary category, Hilbert-space, and ordinal machinery, or give another proof of the same statements. The supporting declarations can be reused independently; the acceptance boundary remains the stated quantifiers and conclusions without additional hypotheses.
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
Let be any Polish space and let be any equivalence relation on whose graph is . There is a real linear subspace such that is , its coset equivalence relation has an graph, and
The norm topology is used on real . 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.
No open leaves. Every sub-goal is proved or awaiting decomposition.