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.

Measure-Preserving Systems and Mixing Criteria

1 · Prerequisites

2 · Summary

Measure preservation is defined by inverse images and then characterized by invariant integrals. Pullback gives an isometry on real and complex Lp spaces. Strict and modulo-null invariance lead to equivalent probability-space criteria for ergodicity. Strong mixing implies weak mixing, which implies ergodicity; generating-family approximation and complex L2 correlations give two ways to check mixing. Completeness of the measure space is unnecessary. The completion clause alone states its countable-choice assumption.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Measure-preserving transformations and systems

Definition

Let (X,A,μ) be a measure space. A measurable self-map T:XX is measure preserving if μ(T1E)=μ(E) for every EA. The quadruple (X,A,μ,T) is a measure-preserving system; it is a probability system if μ(X)=1. Here T1E={x:T(x)E} denotes an inverse image, whether or not T is invertible. Neither completeness nor finiteness is implicit. The measure-space and measurable-map conventions are Measure spaces and A measurable function between measurable spaces.

DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Invertible measure-preserving systems

Definition

A system in Measure-preserving transformations and systems is invertible if T is a bijection and T1:XX is measurable. It is invertible modulo null sets if there is a measurable X0X with μ(XX0)=0 and T(X0)=X0, such that TX0 is a bijection with measurable inverse for the trace sigma-algebra. This is an actual invariant conull restriction, not a choice of arbitrary pointwise inverses on exceptional sets.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Measure preservation can be checked on a generating pi-system

Statement

Let T:XX be measurable on (X,A,μ). Let P be a pi-system generating A, with an increasing sequence PnP covering X and satisfying μ(Pn)<. If μ(T1P)=μ(P) for every PP, then T preserves μ. For finite μ, a generating pi-system can be enlarged by X to meet the exhaustion condition.

Facts & Assumptions

[F1]

Two measures agreeing on a generating pi-system and an increasing finite-mass exhaustion agree everywhere Measures agreeing on a generating pi-system are equal under an increasing finite-measure exhaustion from that pi-system.

Proof

Given: The objects and hypotheses in the statement.

1.1

Set ν(E)=μ(T1E). Inverse images take the empty set to the empty set and disjoint countable unions to disjoint countable unions. Thus ν()=0 and ν(jEj)=jν(Ej) for disjoint measurable Ej, so ν is a measure.

given
2.1

The measures ν,μ agree on P, and ν(Pn)=μ(Pn)< on the stated increasing exhaustion. Uniqueness therefore gives ν(E)=μ(E) for all EA, which is measure preservation.

F1step 1.1
3.1

If μ(X)<, adjoining X keeps the family a generating pi-system; its preservation identity holds since T1X=X. The constant exhaustion Pn=X then satisfies every required hypothesis.

step 2.1given
PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Compositions, iterates and completions preserve invariance

Statement

Compositions and nonnegative iterates of measure-preserving self-maps of (X,A,μ) preserve measure. Assuming countable choice, T also defines a measurable measure-preserving self-map of the completion (X,A,μ). Countable choice is needed here only for the cited construction of the completion measure.

Facts & Assumptions

[F1]

Under countable choice the completion construction is a complete measure extending the original measure Assuming countable choice, every measure space has a unique complete extension to its completion.

[F2]

Countable choice is assumed for this completion construction The Axiom of Countable Choice (ACω).

[F3]

Every completion-measurable set is an original measurable set modified within an original measurable null set The completion domain and proposed completed set function of a measure space.

Proof

Given: The objects and hypotheses in the statement.

1.1

For preserving S,T and measurable E, (ST)1E=T1(S1E) is measurable and has measure μ(S1E)=μ(E). The identity preserves measure; applying this composition calculation successively gives preservation for every Tn, n0.

given
2.1

Assume countable choice. The completion theorem supplies the complete measure extending μ. For EA choose A,NA with μ(N)=0 and EAN. Then T1ET1AT1N, where T1N is measurable and null. Thus T1E is completion measurable and μ(T1E)=μ(T1A)=μ(A)=μ(E).

F1F2givenF3
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Integral invariance under measure-preserving maps

