Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck 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.

Boundedness and divergence commutation of RT0 interpolation

Statement

Assume Countable Choice, a shape-regular mesh with h=max⁡KhK, and Ih from Canonical RT0 interpolation on H1 fields. There is C depending only on dimension and the shape bound such that every v∈H1(D;Rd) satisfies ∥Ihv∥L2(D)≤C(∥v∥L2(D)+h∥∇v∥L2(D)),(div⁡Ihv)∣K=∣K∣−1∫Kdiv⁡v. If v∈H01(D;Rd), then Ihv∈Vh.

Facts & Assumptions

Given: Countable Choice, a shape-regular conforming mesh, and a vector field v∈H1(D;Rd).

[A1]

Countable Choice is inherited through the Sobolev trace and interpolation interfaces. (The Axiom of Countable Choice (ACω))

[F1]

IKv is the unique RT0 field with the facet moments of v; matching moments give a global H(div) field. (Canonical RT0 interpolation on H1 fields, RT0 facet-flux unisolvence and global H(div) conformity)

[F2]

The simplex trace inequality is ∥γFv∥F≤C(hK−1/2∥v∥K+hK1/2∥∇v∥K). (H1 facet trace inequality on shape-regular simplices)

[F3]

Shape regularity gives ∣K∣≍hKd, ∣F∣≍hKd−1, and each altitude comparable to hK. (Shape regularity controls affine simplex geometry)

[F4]

The Gauss–Green formula holds on smooth fields on each affine simplex. (Gauss–Green formula on an affine simplex)

[F5]

Smooth-neighborhood functions are dense in H1 on every cell, and H1_0 is the H1 closure of compactly supported smooth functions. (Smooth-neighborhood density in H1 of a simplex, Zero-boundary Sobolev space as a norm closure)

[F6]

Vh is the intersection of the global RT0 space with H0(div⁡;D). (Affine simplicial meshes and RT/BDM spaces)

[F7]

The facet moment is bounded by the product of the L2 facet norms. (Cauchy-Schwarz inequality for L2)

Proof

1.1A1F1F2F3F7algebra

Let aF be the vertex opposite facet F in K and define ϕK,F(x)=(x−aF)/(d∣K∣). On F, (x−aF)⋅nK is the altitude HF, so ∫FϕK,F⋅nK=HF∣F∣/(d∣K∣)=1 by the simplex pyramid identity d∣K∣=HF∣F∣. On any other facet, aF and x lie in its hyperplane, hence ϕK,F⋅nK=0. Thus IKv=∑F⊂∂KmK,F(v)ϕK,F, where mK,F is the outward moment. By [F2], [F7], and Cauchy–Schwarz, ∣mK,F(v)∣≤C(hK(d−2)/2∥v∥K+hKd/2∥∇v∥K). Also [F3] gives ∥ϕK,F∥K≤ChK∣K∣−1/2≤ChK1−d/2. Multiplying and summing the fixed d+1 terms proves ∥IKv∥K≤C(∥v∥K+hK∥∇v∥K). Squaring and summing cells yields the global stability estimate since hK≤h.

2.1A1F2F4F5step 1.1algebra

The divergence of IKv∈RT⁡0(K) is constant. For smooth-neighborhood approximants to v∣K from [F5], Gauss–Green [F4] says the sum of their outward facet moments equals the integral of their divergence. The trace bound [F2] and H1 convergence let both sides pass to the limit, so ∫Kdiv⁡IKv=∑F⊂∂KmK,F(v)=∫Kdiv⁡v. Dividing by ∣K∣ gives the stated cell average.

3.1A1F1F2F5F6step 2.1algebra∎

If v∈H01(D;Rd), choose compactly supported smooth vector fields converging to it in H1 by [F5]. Their boundary facet moments are zero; the trace bound [F2] passes this zero moment to v. Hence Ihv has zero boundary facet flux, and [F1] gives membership in H0(div⁡;D); [F6] then gives Ihv∈Vh.

Depends on

Used by

Dependency tree · two levels

44 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