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 ()). Let and be sigma-finite measure spaces (Finite, sigma-finite, and semifinite measures), let be the product measure on the product sigma-algebra (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 for the rectangle kernel of a measurable rectangle (Measurable rectangles in a product of measurable spaces) with and . Then the set of finite complex linear combinations of such rectangle kernels is dense both
- in , and
- in (The space as the quotient by null functions).
Facts & Assumptions
Given: Countable Choice and two sigma-finite measure spaces and .
Sigma-finiteness provides a sequence in with and , and likewise a sequence for ; finite unions of sets of finite measure again have finite measure (Finite, sigma-finite, and semifinite measures, Finite and countable subadditivity of measures).
The product measure is the unique measure on with ; it is sigma-finite, and its completion extends it, agreeing with it on every -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).
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).
Finite disjoint unions of measurable rectangles form an algebra of subsets of generating ; 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).
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).
Complex finite simple functions with finite-measure nonzero sets are dense in for every exponent , on every measure space (Complex finite-simple and smooth compact-support density for finite p).
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).
If a measurable set has , then has an class and . More generally, if measurable satisfy , then has an class with squared norm (The space as the quotient by null functions).
Proof
Given: Countable Choice, sigma-finite and , and the increasing finite-measure exhaustions , , of [F1], with .
Each is a measurable rectangle of finite product measure, , and ; moreover for every by [F3], so for and real there is with .
A local algebra on each exhausted rectangle. Fix and let be the trace sigma-algebra, and let be the family of finite unions of rectangles with , , , . Then is an algebra of subsets of : it contains , it is closed under finite unions by definition, and for the complement in is , a union of two rectangles inside , while complements of finite unions follow by De Morgan and the closure of products of intersections; every element of is a finite disjoint union of rectangles by [F4]. Furthermore : the inclusion is clear since each generator of lies in , and conversely is a sigma-algebra containing every measurable rectangle, because , hence it contains and therefore . Finally the trace measure on is a finite measure because by [F2].
Approximation of sets of finite product measure. Let with and let . Choose with by [step 1.1]; then , so [F5] applied to the finite measure space and its generating algebra of [step 1.2] gives with . Since , [F3] gives , and is a finite union of rectangles with , as a subset of .
Indicator approximation. For and as in [step 2.1], is a finite sum of rectangle kernels by [F4] and [step 2.1], and by [F8] the difference of the classes of and has squared -norm .
Density in the product space. Let be a class in and let . By [F6] with there is a complex finite simple function with . If , take the zero rectangle combination. Otherwise write using only its nonzero values, so every and every has finite measure; put and . For each , [step 3.1] gives a set that is a finite union of finite-measure rectangles and satisfies . Then is a finite complex linear combination of rectangle kernels and the triangle inequality gives .
Density in the completed space. Let be a class in and let . By [F6] applied in the completed measure space there is a complex finite simple function with . If , take the zero rectangle combination. Otherwise, using the same nonzero-value representation and coefficient bookkeeping as in [step 4.1], write with every and every of finite completed measure, and put and . For each , [F7] applied to the indicator of provides with , hence by [F2]. By [step 2.1] there is a set that is a finite union of finite-measure rectangles with , so the classes satisfy by [F3] and [F8]. The triangle inequality in the completed space therefore gives , and the approximant is a finite complex linear combination of rectangle kernels.
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 and .
Depends on
- Finite, sigma-finite, and semifinite measures
- Measurable rectangles in a product of measurable spaces
- The product sigma-algebra and its finite iterates
- Algebras of subsets
- For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique
- The completed product measure
- Assuming countable choice, every measure space has a unique complete extension to its completion
- Continuity from below for measures
- Finite and countable subadditivity of measures
- Finite disjoint unions of measurable rectangles form an algebra generating the product sigma-algebra
- Approximation in symmetric difference by a generating algebra
- Complex finite-simple and smooth compact-support density for finite p
- A function measurable for a completion is almost everywhere equal to one measurable for the original sigma-algebra
- The space $L^p(\mu)$ as the quotient by null functions
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
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
- Sheldon Axler, Measure, Integration & Real Analysis — product measure and Lp approximation ingredients, §§7A, 10C, 10.70 (standard reference, not scraped)
- John K. Hunter, Measure Theory — product measure and generating-algebra approximation (standard reference, not scraped)