Statement

If T preserves μ and f:X[0,] is measurable, then fTdμ=fdμ, allowing infinity. If f is integrable real or complex valued, fT is integrable and the same equality holds. Conversely, for a measurable self-map, equality for every measurable indicator implies measure preservation.

Facts & Assumptions

[F1]

Nonnegative measurable functions admit increasing simple approximations Every nonnegative measurable function is the increasing limit of simple measurable functions.

[F2]

Increasing nonnegative measurable functions have increasing integrals with the expected limit Monotone convergence for the integral.

[F3]

The integral is complex-linear on integrable functions The Lebesgue integral is linear on L1(μ).

Proof

Given: The objects and hypotheses in the statement.

1.1

For EA, 1ET=1T1E, hence its integral is μ(T1E)=μ(E). A nonnegative simple function written over disjoint fibers has integral equal to the sum of coefficient times fiber measure, so the identity holds for every such function, also when the sum is infinite in value.

given
2.1

For nonnegative measurable f, take snf as supplied by simple approximation. Then snTfT measurably. Integral monotone convergence on both sides gives fT=limnsnT=limnsn=f.

F1F2step 1.1
3.1

For integrable f, applying step 2.1 to f proves fT=f<. Apply that step to the positive and negative parts of each real component. Subtract their finite integrals and combine the real and imaginary parts by linearity to obtain the asserted equality.

F3step 2.1
4.1

Conversely the indicator identity is exactly μ(T1E)=μ(E) for each measurable E. Thus it is measure preservation.

step 1.1given
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

The Koopman operator

Definition

For a system in Measure-preserving transformations and systems and 1p, the Koopman operator is UT:Lp(μ)Lp(μ), UT[f]=[fT]. Scalars can be real or complex, using The space Lp(μ) as the quotient by null functions and Complex Lp classes and Euclidean test-function conventions. Membership and representative independence, and hence well-definedness, are proved in Koopman operators are linear isometries .

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Koopman operators are linear isometries

Statement

For a measure-preserving system and 1p, UT is a well-defined linear isometry on real or complex Lp. It is surjective for an invertible system, and also for a system invertible modulo null sets in the invariant-restriction convention.

Facts & Assumptions

[F1]

Koopman is pullback on a.e. classes The Koopman operator.

[F2]

Pullback preserves nonnegative integrals Integral invariance under measure-preserving maps.

[F3]
[F5]

Complex Lp has the stated quotient operations and norm Complex Holder, Minkowski, and the quotient norm.

[F6]

An invertible system has a measurable inverse, either everywhere or on the specified conull restriction Invertible measure-preserving systems.

Proof

Given: The objects and hypotheses in the statement.

1.1

Composition with measurable T is measurable. If f=g outside a measurable null set N, then fT=gT outside T1N, which is measurable and null. Thus pullback respects the a.e. equivalence relation used to define UT.

F1given
2.1

For p<, integral invariance applied to the nonnegative function fp gives fTpp=fpT=fp=fpp. Thus the pullback belongs to Lp and preserves the norm, including at p=1.

F2step 1.1
2.2

For every M0, {fT>M}=T1{f>M} has the same measure as {f>M}. The sets of finite essential bounds therefore coincide, so their infima coincide. The least-essential-bound result applies to the real modulus, proving membership and equality of the infinity norms.

F3step 1.1
3.1

Pointwise, (αf+βg)T=α(fT)+β(gT). The real and complex quotient norm theorems make these the quotient vector operations. Together with steps 1.1, 2.1 and 2.2 this proves linear isometry.

F4F5step 1.1step 2.1step 2.2
4.1

For an actual measurable inverse S=T1, TE=S1E is measurable and μ(TE)=μ(T1(TE))=μ(E). Thus S preserves measure. Both compositions UTUS and USUT are the identity, so UT is onto.

F6step 3.1
5.1

In the modulo-null case restrict to the measurable conull invariant X0 of the definition. For measurable EX0, T1E differs from its restricted inverse image only within XX0, so the restricted map preserves restricted measure. Step 4.1 applies there. For any measurable f on X, compose fX0 with the restricted inverse and extend by zero on XX0. This extension is measurable, has the same Lp norm as f, and pulls back to f on X0. It supplies a preimage class.

