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.
is dense in for
Statement
Assume the Axiom of Countable Choice.
Let . Then is dense in .
Facts & Assumptions
Given: The Axiom of Countable Choice, , , and .
Box-step functions are dense in (Finite linear combinations of box indicators are dense in for ).
Finite-measure measurable sets admit compact cores with bounded open neighbourhoods of arbitrarily small excess (A finite-measure measurable set in has a compact core and a bounded open neighbourhood of arbitrarily small excess).
Compact sets inside bounded open sets admit explicit compactly supported continuous cutoffs (A compact set inside a bounded open set admits an explicit compactly supported continuous cutoff).
Minkowski's inequality holds in (Minkowski's inequality for integrals, including ).
Proof
By [L1], choose a box-step function [L1, L2, given, choose] with . For each , apply [L2] to choose and a bounded open set with
For each , [L3] gives with [L3, L4, step 1.1, construct, algebra] , on , and . Put Since vanishes off and has absolute value at most there, by [L4].
Therefore [step 1.1, step 2.1, algebra] Since , the space is dense in .
Depends on
- Finite linear combinations of box indicators are dense in $L^p(\mathbb{R}^n)$ for $1 \le p < \infty$
- A compact set inside a bounded open set admits an explicit compactly supported continuous cutoff
- A finite-measure measurable set in $\mathbb{R}^n$ has a compact core and a bounded open neighbourhood of arbitrarily small excess
- Minkowski's inequality for integrals, including $p = \infty$
Used by
- If 1 < p < ∞ and q is conjugate to p, then f*g is continuous and vanishes at infinity Corollary
- ‖τ_h f - f‖ₚ → 0 in Lᵖ(ℝⁿ) as h → 0, for 1 ≤ p < ∞ Theorem
- Abel means converge in Lᵖ, uniformly, and at Lebesgue points Theorem
- C_c^∞(ℝⁿ) is dense in Lᵖ(ℝⁿ) for 1 ≤ p < ∞ Theorem
- Fejer means converge in Lᵖ for 1 <= p < infinity Theorem
- Lebesgue differentiation theorem on ℝⁿ Theorem
- The principle of descent and the logarithmic domination principle Theorem
Dependency tree · two levels
23 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
- Walter Rudin, Real and Complex Analysis, 3rd ed. (standard reference, not scraped)