Alphabeta Math
Pipeline-generated
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.

The Ergodic Theorems of von Neumann and Birkhoff

1 · Prerequisites

2 · Summary

Time averages have two complementary convergence theories. The maximal ergodic inequality yields Birkhoff's almost-everywhere theorem for L1 observables on sigma-finite spaces, while Hilbert-space geometry yields von Neumann's L2 projection theorem without a pointwise conclusion. On finite measure spaces the Birkhoff limit is identified on the invariant sigma-algebra and the averages also converge in every finite Lp covered here. Ergodicity makes that limit the constant space mean.

The topological half of the page characterizes unique ergodicity by uniform averages of continuous functions. Irrational circle rotations then give Weyl equidistribution without invoking Fourier series. Integer-base cylinders turn the same pointwise theorem into Borel's normal-number theorem, while the one-sided fair-coin shift gives the heads-frequency strong law.

The final statements mark the hypotheses sharply: almost-everywhere is not everywhere, invariant limits need not be constant in nonergodic systems, L2 convergence alone is not a pointwise argument, irrationality matters for Weyl, normality is not universal, and mere measurability cannot replace integrability in Birkhoff's theorem. Countable or full Choice is stated only on the results that inherit it from their exact measure, compactness, or Radon–Nikodym suppliers.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Ergodic partial sums, time averages, and the invariant L2 subspace

Definition

Let (X,A,μ,T) be a measure-preserving system (Measure-preserving transformations and systems), and put T0=idX and Tk+1=TTk. For a finite-valued measurable real or complex representative f and an integer n1, its ergodic partial sum and ergodic time average are

Snf:=k=0n1fTk,Anf:=1nSnf.

These are initially pointwise formulas for a chosen representative. The companion proposition Ergodic averages are measurable, representative independent, and Lp contractive proves that, when f represents an element of Lp(μ), the formulas are independent of the representative and define Lp classes. Thus the notation does not hide a simultaneous choice of representatives.

Using the complex-L2 convention of Complex Lp classes and Euclidean test-function conventions, define the invariant L2 subspace

M:={[g]L2(μ;C):[gT]=[g]}={[g]:gT=g μ-a.e.}.

This is the fixed space of composition by T. Membership in M means invariance almost everywhere; it does not mean that g is constant. The strict and modulo-null invariant-set conventions are those of Strict and mod-null invariant sigma-algebras.

PropositionStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Ergodic averages are measurable, representative independent, and Lp contractive

Statement

Let T preserve μ. For every 1p, composition

UT[f]:=[fT]

is a well-defined linear isometry on real Lp(μ) and on complex Lp(μ;C). Consequently Sn and An define measurable Lp classes and

Anfpfp(n1).

No invertibility of T is assumed.

Facts & Assumptions

Given: A measure-preserving system, 1p, an Lp class [f], and an integer n1.

[F1]

A measure-preserving map is measurable, preserves inverse-image measures, and leaves nonnegative and integrable integrals invariant (Integral invariance under measure-preserving maps).

[F3]

Complex measurable functions, their a.e. quotient, and their modulus norms are fixed by Complex Lp classes and Euclidean test-function conventions; the complex quotient norm and Minkowski inequality are supplied by Complex Holder, Minkowski, and the quotient norm.

[F4]

The essential supremum is the infimum of the essential bounds (The essential supremum of a measurable function with respect to a measure).

Proof

technique · direct
1.1

Measurability of T makes fT measurable. If f=g off the measurable null set N, then fT=gT off T1N, and μ(T1N)=μ(N)=0. Thus UT is representative independent. Pointwise composition distributes over addition and scalar multiplication, so the descended map is linear over either scalar field.

F1
1.2

For 1p<, integral invariance applied to the nonnegative measurable function fp gives fTpp=fpTdμ=fpdμ=fpp. Taking the nonnegative pth root proves equality of the norms.

F1F2F3
1.3

For p= and every finite M0, the exceptional set for fTM is T1{f>M}. Its measure equals that of {f>M}. Hence M is an essential bound for fT exactly when it is one for f, and their infima are equal.

F1F4
2.1

Iterating step 1.1 shows that every UTk[f]=[fTk] is well defined and has norm fp. Finite linear combinations therefore make Snf and Anf well-defined measurable classes.

step 1.1step 1.2step 1.3
3.1

The real or complex Minkowski inequality and positive homogeneity now give Anfp1nk=0n1UTkfp=fp. This includes n=1 and p=, and no inverse of T was used.

F2F3step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Maximal ergodic theorem

Statement

Let (X,A,μ,T) be a measure-preserving system for an arbitrary measure μ, and let f:XR be a finite-valued measurable representative in L1(μ). With the unnormalised sums Snf, put

E:={x:supn1Snf(x)>0}.

Then

Efdμ0.

Neither finiteness of μ, invertibility of T, nor ergodicity is assumed.

Facts & Assumptions

Given: The system and real integrable representative in the Statement.

[F1]

Composition by T preserves measurability and the integral of every nonnegative measurable or integrable function (Integral invariance under measure-preserving maps).

[F2]

Integrable functions form a vector space and their integral is linear (The Lebesgue integral is linear on L1(μ)).

[F3]

Increasing nonnegative measurable functions satisfy monotone convergence (Monotone convergence for the integral).

Proof

technique · direct finite-maximum argument
1.1

For N1, set FN:=max(0,S1f,,SNf),EN:={FN>0}. Every Sjf is integrable, so FN is measurable and integrable because a finite maximum of real functions is obtained from addition and absolute value. Also FN0 and FN=0 on XEN.

F1F2
2.1

Since FNSjf for 0jN1, composition and addition give FNT+fSj+1f. Hence FNT+fmax1jNSjf=FNon EN, where strict positivity is what permits insertion of the zeroth sum S0f=0.

step 1.1
3.1

Integrating the preceding inequality over EN, using FN=0 off EN, nonnegativity of FNT, and invariance of its integral, yields ENfdμXFNdμENFNTdμXFNdμXFNTdμ=0. All displayed integrals are finite because FN is integrable.

F1F2step 1.1step 2.1
4.1

The sets EN increase and their union is E. Applying monotone convergence separately to f+1EN and f1EN gives ENfdμEfdμ. Passing to the limit in the nonnegative inequalities of step 3.1 proves the claim.

