Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6-luna)
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 (ACω)). Under the hypotheses and notation of the averaged-pullback lemma, choose one ϵ>0 so small that ∥(Qh±,k−I)∣Eh,±k∥2→2≤1/2 for every mesh and degree; here Eh,+k=Ehk and Eh,−k=Eh,0k. Set Ah±,k=Qh±,k∣Eh,±k,Jh±,k=(Ah±,k)−1,πh±,k=Jh±,kQh±,k. These are uniformly L2-bounded projections onto their indicated spaces. They commute with d in degrees k=0,1,2 on respectively HΛk and H0Λk; the degree-three differential is zero. They are uniformly bounded in their graph norms. If hmax⁡→0, then πh±,ku→u in L2 for every L2 form, uniformly for u in any compact L2 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.

[F1]

Compactly supported smooth coefficient vectors are dense in L2 of any open set under Countable Choice (Smooth compactly supported functions of an open set are dense in L2). 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

1.1givenconstructalgebra

On each indicated finite element space the Neumann series Jh=∑j=0∞(I−Ah)j converges in operator norm, has norm at most two, and telescopes to both inverse identities. Therefore πh has norm at most 2Cϵ−3/2 and equals the identity on its target. Its range is precisely that target, so πh2=πh. For k=0,1,2, the restriction of commutation to the subcomplex gives dAhk=Ahk+1d; applying this identity to Jhkvh and multiplying by Jhk+1 gives dJhkvh=Jhk+1dvh. Consequently dπhku=πhk+1du on the stated full or relative domain in those degrees. In degree three, d=0, so the terminal commutation identity is automatic and needs no degree-four operator. The two L2 bounds give the graph-norm bound directly.

2.1F1givenstep 1.1constructalgebra

The projection identity yields ∥u−πhu∥2≤(1+∥πh∥)inf⁡vh∥u−vh∥2. For a globally smooth form u on a neighborhood of Ω‾, canonical Whitney interpolation converges in L2: subtract a constant-coefficient form on each cell, which is reproduced in every degree; the remaining coefficient has supremum at most ChKsup⁡K∣∇u∣. Its simplex moments are at most ChKk+1sup⁡K∣∇u∣, so the scaled moment norm gives ∥u−Ihu∥L2(K)≤ChK∣K∣1/2sup⁡K∣∇u∣. 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 L2, and compactly supported smooth forms are dense in relative L2, which is the same ambient L2 space. A three-term approximation and the uniform projection bound prove strong L2 convergence for every u in either case.

3.1step 1.1step 2.1algebra∎

If C is compact in L2, choose a finite δ-net {u1,…,uN} in it. For u within δ of uj, ∥(I−πh)u∥2≤(1+C)δ+∥(I−πh)uj∥2. The finite maximum tends to zero by step 2.1, and then δ↓0 proves uniform convergence on C. For u in a graph domain of degree k<3, commutation and strong convergence in degrees k,k+1 give ∥u−πhu∥2+∥du−dπhu∥2→0. In degree three the graph norm is the L2 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