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 zero-measure Lp boundary
Statement refuted
For every finite compactly supported measure and every , a single-hidden-layer network family is dense in only if its activation is not polynomial almost everywhere.
Statement references
Facts & Assumptions
Given: The zero measure , an exponent , and the constant activation .
is the space of finite--integral functions modulo equality almost everywhere (The function space for , The space as the quotient by null functions).
The single-hidden-layer family includes the zero function by taking width zero and output bias zero (Single-hidden-layer network realization).
A measure is a nonnegative countably additive set function on its sigma-algebra; the zero measure assigns zero to every measurable set (Measures on sigma-algebras).
Counterexample
The constant activation is a polynomial, and the zero measure is finite, compactly supported, and absolutely continuous with respect to Lebesgue measure by [F3].
Since every measurable function has seminorm zero, the quotient space contains only its zero class by [F1].
The network family contains the zero function by [F2], whose class is the only element of . Thus it is dense despite the polynomial activation, refuting the unrestricted “only if” claim.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
14 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.