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.
One-dimensional SIPDG jump and penalty calculation
Example
This is a self-contained one-dimensional interval specialization of the jump convention in Jump and average conventions for symmetric interior-penalty DG. Let and , take unit coefficient, and set at the interior point face. Define on and on . Then , while the interior jump at is and the average derivative is . The face contributions are . With penalty parameter , the bilinear form has value .
Facts & Assumptions
Given: The two-cell interval partition, unit coefficient, counting measure on all point faces, at each face (the common interval-cell length), the piecewise affine function , and . For functions on these cells, define where , , and ; the endpoint jumps are the one-sided value traces and all face integrals use counting measure.
On an interior face the scalar jump is the minus trace minus the plus trace, and the average is their arithmetic mean. (Jump and average conventions for symmetric interior-penalty DG)
Verification
The derivative is on both cells, so the broken volume term is . At the interior point , [F1] gives and , while both boundary traces vanish.
The interior consistency terms contribute , and the penalty contributes . Adding these to the volume term from step 1.1 gives .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
3 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.