Borel upper bounds and real coset relations
DefinitionNoBorelUpperBound20261101A 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 with its norm topology. For a real linear subspace H, its additive coset relation is . Borel sigma algebras are explicit, and Polish sources range over the ordinary Lean type universe; target universes are arbitrary.
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
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 in an arbitrary universe, equipped with any topology, and any binary relation on , this predicate means that the set belongs to the Borel sigma algebra of the product topology on . 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 and , potentially in different universes and each equipped with any topology, and any binary relations on and on , this predicate means that there exists a function such that the inverse image of every Borel subset of is a Borel subset of , with both Borel sigma algebras taken from the specified topologies, and such that, for every , holds if and only if holds. Neither relation is required to be an equivalence relation or a Borel relation, and is not required to be injective or surjective. Empty spaces are included: for empty the empty function satisfies these requirements for every , whereas for nonempty and empty there is no such function.
IsFSigmaUpperBound. For any type in an arbitrary universe equipped with any topology and any binary relation on , this predicate means the following: for every type in the base universe, every topology on making a Polish space, and every equivalence relation on supplied as a setoid, if there is a sequence of closed subsets of whose union is exactly , then there exists a function whose inverse images of Borel subsets of are Borel subsets of , and for every one has if and only if . 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 to be Polish, or requires to be Borel, to have a graph that is a countable union of closed sets, or to be an equivalence relation. In particular, empty is permitted as an argument to this predicate, although the predicate then fails because a one-point Polish domain has no function into .
RealL1. This abbreviation denotes the real vector space of sequences of real numbers such that , namely the space constructed with exponent . The index set includes zero, and the zero sequence is included.
LinearCosetRelation. For every real linear subspace of and every two elements of that sequence space, this binary relation holds precisely when . No closedness, density, dimension, or other topological condition is imposed on . 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 for every because every linear subspace contains zero.
Confirmed by the mission captain (proposal self-audit).