Alphabeta Math
CounterexampleConstruction: AI-generatedVerification: 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.

A nonintegrable observable with divergent ergodic averages

Statement refuted

Assume the Axiom of Countable Choice. A finite-valued measurable observable need not have a finite almost-everywhere ergodic-average limit when the L1 hypothesis is omitted.

Facts & Assumptions

Given: Countable choice, the doubling map D2 on ([0,1),λ), and f(0)=0, f(x)=1/x for x>0.

[F1]

Strict superlevel sets characterize extended-real measurability, and Borel sets are Lebesgue measurable (Extended-real-valued measurable functions, Assuming countable choice, every Borel subset of Rn is Lebesgue measurable).

[F3]

The harmonic series diverges and monotone convergence holds (For rational p>0, ∑1/kp converges iff p>1, Monotone convergence for the integral).

[F4]

Doubling is ergodic; Birkhoff gives invariant limits for integrable truncations, and invariant finite functions are constant in an ergodic probability system (Doubling is ergodic for Lebesgue measure, Birkhoff pointwise ergodic theorem, Equivalent invariant-set and invariant-function criteria for ergodicity).

[F5]

Dominated convergence and integral invariance identify bounded average limits (Dominated convergence, Integral invariance under measure-preserving maps).

[F6]

Countable unions of null sets are null (Finite and countable subadditivity of measures).

Counterexample

technique · constructive truncation argument
1.1F1constructalgebra

The strict superlevel sets of f are [0,1) for negative levels, (0,1) at level zero, and (0,min⁡{1,1/a}) at positive level a (with the ambient endpoint omitted). They are Borel, so [F1] makes the everywhere finite f measurable.

1.2F2algebra

On Ik=[1/(k+1),1/k) one has f≥k. Thus monotonicity and the simple-integral formula give, for every N, ∫f dλ≥∑k=1Nkλ(Ik)=∑k=1N1k+1.

2.1F2F3step 1.2

The last sums are unbounded by [F3]. Hence ∫f=+∞, so f is not integrable in the sense of Integrable real and complex functions, and their integrals.

3.1F3step 1.1step 2.1

Put fm=min⁡{f,m} for m≥1. These are bounded integrable functions, fm↑f, and [F3] yields cm:=∫fm dλ↑+∞.

4.1F4F5step 3.1

For each m, [F4] makes Anfm converge almost everywhere to a constant. Since the averages are bounded by m, [F5] identifies that constant as cm.

5.1F6step 3.1step 4.1

Outside the countable union of the exceptional null sets in step 4.1, which is null by [F6], all these limits hold simultaneously. Since f≥fm, there lim inf⁡nAnf≥lim⁡nAnfm=cm for every m. Letting m→∞ gives Anf→+∞.

6.1step 2.1step 5.1discharge-construct∎

Thus this finite measurable but nonintegrable f is the promised counterexample. Countable choice is inherited from the Lebesgue/doubling suppliers; the truncations are explicit.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

88 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