F2F3step 3.1
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Sigma-finite ergodic oscillation sets have finite measure

Statement

Let μ be sigma-finite, let T preserve μ, and let fL1(μ) be real valued. For rationals β<α, put

Eα,β:={x:lim infnAnf(x)<β<α<lim supnAnf(x)}.

Then Eα,β is invariant (in particular, invariant modulo null sets) and has finite measure.

Facts & Assumptions

Given: The sigma-finite system, f, and rationals β<α in the Statement.

[F1]

The maximal ergodic theorem applies to every real integrable representative on an arbitrary measure space (Maximal ergodic theorem).

[F2]

Sigma-finiteness supplies a countable finite-measure cover (Finite, sigma-finite, and semifinite measures).

[F3]

For integrable h, hh (The modulus of an integral is bounded by the integral of the modulus).

Proof

technique · cases on the sign of $\alpha$
1.1

The exact identity Anf(Tx)=n+1nAn+1f(x)1nf(x) shows, by taking lower and upper limits, that both limiting envelopes have the same value at Tx as at x; finite-valuedness of f(x) makes the last term tend to zero. Thus T1Eα,β=Eα,β.

givenalgebra
1.2

Assume first that α>0, and let CEα,β be measurable with μ(C)<. The function g=fα1C is integrable. For xEα,β, some n satisfies Snf(x)>nα, while Sn1C(x)n; hence Sng(x)>0. Therefore C lies in G:={supnSng>0}.

assume-case alphapositivegivenalgebra
2.1

By [F1], Gg0. Since CG, αμ(C)GfdμGfdμGfdμf1. Here the middle absolute-value inequality follows because the left side is nonnegative.

F1F3step 1.2
3.1

From a sigma-finite cover form the increasing finite-measure exhaustion Xm by finite unions, and take Cm=Eα,βXm. Step 2.1 gives μ(Cm)f1/α, while CmEα,β. Continuity from below, which follows from countable additivity of the measure, gives μ(Eα,β)f1/α<.

F2step 2.1
4.1

If α0, then β>0. The same set is the oscillation set for f with upper threshold β and lower threshold α, because lim sup(Anf)=lim infAnf and lim inf(Anf)=lim supAnf. Applying steps 1.2–3.1 to f proves its measure finite.

assume-case alphanonpositivestep 3.1cases-exhaustive
TheoremStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-14Open item page →

Birkhoff pointwise ergodic theorem

Statement

Let μ be sigma-finite, let T preserve μ, and let f be a finite-valued real- or complex-valued measurable representative in L1(μ). Then Anf converges μ-almost everywhere to a finite-valued integrable function f satisfying

fT=fμ-almost everywhere,f1f1.

The a.e. class of f depends only on the a.e. class of f. No ergodicity, finite total measure, completeness, or invertibility is assumed.

Facts & Assumptions

Given: The sigma-finite measure-preserving system and integrable representative in the Statement.

[F1]

Every rational oscillation set is invariant and has finite measure (Sigma-finite ergodic oscillation sets have finite measure).

[F2]

The maximal ergodic theorem holds on arbitrary measure spaces (Maximal ergodic theorem).

[F3]

Fatou's lemma bounds the integral of a lower limit of nonnegative measurable functions (Fatou's lemma).

[F4]

Composition by T preserves integrals, and countable unions of measurable null sets are null (Integral invariance under measure-preserving maps, Finite and countable subadditivity of measures).

Proof

technique · direct rational-oscillation argument
1.1

Suppose first that f is real. Write u=lim supnAnf and =lim infnAnf. The exact identity Anf(Tx)=n+1nAn+1f(x)1nf(x) shows that uT=u and T=, with extended values allowed. The divergence set {<u} is the union of the sets Eα,β over rational β<α.

givenalgebra
1.2

If f=g a.e., let N={fg}. Outside k0TkN, a null set by preservation and [F4], every summand in Snf equals the corresponding summand in Sng. Thus the limits agree a.e.; the construction descends to the L1 class.

F4
2.1

Fix such β<α and put E=Eα,β. By [F1], E is strictly invariant and μ(E)<. For g=(fα)1E, strict invariance gives Sng=1E(Snfnα). Every xE has Snf(x)>nα for some n, so E={supnSng>0}. Applying [F2] gives Efdμαμ(E).

F1F2step 1.1
3.1

Apply the same argument to f and the thresholds β>α. Its oscillation set is again E, so Efdμβμ(E). Because f is integrable and E has finite measure, both inequalities are finite. Thus (αβ)μ(E)0, and μ(E)=0.

F1F2step 2.1
4.1

There are only countably many rational pairs. Hence [F4] and steps 1.1–3.1 show that Anf has an extended-real limit off a null set. On that set, f=lim infnAnf, and contractivity gives Anff. Fatou therefore yields ff<, which both makes f finite a.e. and proves integrability.

F3F4step 1.1step 3.1
5.1

Define f=0 on the exceptional null set. The identity in step 1.1 shows that the convergence set and the limit are invariant wherever the averages converge; after adding the null exceptional orbit set if necessary, fT=f a.e.

F4step 1.1step 4.1
6.1

For complex f, apply the real result to Ref and Imf and combine their two conull convergence sets. Their limits give the complex limit, its invariance, and its representative independence. Fatou applied directly to Anf gives the stated complex L1 bound. Only these two determined components are used, so no choice principle enters.

F3F4step 4.1step 5.1step 1.2
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Finite-measure identification of the Birkhoff limit

Statement

Assume the Axiom of Choice. Let μ(X)<, let T preserve μ, let fL1(μ), and let f be its Birkhoff limit. For the strict invariant sigma-algebra

I={EA:T1E=E},

one has

Efdμ=Efdμ(EI).

Moreover, f has an I-measurable integrable representative, unique up to μ-a.e. equality, with these identities. For complex f the integrals and the representative are understood componentwise.

Facts & Assumptions

Given: AC, a finite measure space, T, f, f, and I as in the Statement.

[F1]

Birkhoff supplies an integrable a.e.-invariant limit (Birkhoff pointwise ergodic theorem), and the maximal theorem holds without invertibility (Maximal ergodic theorem).

[F2]

Every modulo-null invariant measurable set has a strictly invariant representative (Mod-null invariant sets have strict representatives).

