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 graph of a measurable function R^n to R is Lebesgue null
Statement
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()). Let and let be Lebesgue measurable. Then its graph is Lebesgue measurable and has -dimensional Lebesgue measure zero.
Facts & Assumptions
Given: The Axiom of Countable Choice, a positive integer , and a Lebesgue measurable function .
Arithmetic operations preserve measurability. (Arithmetic and lattice operations preserve measurability whenever they are defined)
Tonelli's theorem holds on sigma-finite products. (Tonelli's theorem for nonnegative measurable functions on a sigma-finite product)
Assuming countable choice, countable subsets of Euclidean space are Lebesgue null. (Every at most countable subset of is Lebesgue null; in particular )
Proof
The function is measurable by [L1], so is measurable.
For each , the section is the singleton , which is countable and therefore Lebesgue null by [L3]. Applying [L2] to yields Hence the graph is Lebesgue null.
Depends on
- The region under a nonnegative measurable function is product-measurable and has measure equal to the integral
- Tonelli's theorem for nonnegative measurable functions on a sigma-finite product
- Every at most countable subset of $\mathbb{R}^n$ is Lebesgue null; in particular $\lambda_1(\mathbb{Q})=0$
- Arithmetic and lattice operations preserve measurability whenever they are defined
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
28 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
- Gerald B. Folland, Real Analysis, 2nd ed., Exercise 50 (standard reference, not scraped)