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.
Stable mixed curl-curl formulation with kernel gauge
Statement
Assume Countable Choice for the graph spaces and real product as in Kernel quotient and gauge for discrete curl-curl. Let be that finite-dimensional real edge space, , and . Here is the algebraic dual of Linear functionals and the algebraic dual . For every there is a unique pair satisfying The gauge multiplier is the Riesz representative of . The quotient solution satisfies the exact stability identity The constraint form has inf-sup constant one when , has the graph norm and has the norm; if the constraint is vacuous. The curl form is coercive with constant one on in the quotient curl norm. No mesh-uniform estimate in the full graph norm is claimed here.
Facts & Assumptions
Given: The finite-dimensional real space , its kernel and orthogonal gauge from Kernel quotient and gauge for discrete curl-curl, and a linear functional .
Countable Choice is inherited from the graph-space uniqueness and real product interfaces; the finite-dimensional Riesz and orthogonal-decomposition arguments use no stronger choice axiom. (The Axiom of Countable Choice ())
is the curl kernel, , and is the quotient norm. (Kernel quotient and gauge for discrete curl-curl)
A finite-dimensional real inner-product space splits as . (For a subspace of a finite-dimensional inner product space, )
Every real linear functional on a finite-dimensional real inner-product space is represented uniquely by inner product with a vector. (Finite-dimensional Riesz representation: every functional is uniquely )
consists of all real linear functionals on . (Linear functionals and the algebraic dual )
Proof
On , the bilinear form is an inner product: if , then and , hence . The finite-dimensional Riesz theorem [F3] applied to gives a unique with for every . Applying [F3] to the inner product on the finite-dimensional gives a unique with for all . The zero subspace cases are included in [F3].
Restrict the inner product to the finite-dimensional space . Its orthogonal complement of is by [F1], so [F2] gives . Thus each has a unique orthogonal decomposition . Since and , the two identities of step 1.1 give . Also gives the gauge equation. Any solution must restrict to the unique Riesz problems on and , proving uniqueness.
For any real inner product and any nonzero , positivity of at gives ; if the inequality is immediate. Thus the norm of the functional is at most , and when equality is attained at ; when both sides vanish. Applying this argument to and the product, together with the Riesz identities of step 1.1, proves both exact dual-norm identities. For the constraint, if choose ; then , , and , so the inf-sup constant is at least one. For the upper bound, the same positive-square argument with the inner product gives . On , , which gives coercivity constant one in the declared quotient norm.
Depends on
- Kernel quotient and gauge for discrete curl-curl
- For a subspace $W$ of a finite-dimensional inner product space, $V=W\oplus W^\perp$
- Finite-dimensional Riesz representation: every functional is uniquely $v\mapsto\langle v,w\rangle$
- Linear functionals and the algebraic dual $V^*=\mathcal L(V,F)$
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
Used by
Dependency tree · two levels
21 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
- Long Chen, Finite Element Methods for Maxwell Equations, complete lecture notes (standard reference, not scraped)
- Douglas N. Arnold, Richard S. Falk, and Ragnar Winther, Finite element exterior calculus: from Hodge theory to numerical stability (standard reference, not scraped)