Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedSession-authored (Fable 5 assisted)precheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 2026-08-21
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Cousin's lemma: every gauge on a compact interval admits a fine tagged partition

Statement

For ab, every gauge on a compact interval admits a fine tagged partition.

Equivalently, every gauge admits a fine tagged partition, and every gauge admits at least one fine tagged partition. In particular, every gauge on each complementary compact interval admits a fine tagged partition.

Facts & Assumptions

Given: A gauge δ on [a,b].

[L1]

A nested sequence of nonempty closed bounded intervals whose lengths tend to zero has an intersection consisting of a single point (A nested sequence of nonempty closed bounded intervals has nonempty intersection, and the intersection is a single point exactly when the lengths tend to 0).

[L3]

A tagged partition is fine when every tagged cell lies inside its tag's gauge interval (Gauges and gauge-fine tagged partitions of a compact interval).

Proof

technique · contradiction
1.1

If a=b, the declared degenerate partition is fine; otherwise suppose, for contradiction, that [a,b] has no fine partition, bisect it, and at each stage retain the left half if it has no fine partition and otherwise the right half, which must have none because two fine half-partitions concatenate; the retained closed intervals are nested and have length (ba)2k, so [L2] and [L1] give one common point c.

givenL1L2assume-contra
2.1

Since δ(c)>0 and the retained lengths tend to zero, a sufficiently late retained interval lies inside (cδ(c),c+δ(c)); tagged by c, [L3] makes that one cell a fine partition, contradicting its construction.

step 1.1L3discharge-contradiction

Depends on

Used by

Dependency tree · two levels

33 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources