Theorem 1.4 — Two jump obstructions
ProvedBenchmarkComparisons.theorem_1_4Here the jump records the countable set of bounded-difference classes represented by a sequence of real sequences. Either nonreduction excludes every Borel map preserving and reflecting its source equivalence.
import Definitions.Def_BenchmarkRelations open BenchmarkComparisons
theorem BenchmarkComparisons.theorem_1_4 :
JumpObstructions := by sorry
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 be all real sequences, indexed starting at zero, with its inferred product measurable structure. Let and let be the type of probability measures on , with the measurable-space structure inferred by the imports. For , write when each measure is absolutely continuous with respect to the other, so that they have exactly the same null sets. For , write when the real sequence tends to zero as tends to infinity. For , write when there is a real constant such that for every . For relations on a measurable space and on a measurable space , write to mean that there exists a measurable function such that, for every , if and only if ; a separate witnessing function is allowed for each asserted reduction. Give its inferred product measurable structure, and define a relation there by: holds precisely when for every there exists with , and for every there exists with . Thus each match has its own real bound on all inner coordinates, with no uniform bound required across matches. The assertion is the conjunction and . The two directions in the definition of do not require a bijection, unique matches, or absence of repeated sequences; all inner and outer indices include zero. There are no further hypotheses.
Confirmed by the mission captain (proposal self-audit).