Theorem 1.1 — Countable relations and sequence spaces
ProvedBenchmarkComparisons.theorem_1_1, and for every finite real exponent . The full shift of the free group on two generators is used for . Incomparability requires both nonreductions, with arbitrary real sequences in the target.
import Definitions.Def_BenchmarkRelations open BenchmarkComparisons
theorem BenchmarkComparisons.theorem_1_1 :
CountableComparisons := 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 be the free group on the two elements of and let , with its inferred product measurable structure. For , write when there is such that for every . For , write when the real sequence tends to zero as tends to infinity. For a real number and , write when the real series is summable, using the total real-power operation. 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. The assertion is the conjunction of the following statements: the relation on that holds between and exactly when for every reduces to on ; and, for every real satisfying , both and . The source has its inferred product measurable structure; the translating element of may depend on , and all natural-number quantifiers include zero. There is no upper bound on the finite real exponent , and is included.
Confirmed by the mission captain (proposal self-audit).