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 broken polynomial with a nonzero jump is not globally H1
Example
On the interval partition , , let on and on . This is a broken piecewise-constant polynomial with jump at the interior face. Its distributional derivative is a point mass, so .
Facts & Assumptions
Given: Countable Choice; the interval partition; the piecewise-constant function above; and the weak-derivative definition of .
A weak first derivative must satisfy for every . (Integer-order Sobolev spaces and their norms)
The interior scalar jump is the left trace minus the right trace. (Jump and average conventions for symmetric interior-penalty DG)
The Sobolev-space definition assumes Countable Choice. (The Axiom of Countable Choice ())
The case of Holder's inequality gives . (Holder's inequality for integrals, including the endpoint cases)
Verification
The traces at are and , so [F2] gives . For every smooth compactly supported , direct integration on the two intervals gives .
If an weak derivative existed, [F1] would give . Use the explicit bump for and otherwise; it is smooth because the exponential is flat at the endpoints, is supported in , and satisfies . Let for . Then , , and . The integral Cauchy–Schwarz inequality [F4] forces , contradicting step 1.1. Thus no such exists and .
Depends on
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.