Alphabeta Math
False statementConstruction: Literature-sourcedVerification: AI-generatedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14
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.

Ergodic averages need not equal the space mean without ergodicity

Statement

Assume the Axiom of Countable Choice. False claim: in every measure-preserving probability system, Anf converges almost everywhere to the constant fdμ.

Facts & Assumptions

Given: Countable choice, Lebesgue probability on the circle, T=R1/2, and f=1E for E=[0,1/4)[1/2,3/4).

[F1]

Every circle rotation preserves Lebesgue probability (Circle rotations preserve Lebesgue measure).

[F2]

The averages are Anf=n1k<nfTk (Ergodic partial sums, time averages, and the invariant L2 subspace).

[F4]

Countable choice is the standing assumption required by the circle-measure and interval-measure suppliers (The Axiom of Countable Choice (ACω)).

Refutation

technique · constructive invariant witness
1.1

Addition of 1/2 modulo one interchanges the two component intervals of E. Therefore T1E=E and fT=f.

givenconstructalgebra
2.1

It follows from [F2] that Anf=f at every point for every n1. Yet f is nonconstant, while fdλ=1/4+1/4=1/2 by [F3].

F2F3step 1.1
3.1

Thus this measure-preserving probability system has a bounded observable whose averages do not approach its constant space mean. Ergodicity is the missing hypothesis. Countable choice is used only through [F1] and [F3].

F1F3F4step 2.1discharge-construct

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

30 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