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.
A locally integrable function can fail to differentiate on a null set
Example
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()).
Define Then is bounded and locally integrable, but the averages do not converge as . Thus differentiation can fail on the null set .
Facts & Assumptions
Given: The Axiom of Countable Choice and the function above.
Ball averages are the normalized interval averages in one dimension. (The average of a locally integrable function over a Euclidean ball)
Lebesgue differentiation holds almost everywhere for locally integrable functions. (Lebesgue differentiation theorem on )
Verification
The function takes only the values and , so it is measurable and [given, algebra] bounded by . Hence it is locally integrable on .
For , the set on which inside is [L1, given, algebra] exactly the disjoint union whose total length is Therefore
For , the set on which inside is [L1, step 1.2, algebra] exactly whose total length is Hence
Steps 1.2 and 2.1 give two sequences of radii tending to along which [L2, step 1.2, step 2.1] tends to different values. So has no limit as . This does not contradict [L2], because the exceptional set here is the singleton null set .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
15 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: Modern Techniques and Their Applications, 2nd ed., Theorem 3.18 (standard reference, not scraped)