Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Borel upper bounds and real ℓ1\ell_1ℓ1​ coset relations

Definition
NoBorelUpperBound20261101

by username · Nov 2, 2026 · Mathlib c5ea003 (Lean v4.30.0)

borel-reducibilitydescriptive-set-theoryequivalence-relationspolish-spaces

A relation is Borel when its graph is measurable in the Borel sigma algebra of the product topology. Borel reducibility means that a Borel measurable map preserves and reflects the relation on every pair of points. A relation F is an upper bound for the F-sigma equivalence relations when every equivalence relation with an F-sigma graph on every Polish source admits such a reduction to F. This predicate imposes no complexity or equivalence assumption on F by itself.

The fixed real sequence space is ℓ1(N;R)\ell_1(\mathbb N;\mathbb R)ℓ1​(N;R) with its norm topology. For a real linear subspace H, its additive coset relation is xEHy  ⟺  y−x∈HxE_Hy\iff y-x\in HxEH​y⟺y−x∈H. Borel sigma algebras are explicit, and Polish sources range over the ordinary Lean type universe; target universes are arbitrary.

Definition code
import Definitions.Def_NoUniversalFSigma261031052
import Mathlib.MeasureTheory.Constructions.Polish.Basic

set_option autoImplicit false

namespace NoBorelUpperBoundFSigma
universe u v

def IsBorelRelation {X : Type u} [TopologicalSpace X] (E : X → X → Prop) : Prop :=
  @MeasurableSet (X × X) (borel (X × X)) {p | E p.1 p.2}

def BorelReducible {X : Type u} {Y : Type v}
    [TopologicalSpace X] [TopologicalSpace Y]
    (E : X → X → Prop) (F : Y → Y → Prop) : Prop :=
  ∃ f : X → Y, NoUniversalFSigma.IsBorelMeasurable f ∧ NoUniversalFSigma.IsReduction f E F

def IsFSigmaUpperBound {Y : Type u} [TopologicalSpace Y] (F : Y → Y → Prop) : Prop :=
  ∀ (X : Type) [TopologicalSpace X] [PolishSpace X] (E : Setoid X),
    NoUniversalFSigma.IsFSigmaRelation E.r → BorelReducible E.r F

abbrev RealL1 := lp (fun _ : ℕ => ℝ) 1

def LinearCosetRelation (H : Submodule ℝ RealL1) (x y : RealL1) : Prop :=
  y - x ∈ H

end NoBorelUpperBoundFSigma
Source
No Borel upper bound for the F_sigma equivalence relations, research proof note dated 1 November 2026, supplied manuscript UniversalBorelEquivalence-20261101.tex, Section 1, Theorem 1; Section 4, Corollary 4 (using a fixed Banach-space isomorphism to standard real ell_1).
Read-back

What the Lean code literally says, in plain math · Codex (GPT-6 family; exact model identifier unavailable to this auditor)

IsBorelRelation. For any type XXX in an arbitrary universe, equipped with any topology, and any binary relation EEE on XXX, this predicate means that the set {(x,y)∈X×X:E(x,y)}\{(x,y)\in X\times X:E(x,y)\}{(x,y)∈X×X:E(x,y)} belongs to the Borel sigma algebra of the product topology on X×XX\times XX×X. The relation is not required to be reflexive, symmetric, or transitive. The empty space and the empty relation are allowed.

BorelReducible. For any two types XXX and YYY, potentially in different universes and each equipped with any topology, and any binary relations EEE on XXX and FFF on YYY, this predicate means that there exists a function f:X→Yf:X\to Yf:X→Y such that the inverse image of every Borel subset of YYY is a Borel subset of XXX, with both Borel sigma algebras taken from the specified topologies, and such that, for every x,y∈Xx,y\in Xx,y∈X, E(x,y)E(x,y)E(x,y) holds if and only if F(f(x),f(y))F(f(x),f(y))F(f(x),f(y)) holds. Neither relation is required to be an equivalence relation or a Borel relation, and fff is not required to be injective or surjective. Empty spaces are included: for empty XXX the empty function satisfies these requirements for every Y,E,FY,E,FY,E,F, whereas for nonempty XXX and empty YYY there is no such function.

IsFSigmaUpperBound. For any type YYY in an arbitrary universe equipped with any topology and any binary relation FFF on YYY, this predicate means the following: for every type XXX in the base universe, every topology on XXX making XXX a Polish space, and every equivalence relation EEE on XXX supplied as a setoid, if there is a sequence (Cn)n∈N(C_n)_{n\in\mathbb N}(Cn​)n∈N​ of closed subsets of X×XX\times XX×X whose union is exactly {(x,y):E(x,y)}\{(x,y):E(x,y)\}{(x,y):E(x,y)}, then there exists a function f:X→Yf:X\to Yf:X→Y whose inverse images of Borel subsets of YYY are Borel subsets of XXX, and for every x,y∈Xx,y\in Xx,y∈X one has E(x,y)E(x,y)E(x,y) if and only if F(f(x),f(y))F(f(x),f(y))F(f(x),f(y)). Here Polish means that the topology is separable and admits a compatible complete metric. The closed-set sequence is indexed by all natural numbers, including zero, and its members may be empty. The quantification includes empty Polish spaces; on an empty domain the reduction condition is vacuous. No hypothesis requires the topology on YYY to be Polish, or requires FFF to be Borel, to have a graph that is a countable union of closed sets, or to be an equivalence relation. In particular, empty YYY is permitted as an argument to this predicate, although the predicate then fails because a one-point Polish domain has no function into YYY.

RealL1. This abbreviation denotes the real vector space of sequences (xn)n∈N(x_n)_{n\in\mathbb N}(xn​)n∈N​ of real numbers such that ∑n=0∞∣xn∣<∞\sum_{n=0}^{\infty}|x_n|<\infty∑n=0∞​∣xn​∣<∞, namely the space ℓ1(N,R)\ell^1(\mathbb N,\mathbb R)ℓ1(N,R) constructed with exponent 111. The index set includes zero, and the zero sequence is included.

LinearCosetRelation. For every real linear subspace HHH of ℓ1(N,R)\ell^1(\mathbb N,\mathbb R)ℓ1(N,R) and every two elements x,yx,yx,y of that sequence space, this binary relation holds precisely when y−x∈Hy-x\in Hy−x∈H. No closedness, density, dimension, or other topological condition is imposed on HHH. All real linear subspaces are included, in particular the zero subspace and the entire space: these give equality and the relation holding for every pair, respectively. The relation includes x=yx=yx=y for every xxx because every linear subspace contains zero.

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