F6step 4.1
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Strict and mod-null invariant sigma-algebras

Definition

For a system in Measure-preserving transformations and systems, set I={EA:T1E=E},I={EA:μ(T1EE)=0}. These are respectively the strictly invariant and invariant modulo null sets families. All their members are measurable in the original sigma-algebra; the terminology uses Sigma-algebras and Measure-null sets and almost-everywhere statements relative to a measure. Their sigma-algebra property is proved in Both invariant families are sigma-algebras .

PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Both invariant families are sigma-algebras

Statement

For any measure-preserving system, I and I are sigma-algebras on X, and II.

Facts & Assumptions

[F1]

The two families use exact equality and null symmetric difference, respectively Strict and mod-null invariant sigma-algebras.

[F2]

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

Proof

Given: The objects and hypotheses in the statement.

1.1

T1X=X and T1=. Also T1(XE)=XT1E and T1(jEj)=jT1Ej. Thus exact invariance is preserved under complements and countable unions, proving that I is a sigma-algebra.

F1
2.1

The symmetric difference of the two complements is T1EE. Further, T1(jEj)jEjj(T1EjEj). If all component differences are null, countable subadditivity makes the union null. Therefore I is a sigma-algebra as well. Exact invariance gives empty symmetric difference, proving II.

F1F2step 1.1
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Mod-null invariant sets have strict representatives

Statement

If EI in a measure-preserving system, then F=lim supnTnE=m0nmTnE belongs to I and satisfies μ(EF)=0. This does not require completeness or a choice axiom.

Facts & Assumptions

[F1]

The invariant families consist of the stated measurable sets Both invariant families are sigma-algebras.

[F2]

Nonnegative iterates preserve measure; only the choice-free iteration clause is used Compositions, iterates and completions preserve invariance.

[F3]

Finite and countable unions of measurable null sets are null Finite and countable subadditivity of measures.

Proof

Given: The objects and hypotheses in the statement.

1.1

Write D=ET1E, which is measurable and null. For n1, ETnEk=0n1TkD: whenever membership at times zero and n differs, it differs at a consecutive pair. Iterates preserve measure, so every set on the right is null; finite subadditivity makes the left null. For n=0 the difference is empty.

F1F2F3
2.1

The displayed countable intersection and unions make F measurable. Outside the measurable null set N=n0(ETnE) all these indicators equal 1E, so membership in their limsup equals membership in E. Thus EFN and its measure is zero.

F3step 1.1
3.1

Pulling back the displayed formula gives T1F=m0nmT(n+1)E=F: removing the initial term does not change membership infinitely often. Hence F is strictly invariant and is the required representative.

F1step 2.1
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Ergodicity relative to an invariant measure

Definition

A measure-preserving system is ergodic for μ if each EI has μ(E)=0 or μ(XE)=0, with I as in Strict and mod-null invariant sigma-algebras. For a probability system this means μ(E){0,1}. The definition is relative to the invariant measure; no probability assumption is implicit in the general null/conull formulation.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Equivalent invariant-set and invariant-function criteria for ergodicity

Statement

For a measure-preserving probability system the following are equivalent: (i) ergodicity; (ii) every EI is null or conull; (iii) every measurable real-valued function satisfying fT=f everywhere is constant a.e.; (iv) every measurable real-valued function satisfying fT=f a.e. is constant a.e. Replacing real-valued by complex-valued in either (iii) or (iv) gives equivalent conditions. All functions take finite values.

Facts & Assumptions

[F1]

Ergodicity means every strictly invariant measurable set is null or conull Ergodicity relative to an invariant measure.

[F2]

A modulo-null invariant measurable set has a strict invariant representative modulo a measurable null set Mod-null invariant sets have strict representatives.

[F3]

Inverse images of Borel sets under measurable real functions are measurable A measurable function between measurable spaces.

[F4]

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

[F5]

A complex function is measurable when its real and imaginary components are measurable Complex Lp classes and Euclidean test-function conventions.

[F6]

