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.
Finite element correction and strong convergence of Whitney cochain projections
Statement
Assume Countable Choice (The Axiom of Countable Choice ()). Under the hypotheses and notation of the averaged-pullback lemma, choose one so small that for every mesh and degree; here and . Set These are uniformly -bounded projections onto their indicated spaces. They commute with in degrees on respectively and ; the degree-three differential is zero. They are uniformly bounded in their graph norms. If , then in for every form, uniformly for in any compact subset. They converge in the graph norm on the corresponding graph domains.
Facts & Assumptions
Given: Countable Choice and the uniform bounds, commutation identities and relative-space conformity of Averaged pullback Whitney moments and uniform near identity.
Compactly supported smooth coefficient vectors are dense in of any open set under Countable Choice (Smooth compactly supported functions of an open set are dense in ). All other completeness and smoothing inputs, with their choice hypothesis, are already included in the preceding supplier. The inverse series below is on a finite-dimensional space; it introduces no new choice principle.
Proof
On each indicated finite element space the Neumann series converges in operator norm, has norm at most two, and telescopes to both inverse identities. Therefore has norm at most and equals the identity on its target. Its range is precisely that target, so . For , the restriction of commutation to the subcomplex gives ; applying this identity to and multiplying by gives . Consequently on the stated full or relative domain in those degrees. In degree three, , so the terminal commutation identity is automatic and needs no degree-four operator. The two bounds give the graph-norm bound directly.
The projection identity yields . For a globally smooth form on a neighborhood of , canonical Whitney interpolation converges in : subtract a constant-coefficient form on each cell, which is reproduced in every degree; the remaining coefficient has supremum at most . Its simplex moments are at most , so the scaled moment norm gives . Summing proves convergence. Relative spaces have the same approximation property for compactly supported smooth inputs, whose boundary moments vanish once the mesh is sufficiently fine. By [F1], smooth restrictions are dense in full , and compactly supported smooth forms are dense in relative , which is the same ambient space. A three-term approximation and the uniform projection bound prove strong convergence for every in either case.
If is compact in , choose a finite -net in it. For within of , . The finite maximum tends to zero by step 2.1, and then proves uniform convergence on . For in a graph domain of degree , commutation and strong convergence in degrees give . In degree three the graph norm is the norm, so step 2.1 gives graph convergence.
Depends on
Used by
Dependency tree · two levels
46 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
- Douglas N. Arnold, Richard S. Falk, and Ragnar Winther, Finite element exterior calculus: from Hodge theory to numerical stability (standard reference, not scraped)