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.
Zero-mean L2 decomposition over a finite cover
Statement
Let be the finite connected star-shaped cover from Finite star-shaped cover of a bounded Lipschitz domain, with measurable partition and normalized tree-edge bumps . For every there are , depending linearly on , whose zero extensions satisfy and
Facts & Assumptions
Given: The finite cover, its spanning tree and unit-integral edge bumps; with zero integral.
The cover has measurable disjoint partitioning and a connected intersection graph with a spanning tree; each edge bump is supported in the overlap and has integral one. (Finite star-shaped cover of a bounded Lipschitz domain)
Proof
Root the finite spanning tree. Set , , and let be the sum of over the subtree rooted at . For a nonroot vertex with parent-edge bump , set ; at the root omit the final term. Every summand is supported in by [F1].
Since each bump integrates to one, a nonroot patch has integral by the subtree identity . At the root, the integral is .
In the sum of all , every tree-edge term at a child cancels the term at its parent, leaving almost everywhere because the partition . All coefficients and operations are linear in .
For every subtree, by [F2], and . The triangle inequality applied to the definition in step 1.1 gives .
Depends on
Used by
Dependency tree · two levels
13 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
- Jean-Luc Guermond, MATH 661 Fall 2025, Chapters 53–54 (complete course notes) (standard reference, not scraped)
- Daniele Boffi, Franco Brezzi, Michel Fortin, Mixed Finite Element Methods and Applications (complete textbook) (standard reference, not scraped)