Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck pass
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.

Compatible magnetic initial projection for the Maxwell edge method

Statement

Assume the contractible Lipschitz domain and shape-regular mesh-family hypotheses of Uniformly bounded commuting projection for lowest-order Nedelec spaces, with matching affine tetrahedra and the PEC edge space of Edge-face Maxwell finite element semidiscretization. Assume Countable Choice as in that projection interface. Let B0∈H(div⁡;Ω) be piecewise smooth, have matching normal traces, and satisfy div⁡B0=0. For the approximation bound below, assume all material and field smoothness interfaces are mesh-aligned, with B0 and div⁡B0 piecewise C1 on cell closures and bounded cellwise first derivatives as in Smooth lowest-order Nedelec and RT0 interpolation estimate. Let πh2 be the degree-two cochain projection in that interface, let Xh=range⁡C⊂Nh2, and let PXh be orthogonal projection onto Xh for (u,v)μ−1=∫ΩuTμ−1v dx. Define Bh0=πh2B0+PXh(B0−πh2B0). Then Bh0∈Nh2, DBh0=0, and (Bh0−B0,curl⁡vh)μ−1=0(vh∈Vh),∥Bh0−B0∥μ−1≤Ch MB, where Vh=Nh1∩H0(curl⁡;Ω) and MB is the maximum of the piecewise first-derivative bounds for B0 and div⁡B0 used by the smooth interpolation estimate. The error constant is uniform over the shape-regular family when the commuting projection norms are uniformly bounded.

Facts & Assumptions

Given: The finite element spaces, curl matrix C, divergence matrix D, positive magnetic inner product, and the declared Countable Choice branch.

[A1]

Countable Choice is the only choice axiom required by the current bounded commuting projection interface; this proof makes no stronger choice assumption. (The Axiom of Countable Choice (ACω))

[F1]

The degree-two and degree-three operators πh2,πh3 are projections onto Nh2,Nh3, are uniformly bounded on their de Rham graph spaces, and satisfy div⁡πh2=πh3div⁡. (Uniformly bounded commuting projection for lowest-order Nedelec spaces)

[F2]

The oriented moment matrices represent curl⁡:Vh→Nh2 and div⁡:Nh2→Nh3, with DC=0. (Edge-face Maxwell finite element semidiscretization, Whitney edge, face, and cell moments commute with grad, curl, and div)

[F3]

Under the stated mesh alignment and cellwise C1 bounds, for B0 with matching normal traces, the canonical face interpolant Ih2B0 lies in Nh2 and has ∥B0−Ih2B0∥H(div⁡)≤ChMB. (Smooth lowest-order Nedelec and RT0 interpolation estimate)

Proof

1.1A1givenconstructalgebra

The subspace Xh is finite dimensional. In a basis of Xh, its μ−1 Gram matrix is symmetric positive definite, so the normal equations have one solution for each B0−πh2B0; this defines PXh. Its value lies in Xh⊂Nh2, and the definition of orthogonal projection gives Bh0−B0=−(I−PXh)(B0−πh2B0)⊥μ−1Xh. Orthogonal decomposition yields ∥Bh0−B0∥μ−1≤∥B0−πh2B0∥μ−1.

2.1F1F3step 1.1algebra

Since Ih2B0∈Nh2 and πh2 is a projection, πh2Ih2B0=Ih2B0. Thus B0−πh2B0=(I−πh2)(B0−Ih2B0). Uniform boundedness of πh2 on H(div⁡), norm equivalence from the coefficient bounds, and [F3] imply ∥B0−πh2B0∥μ−1≤ChMB. Combining with step 1.1 gives the asserted approximation estimate.

3.1F1F2givenstep 1.1algebra∎

The projection identity and [F1] give Dπh2B0=πh3(div⁡B0)=0. Every element of Xh is a discrete curl, so [F2] gives DPXh(B0−πh2B0)=0. Adding the two terms proves DBh0=0.

Depends on

Used by

Dependency tree · two levels

23 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