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.
Discrete gradient gap from a relative commuting projection
Statement
Assume AC. Let be nonempty, bounded, and open. Write , , and let denote the -orthogonal projection onto . Let and be finite-dimensional subspaces with . Suppose linear projections and satisfy . For , put . Then , , and If moreover and in for each fixed , every -convergent sequence of lifts has . Here the operator norm means that the graph-space operators possess bounded extensions to .
Facts & Assumptions
Given: AC, the spaces and relative commuting projections in the Statement. When the domain and mesh satisfy the projection theorem's hypotheses, its separate homogeneous family supplies a concrete instance of these relative-degree-zero, -boundedness and strong-convergence interfaces. The present result is conditional only on the abstract projection hypotheses in its own Statement, and the unrestricted family is not used here.
On bounded open sets, the scalar zero-boundary Poincare inequality holds under CC. (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction, The Axiom of Countable Choice ())
A nonempty closed convex subset of a real Hilbert space has a unique nearest point under CC, characterized by the variational inequality. (Projection onto a nonempty closed convex set, Variational characterisation of the nearest point)
Sobolev spaces are complete under AC; is a closed subspace by its closure definition. Real is Hilbert under CC, and compactly supported smooth functions are dense in on every open set under CC, applied in each of three components. (Integer-order Sobolev spaces are Banach, with the integral pairing is a Hilbert space, Smooth compactly supported functions of an open set are dense in )
AC implies the CC used in [F1] and [F2]. (The Axiom of Choice)
Proof
If is Cauchy in , [F1] makes Cauchy in , so its limit has . Thus is closed. Apply [F2] to . For its nearest point , testing the variational inequality with , , gives . Uniqueness of this decomposition proves linearity, and its Pythagorean identity proves that and are contractions. Finally, if , smooth compactly supported approximation shows with curl zero: convergence of the gradients is convergence in the curl graph norm. Therefore has the stated membership and curl.
Write with , and put . Identity on and commutation give . Both and are orthogonal to , hence . Since , Cauchy–Schwarz yields . Division if the left factor is nonzero proves the inequality; the zero case is immediate. This is the missing discrete-gradient estimate.
Suppose in . The extensions of the projections converge strongly to identity on all : first approximate an arbitrary by a smooth compactly supported vector field , then use . Consequently . Step 2.1 gives the last assertion.
Depends on
- Uniformly bounded commuting projection for lowest-order Nedelec spaces
- The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction
- Integer-order Sobolev spaces are Banach
- $L^2$ with the integral pairing is a Hilbert space
- Smooth compactly supported functions of an open set are dense in $L^2$
- Projection onto a nonempty closed convex set
- Variational characterisation of the nearest point
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
- The Axiom of Choice
Used by
Dependency tree · two levels
72 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)