Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Product rectangle kernels are dense in product L two

Statement

Assume the Axiom of Countable Choice (The Axiom of Countable Choice (ACω)). Let (X,A,μ) and (Y,B,ν) be sigma-finite measure spaces (Finite, sigma-finite, and semifinite measures), let μ×ν be the product measure on the product sigma-algebra AB (The product sigma-algebra and its finite iterates, For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique), and let μ×ν be its completion (The completed product measure). Write 1A(x)1B(y) for the rectangle kernel of a measurable rectangle A×B (Measurable rectangles in a product of measurable spaces) with μ(A)<+ and ν(B)<+. Then the set of finite complex linear combinations of such rectangle kernels is dense both

  1. in L2(μ×ν;C), and
  2. in L2(μ×ν;C) (The space Lp(μ) as the quotient by null functions).

Facts & Assumptions

Given: Countable Choice and two sigma-finite measure spaces (X,A,μ) and (Y,B,ν).

[F1]

Sigma-finiteness provides a sequence (Xk) in A with μ(Xk)<+ and X=kXk, and likewise a sequence (Yl) for ν; finite unions of sets of finite measure again have finite measure (Finite, sigma-finite, and semifinite measures, Finite and countable subadditivity of measures).

[F2]

The product measure is the unique measure on AB with (μ×ν)(A×B)=μ(A)ν(B); it is sigma-finite, and its completion μ×ν extends it, agreeing with it on every AB-measurable set (For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique, Assuming countable choice, every measure space has a unique complete extension to its completion).

[F3]

For an increasing sequence of measurable sets the measure of the union is the supremum of the measures, and measures are finitely and countably subadditive (Continuity from below for measures, Finite and countable subadditivity of measures).

[F4]

Finite disjoint unions of measurable rectangles form an algebra of subsets of X×Y generating AB; in particular a finite union of measurable rectangles is a finite disjoint union of measurable rectangles (Finite disjoint unions of measurable rectangles form an algebra generating the product sigma-algebra, Algebras of subsets).

[F5]

If a finite measure space carries an algebra generating its sigma-algebra, then every measurable set is approximable in symmetric difference by an element of that algebra (Approximation in symmetric difference by a generating algebra).

[F6]

Complex finite simple functions with finite-measure nonzero sets are dense in Lp for every exponent 1p<, on every measure space (Complex finite-simple and smooth compact-support density for finite p).

[F7]

Under Countable Choice, a function measurable for a completion is almost everywhere equal to a function measurable for the original sigma-algebra, and the completion of a measure agrees with it on the original measurable sets (A function measurable for a completion is almost everywhere equal to one measurable for the original sigma-algebra, Assuming countable choice, every measure space has a unique complete extension to its completion).

[F8]

If a measurable set E has ρ(E)<+, then 1E has an L2 class and 1E22=ρ(E). More generally, if measurable E,C satisfy ρ(EC)<+, then 1E1C has an L2 class with squared norm ρ(EC) (The space Lp(μ) as the quotient by null functions).

Proof

technique · direct

Given: Countable Choice, sigma-finite (X,A,μ) and (Y,B,ν), and the increasing finite-measure exhaustions Xn:=knXk, Yn:=lnYl, Zn:=Xn×Yn of [F1], with ρ:=μ×ν.

1.1

Each Zn is a measurable rectangle of finite product measure, ZnZn+1, and nZn=X×Y; moreover ρ(EZn)ρ(E) for every EAB by [F3], so for ρ(E)<+ and real δ>0 there is n with ρ(EZn)<δ/2.

F1F2F3
1.2

A local algebra on each exhausted rectangle. Fix n and let Gn:={FZn:F=EZn for some EAB} be the trace sigma-algebra, and let Cn be the family of finite unions of rectangles A×B with AA, AXn, BB, BYn. Then Cn is an algebra of subsets of Zn: it contains , it is closed under finite unions by definition, and for A×BZn the complement in Zn is ((XnA)×Yn)(A×(YnB)), a union of two rectangles inside Zn, while complements of finite unions follow by De Morgan and the closure of products of intersections; every element of Cn is a finite disjoint union of rectangles by [F4]. Furthermore σ(Cn)=Gn: the inclusion is clear since each generator of Cn lies in Gn, and conversely {EAB:EZnσ(Cn)} is a sigma-algebra containing every measurable rectangle, because (A×B)Zn=(AXn)×(BYn)Cn, hence it contains AB and therefore Gn. Finally the trace measure ρn(F):=ρ(F) on Gn is a finite measure because ρn(Zn)=μ(Xn)ν(Yn)<+ by [F2].

F1F2F4
2.1

Approximation of sets of finite product measure. Let EAB with ρ(E)<+ and let δ>0. Choose n with ρ(EZn)<δ/2 by [step 1.1]; then EZnGn, so [F5] applied to the finite measure space (Zn,Gn,ρn) and its generating algebra Cn of [step 1.2] gives CCn with ρn((EZn)C)<δ/2. Since EC(EZn)((EZn)C), [F3] gives ρ(EC)<δ, and C is a finite union of rectangles with μ(A)<+, ν(B)<+ as a subset of Zn.

step 1.1step 1.2F3F5
3.1

Indicator approximation. For E and C as in [step 2.1], 1C is a finite sum of rectangle kernels by [F4] and [step 2.1], and by [F8] the difference of the classes of 1E and 1C has squared L2(ρ)-norm ρ(EC)<δ.

step 2.1F4F8
4.1

Density in the product space. Let h be a class in L2(ρ;C) and let ε>0. By [F6] with p=2 there is a complex finite simple function s with hs2<ε/2. If s=0, take the zero rectangle combination. Otherwise write s=j<mcj1Ej using only its nonzero values, so every cj0 and every Ej has finite measure; put B:=j<mcj>0 and δ:=(ε/(2B))2. For each j, [step 3.1] gives a set Cj that is a finite union of finite-measure rectangles and satisfies 1Ej1Cj2<ε/(2B). Then R:=jcj1Cj is a finite complex linear combination of rectangle kernels and the triangle inequality gives hR2hs2+Bmaxj1Ej1Cj2<ε.

step 3.1F6
5.1

Density in the completed space. Let h be a class in L2(μ×ν;C) and let ε>0. By [F6] applied in the completed measure space there is a complex finite simple function s with hsμ×ν<ε/2. If s=0, take the zero rectangle combination. Otherwise, using the same nonzero-value representation and coefficient bookkeeping as in [step 4.1], write s=j<mcj1Ej with every cj0 and every Ej of finite completed measure, and put B:=j<mcj>0 and δ:=(ε/(2B))2. For each j, [F7] applied to the indicator of Ej provides AjAB with μ×ν(EjAj)=0, hence ρ(Aj)=μ×ν(Aj)=μ×ν(Ej)<+ by [F2]. By [step 2.1] there is a set Cj that is a finite union of finite-measure rectangles with ρ(AjCj)<δ, so the classes satisfy 1Ej1Cjμ×ν2=μ×ν(EjCj)μ×ν(EjAj)+ρ(AjCj)<δ by [F3] and [F8]. The triangle inequality in the completed space therefore gives hjcj1Cjμ×ν<ε, and the approximant is a finite complex linear combination of rectangle kernels.

step 2.1step 4.1F2F3F6F7F8
6.1

Steps 4.1 and 5.1 give the two density assertions of the statement, for an arbitrary class and arbitrary positive tolerance in each of the two spaces; all approximations are finite complex linear combinations of rectangle kernels with μ(A)<+ and ν(B)<+.

step 4.1step 5.1

Depends on

Used by

Dependency tree · two levels

50 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