Every real number lies in a unique interval [k,k+1) with integer k; applying this to n times the value gives the partition used below Integer part: for every real x there is exactly one integer m with mx<m+1.

[F7]

For every positive real epsilon some positive integer n satisfies 1/n<epsilon For every ε>0 in a complete ordered field there is a natural n1 with 1/n<ε.

Proof

Given: The objects and hypotheses in the statement.

1.1

If the system is ergodic, a set in I has by F2 a strict invariant representative differing by a null set, hence has measure zero or one. Conversely (ii) applies to strictly invariant sets. Thus (i) and (ii) are equivalent.

F1F2
2.1

Assume (ii) and let f:XR be measurable and a.e. invariant. For n1, kZ, let En,k=f1([k/n,(k+1)/n)). Measurability follows from F3. Its pullback differs from it only where fTf, so it is in I. For each n these fibers partition X. Their measures are zero or one; countable subadditivity excludes all zero, and disjointness and total mass one exclude two fibers of measure one. There is therefore a unique k(n) with μ(En,k(n))=1.

F3F4step 1.1givenF6
3.1

The set Y=n1En,k(n) is conull by countable subadditivity. It is nonempty since μ(Y)=1. Fix one x0Y. For any xY, f(x)f(x0)<1/n for every n, so f(x)=f(x0) by the Archimedean property of the real numbers. Thus (ii) implies (iv). The uniquely determined k(n) require no countable choice.

F4step 2.1F7
4.1

For a complex a.e. invariant f, its real and imaginary parts are measurable and a.e. invariant by F5. Apply the preceding argument to both, and intersect the two conull sets; f is constant there. This proves both real and complex versions of (iv), and each implies the corresponding version of (iii).

F5step 3.1
5.1

If either version of (iii) holds and E is strictly invariant, then 1E is an everywhere invariant measurable function. A constant indicator on a conull nonempty set must have constant value zero or one, so E is null or conull. Thus (iii) implies (i). Also (iv) directly implies (ii) by the same argument applied to an indicator invariant a.e. All listed implications are now closed.

F1step 4.1given
PropositionStatement: AI-adaptedProof: AI-adaptedaudited 2026-09-10Open item page →

Positive sets sweep out ergodic probability systems

Statement

In a measure-preserving probability system the following are equivalent: ergodicity; for every measurable A with μ(A)>0, μ(n1TnA)=1; and for every measurable A,B of positive measure there is n1 with μ(BTnA)>0.

Facts & Assumptions

[F1]

On probability systems ergodicity is equivalent to null/conull modulo-null invariant sets Equivalent invariant-set and invariant-function criteria for ergodicity.

[F2]

Every nonnegative iterate preserves measure Compositions, iterates and completions preserve invariance.

[F3]

Nested measurable sets of equal finite measure have null difference Measure of a set difference when the smaller set has finite measure.

[F4]

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

Proof

Given: The objects and hypotheses in the statement.

1.1

Assume ergodicity and put U=n1TnA. Then T1UU and μ(T1U)=μ(U)1. The finite-measure difference formula gives μ(UT1U)=0. Since μ(U)μ(T1A)=μ(A)>0, the modulo-null invariant-set criterion yields μ(U)=1.

F1F2F3given
2.1

If the sweep-out property holds and μ(B)>0, then μ(BU)=μ(B)>0. Were every BTnA null, their countable union BU would be null. Thus at least one intersection has positive measure.

step 1.1givenF4
3.1

If the positive-intersection property holds and T1A=A, then TnA=A for all n. Taking B=XA gives BTnA= for every n. The property excludes both A and its complement having positive measure, proving ergodicity.

F1step 2.1given
DefinitionDefinition: AI-adaptedProof: Not applicablejudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Strong and weak mixing on a probability space

Definition

For a measure-preserving probability system as in Measure-preserving transformations and systems, put dn(A,B)=μ(ATnB)μ(A)μ(B) for measurable A,B and n0. The system is strongly mixing if dn(A,B)0 for every such pair. It is weakly mixing if 1Nn=0N1dn(A,B)0(N) for every such pair. The absolute value is inside the average. In all cases N1 and T0 is the identity.

TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Mixing implies weak mixing, which implies ergodicity

Statement

Every strongly mixing probability system is weakly mixing, and every weakly mixing probability system is ergodic.

Facts & Assumptions

[F1]

Strong mixing is convergence of set correlations; weak mixing is convergence of their absolute Cesaro averages Strong and weak mixing on a probability space.

[F2]

In a probability system ergodicity means invariant sets have mass zero or one Ergodicity relative to an invariant measure.

Proof

Given: The objects and hypotheses in the statement.

1.1

For a fixed measurable pair let dn=μ(ATnB)μ(A)μ(B). Strong mixing says dn0. Given ε>0, choose m so that dn<ε for nm. For N>m, N1n<NdnN1n<mdn+ε. The first term tends to zero because it is a fixed finite sum divided by N. As ε is arbitrary, weak mixing follows.

F1
2.1

For a strictly invariant E, TnE=E for every n. Thus its weak-mixing average against itself is exactly μ(E)μ(E)2. A constant sequence tends to zero only if that constant is zero. Since 0μ(E)1, this gives μ(E)=0 or 1, which is ergodicity.

F1F2
LemmaStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Approximation in symmetric difference by a generating algebra

Statement

If μ(X)< and an algebra C of subsets of X generates A, then for every EA and ε>0 there is CC with μ(EC)<ε.

Facts & Assumptions

[F1]

An algebra contains X and is closed under complements and finite unions Algebras of subsets.

[F2]

The measure of an increasing union is the supremum of the measures Continuity from below for measures.

[F3]

Union errors are bounded by the sum of their measures Finite and countable subadditivity of measures.

[F4]

The generated sigma-algebra is the smallest sigma-algebra containing its generators Nonempty intersections of sigma-algebras are sigma-algebras, so the generated sigma-algebra exists and is minimal.

Proof

Given: The objects and hypotheses in the statement.

1.1

Let D={EA:for every ε>0 some CC has μ(EC)<ε}. Every CC lies in D by using itself. For complements, (XE)(XC)=EC, and XCC. Thus D contains X and is closed under complements.

F1
2.1

Let EjD and E=j1Ej. For Hm=j=1mEj, continuity from below gives μ(Hm)μ(E)<. By additivity on E=Hm(EHm), some m1 satisfies μ(EHm)<ε/2. Choose finitely many CjC with μ(EjCj)<ε/(2m). Then C=j=1mCjC and μ(EC)μ(EHm)+j=1mμ(EjCj)<ε.

F1F2F3step 1.1
3.1

Thus D is a sigma-algebra containing C. By the minimality of σ(C)=A, AD, and the reverse inclusion is built into its definition. This proves the approximation assertion.

F4step 1.1step 2.1
TheoremStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Mixing is checkable on a generating pi-system

Statement

Let (X,A,μ,T) be a measure-preserving probability system and P a generating pi-system containing X. Strong mixing is equivalent to dn(A,B)0 for A,BP. Weak mixing is equivalent to N1n<Ndn(A,B)0 for A,BP, where dn(A,B)=μ(ATnB)μ(A)μ(B).

Facts & Assumptions

[F1]

The two properties quantify convergence of correlations or their absolute averages over all measurable pairs Strong and weak mixing on a probability space.

[F2]

On a finite measure space every measurable set has arbitrarily accurate algebra approximants Approximation in symmetric difference by a generating algebra.

[F3]

The measure of a finite union is at most the sum of its measures Finite and countable subadditivity of measures.

[F4]

Integration of finite linear combinations of integrable functions is linear The Lebesgue integral is linear on L1(μ).

Proof

Given: The objects and hypotheses in the statement.

1.1

Let C consist of finite Boolean combinations of members of P. Each indicator of an atom of a finite Boolean partition is a product of factors 1P and 11P. Expanding the product expresses it as a finite integer linear combination of indicators of intersections of members of P. Empty intersections are X, which lies in P, and all other intersections lie in P by the pi-system property. Finite sums of these atom indicators express every 1C, CC, in this way.

given
2.1