[F3]

Indefinite integration of an integrable real or complex function is countably additive (The indefinite integral of an integrable function is countably additive on measurable sets).

[F4]

Under AC, Radon–Nikodym gives the unique integrable density of a finite signed measure absolutely continuous with respect to a finite positive measure (A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density, The Axiom of Choice).

[F5]

Nonnegative integration is monotone and positively homogeneous (Monotonicity and nonnegative homogeneity of the nonnegative integral).

Proof

technique · direct invariant-stratum argument followed by Radon–Nikodym
1.1

First let g be real and integrable, and choose its Birkhoff-limit representative g to be the pointwise limit on the convergence set and zero elsewhere. The shifted-average identity and its rearrangement show that the convergence set is strictly invariant and that g is strictly invariant.

F1algebra
1.2

Suppose first that f is real. On (X,I) define ν(E)=Efdμ. This is a finite signed measure by [F3], is absolutely continuous with respect to μI, and has finite total variation. By [F4] there is an integrable I-measurable h such that Eh=Ef for every EI. This is the unique step spending AC.

F3F4
2.1

Fix a positive integer m and, for kZ, put Dm,k={k/mg<(k+1)/m}. These form a measurable, strict-invariant partition of X. For ε>0, every point of Dm,k belongs to the positive-maximal set of (g(k/mε))1Dm,k. The maximal theorem and strict invariance therefore give Dm,kgdμ(k/mε)μ(Dm,k). Since μ(Dm,k)<, letting ε0 gives the same inequality with k/m.

F1F5step 1.1
3.1

On Dm,k one has g<(k+1)/m, so step 2.1 gives Dm,kgdμDm,kgdμ+1mμ(Dm,k). Countable additivity over the partition is legitimate because g and g are integrable. Summing yields XgdμXgdμ+μ(X)m. Letting m and then applying the same inequality to g, whose limit is g, proves g=g.

F1F3F5step 2.1
4.1

Let EI and take g=f1E. Strict invariance gives Ang=(Anf)1E pointwise, so the Birkhoff limit of g is f1E a.e. In the real case, step 3.1 therefore gives Efdμ=Efdμ.

F1step 3.1
5.1

Since h is I-measurable, every rational sublevel set of h is strictly invariant; rational separation therefore gives hT=h pointwise. Thus, because f is invariant almost everywhere, Br={fh>r} is invariant modulo null sets for every rational r>0. Let ErI be its strict representative from [F2]. Steps 4.1 and 1.2 give Er(fh)=0, while fh>r a.e. on Er. Monotonicity implies 0rμ(Er), so Er is null. Applying the same argument to hf and taking the countable union over positive rational r proves f=h a.e.

F2F5step 4.1step 1.2
6.1

For complex f, apply steps 1.2–5.1 to its real and imaginary parts and set h=h1+ih2. This h is integrable and I-measurable, equals f a.e., and has all asserted event-integral identities. Uniqueness follows componentwise from Radon–Nikodym uniqueness. If μ(X)=0, the same proof gives the zero density and all assertions are vacuous off a null set.

F4step 4.1step 5.1
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Ergodic averages converge in Lp on finite-measure spaces

Statement

Let μ(X)<, let T preserve μ, let 1p<, and let fLp(μ) be real or complex valued. If f is its Birkhoff limit, then fLp(μ) and

Anffp0.

No L convergence is asserted.

Facts & Assumptions

Given: The finite measure space, T, p, f, and f in the Statement.

[F1]
[F2]

On finite measure spaces, a.e. convergence implies convergence in measure, and convergence in measure plus uniform integrability gives L1 convergence (On a finite measure space, almost-everywhere convergence implies convergence in measure, Vitali convergence theorem on finite and sigma-finite measure spaces).

[F3]

