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.
H1-zero fields have zero weak H(div) normal trace
Statement
Assume Countable Choice and let be open. Every real vector field belongs to , where the latter is the kernel of the weak normal trace. In particular, and its weak normal trace vanishes on the whole boundary trace quotient.
Facts & Assumptions
Given: Countable Choice, an open set , and .
Countable Choice selects the compactly supported smooth approximants in the H1-zero closure. (The Axiom of Countable Choice ())
Each component of has its first weak derivatives in ; their finite sum is the distributional divergence. (Integer-order Sobolev spaces and their norms, The real H(div) space)
is the -norm closure of . (Zero-boundary Sobolev space as a norm closure)
Green duality defines the weak normal trace by . (Weak normal trace by Green duality)
is exactly the kernel of this weak normal trace. (Zero-normal-trace H(div) space)
Cauchy–Schwarz controls each volume pairing in Green duality. (Cauchy-Schwarz inequality for )
Proof
Since each component of and each first weak derivative is in by [F1], the finite sum lies in . Thus by its definition.
By [A1,F2], choose vector fields with in . For arbitrary , the weak-derivative identity for , tested against each compactly supported component , gives The H1 convergence implies in and in . Specifically, [F5] bounds the difference of the Green pairings by Thus . This holds for every ; hence [F3] gives , and [F4] implies .
Depends on
Used by
Dependency tree · two levels
25 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
- Daniele Boffi, Franco Brezzi and Michel Fortin, Mixed Finite Element Methods and Applications (standard reference, not scraped)
- Jean-Luc Guermond, MATH 661 Fall 2025, Part III Chapter 14: H(div) finite elements (standard reference, not scraped)