Integration and multiplication of finite sums now express dn(C,D) as a finite linear combination j,kajbkdn(Pj,Qk). In the strong case each summand tends to zero. In the weak case the average of the absolute value is at most j,kajbkN1n<Ndn(Pj,Qk), which tends to zero. The respective test therefore holds on C.

F1step 1.1F4
3.1

The family C is an algebra generating A. For measurable A,B and δ>0, choose C,D in it with μ(AC),μ(BD)<δ. Measure preservation gives μ(Tn(BD))=μ(BD) by repeated pullback. Thus the difference of the intersection measures is bounded by the sum of these two errors. Also μ(A)μ(B)μ(C)μ(D)μ(AC)+μ(BD), since all masses are at most one. Consequently dn(A,B)dn(C,D)<4δ uniformly in n.

F2step 2.1givenF3
4.1

In the strong case the limsup of dn(A,B) is at most 4δ. In the weak case the same bound holds for the limsup of its absolute Cesaro averages. Letting δ decrease to zero proves the full respective property. Conversely either full property restricts to the pairs in P by its definition.

F1step 2.1step 3.1
PropositionStatement: AI-adaptedProof: AI-adaptedjudge pass (gpt-5.6-terra)audited 2026-09-10Open item page →

Mixing correlations extend to L2 functions

Statement

On a measure-preserving probability system, for complex f,gL2(μ) put Cn(f,g)=(fTn)gdμ(fdμ)(gdμ). Strong mixing is equivalent to Cn(f,g)0 for all such f,g. Weak mixing is equivalent to N1n<NCn(f,g)0 for all such f,g. The pairing is linear in its first variable.

Facts & Assumptions

[F1]

Complex integration is componentwise and the pairing is linear in its first variable Complex Lp classes and Euclidean test-function conventions.

[F2]

Koopman is an isometry on complex L2 Koopman operators are linear isometries.

[F3]

Real-modulus products have integral bounded by the product of their L2 norms Cauchy-Schwarz inequality for L2.

[F4]

The complex L2 pairing is well-defined, sesquilinear and satisfies Cauchy–Schwarz The complex L2 pairing is well-defined and satisfies Cauchy–Schwarz.

[F5]

Set mixing uses ordinary convergence or absolute Cesaro convergence Strong and weak mixing on a probability space.

[F6]

Finite simple functions of finite-measure support are dense in complex L2 on every measure space Complex finite-simple and smooth compact-support density for finite p.

[F7]

The complex L2 quotient norm satisfies the triangle inequality Complex Holder, Minkowski, and the quotient norm.

Proof

Given: The objects and hypotheses in the statement.

1.1

The constant one has L2 norm one. Complex Cauchy–Schwarz gives ff2 and gg2. Koopman isometry, iterated n times, gives fTn2=f2. Applying the real-modulus Cauchy–Schwarz inequality to fTn and g proves absolute integrability of the product. Thus every term defining Cn exists and is independent of representatives, with the indicated complex pairing.

F1F2F3F4
2.1

For indicators Cn(1B,1A)=μ(ATnB)μ(A)μ(B). For finite complex simple a=jαj1Bj and b=kβk1Ak, sesquilinearity gives Cn(a,b)=j,kαjβkCn(1Bj,1Ak). Therefore the set version of strong mixing gives convergence for simple pairs, and the weak version gives it for absolute Cesaro averages by the finite triangle inequality.

F4F5step 1.1
2.2

For any L2 h,k, the two Cauchy–Schwarz estimates in step 1.1 give Cn(h,k)2h2k2. Choose finite simple a,b with fa2<δ and gb2<δ using only the finite-simple clause of density. Then sesquilinearity gives Cn(f,g)Cn(a,b)2(fa2g2+a2gb2)2δ(g2+f2+δ). The bound is independent of n.

F4F6step 1.1F7
3.1

Taking limsups of absolute values, or of their Cesaro averages, uses step 2.1 to remove the simple-pair term. Sending δ to zero proves the respective L2 property. Conversely the L2 property applies to indicators, which lie in L2 because μ(X)=1, and their identity in step 2.1 is precisely the set property.

F5step 2.1step 2.2

5 · Examples, counterexamples and false statements

None yet.

Sources