Markov's inequality, dominated convergence, and Fatou's lemma have their usual integral forms (Chebyshev-Markov inequality for the integral, Dominated convergence, Fatou's lemma).

[F4]

A bounded function on a finite measure space belongs to every finite Lp (Finite-measure Lr includes into Lp for p<r).

Proof

technique · cases $p=1$ and $1<p<\infty$
1.1

Assume p=1. Put En,M={Anf>M}. Contractivity and Markov give μ(En,M)f1/M. For K>0, split f=fK+rK by radial clipping, so fKK and rK=(fK)+. Pointwise, AnfAnfK+AnrK. Consequently En,MAnfdμKf1M+rK1, where invariance gives AnrK=rK1.

assume-case poneF1F3
1.2

Now assume 1<p<. Let fm=f1{fm}. Then fm is bounded and belongs to Lp by [F4], while dominated convergence applied to ffmp gives ffmp0.

assume-case pgreatF3F4
2.1

As K, rK0 and is dominated by f, so its integral tends to zero. Choose K and then M in step 1.1; the bound is uniform in n and proves uniform integrability of (Anf). For complex f, it also proves uniform integrability of the real and imaginary parts because each component modulus is bounded by Anf.

F3step 1.1
2.2

Let fm be the Birkhoff limit of fm. For fixed m, both Anfm and fm are bounded by m. Their pointwise difference tends to zero a.e.; dominated convergence on the finite measure space therefore gives Anfmfmp0.

F1F3F4step 1.2
3.1

By [F1] the averages converge a.e., hence by [F2] in measure. Vitali applied to the real and imaginary parts gives L1 convergence to their corresponding components of f. The complex triangle inequality combines the two component conclusions.

F1F2step 2.1cases: p-one
4.1

Since An(ffm)ffm a.e., Fatou and contractivity imply ffmplim infnAn(ffm)pffmp. Thus fLp, and lim supnAnffp2ffmp. Letting m proves the claim. The two cases exhaust 1p<; the proof never supplies uniform-norm convergence.

F1F3step 1.2step 2.2cases-exhaustive
CorollaryStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Birkhoff ergodic theorem for ergodic finite-measure systems

Statement

Assume the Axiom of Choice. Let T preserve an ergodic measure μ with 0<μ(X)<. For every real- or complex-valued fL1(μ),

Anf1μ(X)Xfdμ

both μ-almost everywhere and in L1(μ).

Facts & Assumptions

Given: AC, the ergodic finite positive measure system, and f in the Statement.

[F1]

Birkhoff supplies an invariant a.e. limit (Birkhoff pointwise ergodic theorem).

[F2]

Under AC, the finite-measure identification gives Xf=Xf (Finite-measure identification of the Birkhoff limit, The Axiom of Choice).

[F3]

In an ergodic probability system every finite-valued a.e.-invariant real or complex measurable function is constant a.e. (Equivalent invariant-set and invariant-function criteria for ergodicity).

[F4]

On a finite measure space the averages converge in L1 to their Birkhoff limit (Ergodic averages converge in Lp on finite-measure spaces).

Proof

technique · direct
1.1

Normalize the measure to μ^=μ/μ(X). This does not change measurable sets, null sets, invariance, or ergodicity, and T preserves μ^. By [F1], Anff a.e. and fT=f a.e.

F1
2.1

Applying [F3] to the normalized probability system makes f=c a.e. for some scalar c. The event identity of [F2] at E=X gives cμ(X)=Xfdμ=Xfdμ, so c=μ(X)1Xfdμ. This is where the AC-dependent Radon–Nikodym identification is used.

F2F3step 1.1
3.1

The case p=1 of [F4] gives Anff10. Combining with step 2.1 proves both modes of convergence. For complex f, [F3] and the integral identity apply to its two components, producing the same complex constant formula.

F4step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Von Neumann mean ergodic theorem in L2

Statement

Assume the Axiom of Choice. For a measure-preserving system and fL2(μ;C),

AnfPMfin L2,

where M={g:gT=g μ-a.e.} and PM is the orthogonal projection onto M. Neither finite measure, ergodicity, nor invertibility of T is required.

Facts & Assumptions

Given: AC, a measure-preserving system, and complex fL2.

[F1]

Composition UTg=gT is a well-defined linear isometry on complex L2 (Ergodic averages are measurable, representative independent, and Lp contractive).

[F2]

Under AC, Cesaro averages of any linear isometry on a closed complex L2 subspace converge in norm to the orthogonal projection onto its fixed space, even when the isometry is not surjective (Hilbert cesaro averages converge to the fixed subspace, The Axiom of Choice).

[F3]

The fixed space of UT is exactly M by Ergodic partial sums, time averages, and the invariant L2 subspace.

Proof

technique · direct application of the Hilbert-space Cesaro lemma
1.1

By [F1], UT is a linear isometry of complex L2. Its fixed vectors are precisely the classes g with gT=g a.e., namely M by [F3].

F1F3
2.1

The operator averages in [F2] satisfy 1nk=0n1UTkf=1nk=0n1fTk=Anf. Applying [F2] therefore gives AnfPMf in L2. AC is spent exactly in the published projection/Cesaro supplier. That supplier treats a nonsurjective isometry through its closed range, so no inverse of T or of UT on all of L2 has been assumed.

F2step 1.1
3.1

This argument used neither the pointwise Birkhoff theorem nor any finite-measure or ergodicity hypothesis. In particular its norm conclusion alone makes no assertion about pointwise convergence of the full sequence.

step 2.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Unique ergodicity

Definition

Let K be a nonempty compact metric space and let T:KK be continuous. The topological dynamical system (K,T) is uniquely ergodic if there exists exactly one Borel probability measure μ such that

μ(T1E)=μ(E)

for every Borel set EK. Thus existence is part of the property. This is distinct from measure-theoretic ergodicity relative to a probability measure already chosen: unique ergodicity quantifies over all invariant Borel probabilities.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Continuous functions determine Borel probabilities on compact metric spaces

Statement

Let K be a nonempty compact metric space. If Borel probability measures μ and ν satisfy

Kfdμ=Kfdνfor every fC(K,R),

then μ=ν.

Facts & Assumptions

Given: The compact metric space and Borel probabilities in the Statement.

[F1]

Dominated convergence applies to bounded pointwise-convergent measurable functions (Dominated convergence).

[F2]

Two finite measures of equal total mass which agree on a generating pi-system agree on its generated sigma-algebra (Finite measures agreeing on a generating pi-system and on the whole space are equal).

Proof

technique · direct approximation of closed-set indicators
1.1

Let FK be closed and nonempty. By [F3], its distance function is continuous, vanishes on F, and is strictly positive off F. For m1, set ϕm(x)=max{0,1md(x,F)}. Then 0ϕm1, every ϕm is continuous, and ϕm1F pointwise.

F3algebra
2.1

The assumed continuous-test identity applies to each ϕm. Dominated convergence for each probability measure gives μ(F)=limmϕmdμ=limmϕmdν=ν(F). For F= the same equality is immediate.

F1step 1.1
3.1

Closed subsets of K form a pi-system containing K, and their complements are the open sets, so they generate the Borel sigma-algebra. The two probabilities have equal total mass one and agree on every closed set by step 2.1. Applying [F2] proves μ=ν.

F2step 2.1
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Unique ergodicity is equivalent to uniform ergodic averages

Statement

Assume the Axiom of Countable Choice. Let T be a continuous self-map of a nonempty compact metric space K. The following are equivalent.

  1. T is uniquely ergodic, with invariant Borel probability μ.
  2. For every fC(K,R), the functions Anf converge uniformly on K to a constant.

When these conditions hold, the constant is Kfdμ.

Facts & Assumptions

Given: Countable choice, K, and T as in the Statement.

[F1]

Under countable choice, every sequence of Borel probabilities on K has a subsequence whose integrals converge on every real continuous function to those of a Borel probability (Probability sequences on compact metric spaces have integral-convergent subsequences, The Axiom of Countable Choice (ACω)).

[F2]

Continuous functions determine Borel probabilities on K (Continuous functions determine Borel probabilities on compact metric spaces).

[F3]

Integrals are invariant under a measure-preserving map (Integral invariance under measure-preserving maps).

[F5]

The integral triangle inequality and monotonicity bound the integral of a bounded error by its uniform norm times the total mass (The modulus of an integral is bounded by the integral of the modulus, Monotonicity and nonnegative homogeneity of the nonnegative integral).

Proof

technique · prove both implications using empirical probabilities
1.1

Assume unique ergodicity with invariant probability μ. If uniform convergence to fdμ failed for some continuous f, countable choice would give ε>0, strictly increasing nj, and xjK such that Anjf(xj)fdμε. Define the empirical Borel probabilities ηj=nj1k<njδTkxj; finite additivity and countable additivity of each point mass make this a probability.

assume-hypF1
2.1

By [F1], pass to a subsequence, not relabelled, and a Borel probability η such that gdηjgdη for every gC(K,R). For such g, gTdηjgdηj=g(Tnjxj)g(xj)nj0, because g is bounded by [F4]. Taking limits shows that η and its pullback probability Eη(T1E) have identical continuous test integrals; [F2] makes them equal. Hence η is invariant.

F1F2F4step 1.1
3.1

Unique ergodicity gives η=μ, but fdηj=Anjf(xj) and the closed inequality in step 1.1 passes to the limit, contradicting fdη=fdμ. Thus Anffdμ uniformly for every f.

step 1.1step 2.1contradiction
3.2

Conversely, assume all continuous averages converge uniformly to constants c(f). Fix x0K and form ηn=n1k<nδTkx0. By [F1], a subsequence has a continuous-test limit probability η. The telescoping calculation of step 2.1 makes η invariant, and uniform convergence gives fdη=limrAnrf(x0)=c(f).

assume-hypF1F2step 2.1
4.1

If ρ is any invariant Borel probability, then [F3] gives Anfdρ=fdρ. Moreover [F5] gives Anfdρc(f)Anfc(f)0. Hence fdρ=c(f)=fdη for every continuous real f. By [F2], ρ=η. Thus an invariant probability exists and is unique, and its integral is the asserted constant.

F2F3F5step 3.2
5.1

Steps 1.1–3.1 prove the forward implication and steps 3.2–4.1 prove the converse. Countable choice is used precisely through [F1] and to select the failure witnesses in step 1.1; no stronger choice principle is invoked.

step 3.1step 4.1
LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

The unit-interval circle is a nonempty compact metric space

Statement

The circle T=[0,1) with

d(x,y)=min(xy,1xy)

is a nonempty compact metric space.

Facts & Assumptions

Proof

technique · direct continuous-image argument
1.1

Define q:[0,1]T by q(t)=t for t<1 and q(1)=0. Equivalently q(t)={t}. For s,t[0,1], the circle-distance formula gives d(q(s),q(t))st, including when one endpoint is 1. Thus q is continuous. It is surjective because every x[0,1) equals q(x).

givenalgebra
2.1

By [F1], [0,1] is compact. Its continuous image under q is all of T, so [F2] makes the circle compact; [F3] reads this in the metric sense. Finally 0T, so it is nonempty.

F1F2F3step 1.1
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Irrational circle rotations are uniquely ergodic

Statement

Assume the Axiom of Countable Choice. If α is irrational, then the circle rotation Rα is uniquely ergodic, and its unique invariant Borel probability is Lebesgue measure λ.

Facts & Assumptions

Given: Countable choice and an irrational real α.

[F2]

Rα is an isometry preserving Lebesgue probability, and irrationality makes it ergodic (Circle rotations preserve Lebesgue measure, Circle rotation is ergodic for Lebesgue measure exactly at irrational angles).

[F3]

Birkhoff supplies an invariant a.e. limit; on an ergodic probability system it is constant a.e. (Birkhoff pointwise ergodic theorem, Equivalent invariant-set and invariant-function criteria for ergodicity).

[F4]

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

[F5]

Unique ergodicity is equivalent, under countable choice, to uniform convergence of every continuous real ergodic average to a constant (Unique ergodicity is equivalent to uniform ergodic averages).

Proof

technique · direct Birkhoff–equicontinuity argument
1.1

Fix fC(T,R). Compactness makes f bounded, hence fL1(λ). By [F2]–[F3], Anf converges on a conull set Yf to a constant cf. Since Anff, dominated convergence and invariance give cf=cfdλ=limnAnfdλ=fdλ.

F2F3F4
1.2

Given ε>0, uniform continuity of f gives δ>0 such that d(x,y)<δ implies f(x)f(y)<ε/3. Rotations are isometries, so the same δ gives Anf(x)Anf(y)<ε/3 for every n whenever d(x,y)<δ.

F1F2
2.1

The set Yf is dense. Indeed, every nonempty circle-open set contains a nondegenerate ordinary interval, possibly on one side of the cut, and such an interval has positive Lebesgue measure by the interval-measure formula. A conull set must meet it.

F2F6step 1.1
3.1

Compactness supplies a finite δ/3-net x1,,xm. By density choose, using only finite choice, yiYf with d(xi,yi)<δ/3. For all sufficiently large n, every Anf(yi)cf<ε/3. Given x, choose i with d(x,xi)<δ/3; then d(x,yi)<2δ/3, and step 1.2 gives Anf(x)cf<2ε/3. Thus Anfcf uniformly.

F1step 2.1step 1.2
4.1

The argument applies to every real continuous f, with cf=fdλ. By [F5], Rα is uniquely ergodic and its unique invariant probability is the already invariant λ. Countable choice is inherited from [F2] and [F5]; the finite net and finite choices in step 3.1 require no stronger principle. No Fourier series or Weyl criterion was used.

F2F5step 1.1step 3.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Equidistribution modulo one

Definition

A real sequence (xn)n0 is equidistributed modulo one if, for every 0ac1, the frequencies indexed by integers n1 satisfy

1n#{0k<n:{xk}[a,c)}ca.

Here {x}=xx[0,1), and the half-open convention makes the representative and both endpoints unambiguous. It includes the empty interval a=c and the whole interval [0,1).

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Weyl equidistribution for irrational rotations

Statement

Assume the Axiom of Countable Choice. If α is irrational, then the sequence (nα)n0 is equidistributed modulo one.

Facts & Assumptions

Given: Countable choice, an irrational α, and a half-open interval I=[a,c)[0,1).

[F1]

Irrational rotation by α is uniquely ergodic with Lebesgue probability (Irrational circle rotations are uniquely ergodic).

[F2]

Unique ergodicity gives uniform convergence of continuous-function averages to their Lebesgue integrals (Unique ergodicity is equivalent to uniform ergodic averages).

[F3]
[F4]

Equidistribution modulo one is defined by the limiting frequencies of all half-open intervals (Equidistribution modulo one).

[F5]

Nonnegative integration is monotone, and the integral is linear on integrable functions (Monotonicity and nonnegative homogeneity of the nonnegative integral, The Lebesgue integral is linear on L1(μ)).

Proof

technique · direct continuous upper and lower sandwiches
1.1

If a=c, use the zero function; if (a,c)=(0,1), use the constant-one function. Otherwise, for every sufficiently small δ>0, circular distance gives continuous functions 0δ1Iuδ1 as follows: δ is zero on the closed complementary arc and rises linearly to one within distance δ inside I, while uδ is one on the closed arc [a,c] and falls linearly to zero within distance δ outside it. Thus they differ from 1I only in the two boundary arcs of total length at most 4δ.

F3construct
2.1

Monotonicity, linearity, and [F3] give ca2δδdλcauδdλca+2δ, after decreasing δ if necessary; estimates truncated at 0 and 1 give the same conclusion near a degenerate complementary arc.

F3F5step 1.1
3.1

Since Rαk(0)={kα}, the visit frequency to I is An1I(0). The pointwise sandwiches and [F2] yield δdλlim infnAn1I(0)lim supnAn1I(0)uδdλ. Letting δ0 and using step 2.1 proves that the limit is ca.

F1F2step 2.1
4.1

The interval I was arbitrary, so the definition of equidistribution applies. Countable choice is inherited from [F1]; the two approximants for a fixed interval and δ are explicit. This proof does not use Fourier's Weyl criterion.

F4step 3.1
DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Canonical base-b expansions and normal numbers

Definition

Fix an integer b2. For x[0,1), its canonical base-b digits are

dj(b)(x)=bDbj1x{0,,b1},j1,

where Db(x)={bx} is the integer-base circle map from Integer-base maps and b-adic circle intervals and the floor is supplied by Integer part: for every real x there is exactly one integer m with mx<m+1. Thus

Dbjx=bDbj1xdj(b)(x).

Iterating this recurrence gives

x=j=1ndj(b)(x)bj+bnDbnx.

Since 0Dbnx<1, the remainder tends to zero. Hence the digit string represents x:

x=0.d1(b)(x)d2(b)(x)b=j=1dj(b)(x)bj.

At a b-adic rational the recurrence chooses the expansion that eventually has only zero digits, called the terminating expansion. Equivalently, the canonical expansion is the expansion that is not eventually equal to b1. Indeed, an eventually-(b1) tail represents the same number as incrementing the last preceding digit and then appending zeros; conversely, if the greedy digits were all b1 after some place, the displayed remainder identity would force the corresponding iterate DbNx to be 1, contrary to DbNx[0,1).

For a word w=(w1,,w){0,,b1} and n1, write

Nn(w,x)=#{0k<n:(dk+1(b)(x),,dk+(b)(x))=w}.

The number x is normal in base b if, for every length 1 and every such word w,

Nn(w,x)nb.

It is normal if it is normal in every integer base b2.

LemmaStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-14Open item page →

Base-b digit cylinders are orbit cylinders

Statement

Assume the Axiom of Countable Choice. Fix b2 and a word w=(w1,,w), and put

m=r=1wrbr.

Away from

Eb={k/bq:q0, 0k<bq}[0,1),

for every x[0,1)Eb and j1, the word w begins at digit j of x if and only if

Dbj1x[m/b,(m+1)/b).

The canonical convention selects a single expansion at every point of Eb, and Eb is countable and Lebesgue null.

Facts & Assumptions

Given: Countable choice, an integer b2, a length 1, the word w, and j1.

[F1]

The canonical digits satisfy Dbrx=bDbr1xdr(b)(x) and use the terminating expansion at b-adic points (Canonical base-b expansions and normal numbers).

[F2]

The level- intervals [h/b,(h+1)/b) partition [0,1), and Db is affine on each such interval (Integer-base maps and b-adic circle intervals).

[F3]

A countable union of countable sets is countable under countable choice (Countable unions of at most countable sets, assuming ACω), and a countable subset of R is Lebesgue null (Every at most countable subset of Rn is Lebesgue null; in particular λ1(Q)=0).

Proof

technique · direct digit calculation
1.1

Put y=Dbj1x. Iterating the recurrence in [F1] for places gives y=r=1dj+r1(b)(x)br+bDbj+1x.

F1
2.1

Since the last iterate lies in [0,1), the first sum equals h/b, where h=r=1dj+r1(b)(x)br, and h/by<(h+1)/b.

step 1.1algebra
3.1

By the disjoint half-open partition in [F2], y belongs to the interval [m/b,(m+1)/b) exactly when h=m. Uniqueness of positional representation for the integers 0h,m<b says this is equivalent to (dj(b)(x),,dj+1(b)(x))=w. This in fact holds also at the endpoints under the canonical half-open convention, and therefore implies the claimed equivalence away from Eb.

F1F2step 2.1
4.1

For each q, the set {k/bq:0k<bq} is finite. Hence Eb is a countable union of finite sets, so [F3] makes it countable and Lebesgue null. At each of its points [F1] chooses the terminating string and excludes the eventually-(b1) string. Countable choice is used precisely through the two published countability/nullity suppliers in [F3], not in the digit calculation.

F1F3step 3.1
TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Borel's normal number theorem

Statement

Assume the Axiom of Countable Choice. Lebesgue-almost every x[0,1) is normal in every integer base b2.

Facts & Assumptions

Given: Countable choice and Lebesgue probability on [0,1).

[F1]

For every b2, Db is strongly mixing, hence ergodic, and preserves Lebesgue probability (Every integer-base circle map is strongly mixing, Mixing implies weak mixing, which implies ergodicity).

[F2]

Birkhoff gives an integrable, invariant almost-everywhere limit for the averages of each L1 observable (Birkhoff pointwise ergodic theorem), and in an ergodic probability system every finite invariant measurable function is constant almost everywhere (Equivalent invariant-set and invariant-function criteria for ergodicity).

[F3]

Integrals are unchanged by a measure-preserving map (Integral invariance under measure-preserving maps), and dominated convergence passes the integral through an almost-everywhere bounded limit (Dominated convergence).

[F5]

Word occurrences agree with visits to their half-open orbit cylinder away from a countable null endpoint set (Base-b digit cylinders are orbit cylinders).

[F6]

A countable union of null measurable sets is null (Finite and countable subadditivity of measures).

Proof

technique · Birkhoff on every digit cylinder, followed by a countable intersection
1.1

Fix b2, 1, and w{0,,b1}. Put m=r=1wrbr, Iw=[m/b,(m+1)/b), and fw=1Iw. Then 0fw1 and fwdλ=b.

F4construct
2.1

By [F1] and [F2], Anfw converges almost everywhere to an invariant function Fw, and Fw=cw almost everywhere for some constant cw. Because 0Anfw1, [F3] and invariance of the integral give cw=Fwdλ=limnAnfwdλ=fwdλ=b.

F1F2F3step 1.1
3.1

For xEb, [F5] identifies Anfw(x) with Nn(w,x)/n. Thus outside the union of Eb and the exceptional set from step 2.1, the word w has limiting frequency b.

F5step 2.1
4.1

The triples (b,,w) form a countable family: b and range over integers and, for each pair, there are only b words. By [F6], the union of their null exceptional sets and the countable endpoint sets Eb is null. Every point outside that union satisfies step 3.1 for every base and word, hence is normal. Countable choice is inherited from [F1], [F4], and [F5]; the indexing and cylinders are explicit.

F5F6step 3.1
TheoremStatement: Literature-sourcedProof: AI-adaptedaudited 2026-09-14Open item page →

Fair-coin frequency strong law

Statement

Assume the Axiom of Countable Choice. On one-sided binary sequence space with fair-coin probability,

1nk=0n1xk12

almost surely.

Facts & Assumptions

Given: Countable choice, binary sequence space Ω={0,1}N, its fair-coin probability p, and the left shift σ.

[F1]

The fair-coin measure gives every one-coordinate cylinder mass 1/2 (Fair-coin measure on binary sequences).

[F3]

Birkhoff supplies an invariant almost-everywhere limit (Birkhoff pointwise ergodic theorem), and ergodicity makes every finite invariant measurable function constant almost everywhere (Equivalent invariant-set and invariant-function criteria for ergodicity).

[F4]

Dominated convergence and invariance of integrals identify bounded ergodic limits (Dominated convergence, Integral invariance under measure-preserving maps).

Proof

technique · apply Birkhoff to the first coordinate
1.1

Define f(x)=x0. Then f is the indicator of the one-coordinate cylinder {x:x0=1}, so 0f1 and fdp=1/2.

F1construct
1.2

Since f(σkx)=xk, Anf(x)=1nk=0n1xk.

givenalgebra
2.1

By [F2] and [F3], Anf converges almost everywhere to a constant c. The bound 0Anf1, dominated convergence, and integral invariance give c=cdp=limnAnfdp=fdp=12.

F2F3F4step 1.1
3.1

Combining steps 1.2 and 2.1 proves the asserted almost-sure frequency limit. Countable choice is inherited from the fair-coin measure and shift suppliers [F1]–[F2]; no further simultaneous selections occur here.

F1F2step 1.2step 2.1
False statementConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Birkhoff averages need not converge at every point

Statement

Assume the Axiom of Countable Choice. False claim: for every L1 observable in a measure-preserving system, Anf converges at every point.

Facts & Assumptions

Given: Countable choice, the doubling map D2 on Lebesgue probability [0,1), and f=1[0,1/2).

[F1]

Under canonical binary coding, f(D2kx) equals 1 exactly when digit k+1 is zero (Base-b digit cylinders are orbit cylinders).

[F2]

Birkhoff asserts convergence almost everywhere, not at every point (Birkhoff pointwise ergodic theorem).

[F3]

Under countable choice, D2 preserves Lebesgue probability (Integer-base circle maps preserve Lebesgue measure, The Axiom of Countable Choice (ACω)).

Refutation

technique · constructive
1.1

Let x have the binary digit string consisting successively of a zero block of length 1, a one block of length 2, a zero block of length 4, a one block of length 8, and so on, the block of index r0 having length 2r. This infinite string is neither terminating nor eventually one, so it is the canonical expansion of a point xE2.

construct
2.1

At the end of block r the number of read digits is Nr=1+2++2r=2r+11. At the end of zero block r=2m, the number of zero digits is Z2m=1+4++4m=(4m+11)/3, so Z2m/N2m2/3.

step 1.1algebra
3.1

At the end of the following one block, the zero count is unchanged, while N2m+1=22m+21; hence Z2m/N2m+11/3.

step 2.1algebra
4.1

By [F1], these two zero-frequency subsequences are precisely subsequences of Anf(x). Their distinct limits show that Anf(x) diverges. By [F3] this is a measure-preserving probability system, and the bounded indicator f is integrable, so the example refutes pointwise-everywhere convergence while remaining consistent with the almost-everywhere assertion in [F2].

F1F2F3step 2.1step 3.1discharge-construct
False statementConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

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
False statementConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

A Birkhoff limit need not be constant

Statement

Assume the Axiom of Countable Choice. False claim: the almost-everywhere Birkhoff limit is constant without an ergodicity hypothesis.

Facts & Assumptions

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

[F1]

The rotation R1/2 preserves Lebesgue probability (Circle rotations preserve Lebesgue measure).

[F2]
[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

The half-rotation interchanges [0,1/4) and [1/2,3/4), so the union is invariant and fT=f.

givenconstructalgebra
2.1

Every summand in Anf is therefore f, so Anf=f everywhere for every n1.

F2step 1.1
3.1

By [F3], the function f is 1 on a set of measure 1/2 and 0 on its complement, hence is not almost everywhere constant. Its Birkhoff limit in step 2.1 is consequently nonconstant, refuting the claim. Countable choice is used only through [F1] and [F3].

F1F3F4step 2.1discharge-construct
False statementConstruction: Literature-sourcedVerification: AI-adaptedaudited 2026-09-14Open item page →

Norm convergence alone does not imply pointwise convergence

Statement

Assume the Axiom of Choice. False claim: the L2-norm convergence conclusion of von Neumann's theorem, by itself, yields pointwise convergence of the same sequence.

Facts & Assumptions

Given: Full choice, Lebesgue probability on [0,1), and the half-open dyadic intervals Iq,k=[k2q,(k+1)2q) for q0 and 0k<2q.

[F1]

Von Neumann gives L2 convergence of ergodic averages (Von Neumann mean ergodic theorem in L2).

[F2]

Birkhoff's pointwise conclusion is proved using the maximal ergodic theorem, not norm convergence alone (Birkhoff pointwise ergodic theorem, Maximal ergodic theorem).

Refutation

technique · constructive norm-convergent sequence
1.1

Enumerate the functions 1Iq,k level by level, listing all 2q intervals at level q before proceeding to level q+1; call the resulting sequence (gn).

construct
2.1

If gn belongs to level q, then [F3] gives gn2=λ(Iq,k)1/2=2q/2. The level tends to infinity with n, so gn0 in L2.

F3step 1.1algebra
2.2

Every x[0,1) lies in exactly one half-open interval at each level. Thus gn(x)=1 once per level and equals 0 at all the other entries of every level q1. Both values occur infinitely often, so (gn(x)) fails to converge for every x.

step 1.1algebra
3.1

Steps 2.1–2.2 show that L2 convergence alone cannot imply full-sequence pointwise convergence. This does not contradict Birkhoff and is not offered as a counterexample among actual ergodic-average sequences: [F2] supplies their pointwise convergence by additional maximal-inequality structure.

F1F2step 2.1step 2.2discharge-construct
False statementConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Weyl equidistribution fails for some rotation angles

Statement

Assume the Axiom of Countable Choice. False claim: (nα)n0 is equidistributed modulo one for every real α.

Facts & Assumptions

Given: Countable choice and the angle α=0.

[F1]

Equidistribution requires the limiting frequency in [a,c) to be ca (Equidistribution modulo one).

[F2]

The valid Weyl theorem assumes that the angle is irrational (Weyl equidistribution for irrational rotations).

[F3]

Countable choice is the standing assumption of [F2] (The Axiom of Countable Choice (ACω)).

Refutation

technique · constructive
1.1

For every n0, {nα}=0.

givenconstructalgebra
2.1

Therefore the proportion of the first N terms in [0,1/2) is 1 for every N1, whereas the interval length is 1/2.

step 1.1algebra
3.1

This violates [F1] and refutes the claim. The counterexample is rational, so it does not meet—and does not challenge—the irrationality hypothesis in [F2]. The arithmetic refutation itself makes no choice; countable choice is present only to compare it with [F2].

F1F2F3step 2.1discharge-construct
False statementConstruction: Literature-sourcedVerification: AI-generatedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Not every real number is normal

Statement

False claim: every real number is normal in every base.

Facts & Assumptions

Given: The binary number x=0.1010102.

[F1]

Base-two normality requires every word of length 2, including 00, to have limiting frequency 22=1/4 (Canonical base-b expansions and normal numbers).

Refutation

technique · constructive periodic witness
1.1

The displayed digit string is not eventually one and is therefore the canonical binary expansion under [F1]'s convention.

F1givenconstruct
2.1

Its adjacent pairs alternate between 10 and 01. The word 00 never occurs, so its frequency is 0.

step 1.1algebra
3.1

Since 01/4, [F1] shows that x is not normal in base two and hence is not normal in every base. This single real number refutes the universal claim.

F1step 2.1discharge-construct
False statementConstruction: Literature-sourcedVerification: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-14Open item page →

Birkhoff's theorem requires integrability

Statement

Assume the Axiom of Countable Choice. False claim: Birkhoff's finite almost-everywhere convergence conclusion holds for every finite-valued measurable observable, without integrability.

Facts & Assumptions

Given: Countable choice, Lebesgue probability on [0,1), its doubling map D2, and

f(0)=0,f(x)=1/x(0<x<1).

[F1]

It suffices to test strict superlevel sets for extended-real measurability (Extended-real-valued measurable functions), and Borel sets are Lebesgue measurable under countable choice (Assuming countable choice, every Borel subset of Rn is Lebesgue measurable).

[F3]

The harmonic series diverges (For rational p>0, 1/kp converges iff p>1), and monotone convergence applies to increasing nonnegative measurable functions (Monotone convergence for the integral).

[F4]

The doubling map is ergodic (Doubling is ergodic for Lebesgue measure); Birkhoff gives invariant finite limits for integrable truncations (Birkhoff pointwise ergodic theorem), and ergodicity makes those limits constant (Equivalent invariant-set and invariant-function criteria for ergodicity).

[F5]

Dominated convergence and invariance of integrals identify the constant limits (Dominated convergence, Integral invariance under measure-preserving maps).

[F6]

A countable union of null sets is null (Finite and countable subadditivity of measures).

Refutation

technique · constructive truncation argument
1.1

For a<0, {f>a}=[0,1); for a=0, it is (0,1); and for a>0 it is (0,min{1,1/a}), with the right endpoint omitted if it equals 1. These are Borel. Hence [F1] makes the everywhere-finite function f Lebesgue measurable.

F1constructalgebra
1.2

On Ik=[1/(k+1),1/k) one has fk. For every N, the simple function sN=k=1Nk1Ik therefore satisfies sNf, and sNdλ=k=1Nk(1k1k+1)=k=1N1k+1.

F2algebra
2.1

By [F2]–[F3], the right side is unbounded, so fdλ=+. Thus f is not integrable under the integrability convention of Integrable real and complex functions, and their integrals.

F2F3step 1.2
3.1

For each integer m1, let fm=min{f,m}. It is measurable, bounded, and hence integrable on this probability space; moreover fmf. Monotone convergence and step 2.1 give cm:=fmdλ+.

F3step 1.1step 2.1
4.1

By [F4], Anfm converges almost everywhere to an invariant function and that function equals a constant almost everywhere. Since 0Anfmm, [F5] identifies this constant as limnAnfmdλ=fmdλ=cm.

F4F5step 3.1
5.1

Remove the countable union of the null exceptional sets in step 4.1; it is null by [F6]. At every remaining x, for every m and n, Anf(x)Anfm(x), whence lim infnAnf(x)cm. Because cm+, this says Anf(x)+.

F6step 3.1step 4.1
6.1

Thus a finite-valued measurable observable can have divergent-to-infinity ergodic averages almost everywhere. This refutes the finite-limit claim and shows exactly why the L1 hypothesis cannot be omitted. Countable choice is inherited from the Lebesgue and doubling-map suppliers; all truncations are explicit.

step 2.1step 5.1discharge-construct

5 · Examples, counterexamples and false statements

None yet.

Sources