Alphabeta Math
TheoremStatement: AI-adaptedProof: 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.

Bounded commuting projection onto the zero-normal RT0 space

Statement

Assume Countable Choice and a shape-regular mesh. Let P0 be the cellwise L2-orthogonal projection onto piecewise constants, let Sh:Qh→Vh be the stable right inverse above, and put Zh={zh∈Vh:div⁡zh=0}. There is a linear projection Πh:H0(div⁡;D)→Vh such that div⁡Πhv=P0div⁡v,∥Πhv∥H(div⁡)≤C∥v∥H(div⁡), where C depends on the domain and mesh shape bound, not mesh size. The construction uses the finite-dimensional L2-orthogonal projection onto Zh and never applies facet moments to rough H(div)-only fields.

Facts & Assumptions

Given: Countable Choice, a shape-regular mesh, and v∈H0(div⁡;D).

[A1]

Countable Choice is inherited through the H(div) and real L2 interfaces; the finite-dimensional projection is constructed below. (The Axiom of Countable Choice (ACω))

[F1]

div⁡v has zero mean, so qh:=P0div⁡v belongs to Qh; P0 is an L2 contraction and preserves the integral. (Zero mean of the divergence under zero normal trace, Cell averaging is the L2 projection onto P0)

[F2]

The right inverse obeys div⁡Shqh=qh, ∥Shqh∥2≤CR∥qh∥2, and ∥Shqh∥H(div⁡)≤CS∥qh∥2, where CS=1+CR2. (Uniform RT0/P0 divergence lift and inf-sup bound)

[F3]

Zh is finite-dimensional, since the mesh is finite and each local RT0 space has dimension d+1. Real L2 has the integral inner product used below. (L2 with the integral pairing is a Hilbert space)

[F4]

The divergencefree members of Vh are exactly the discrete kernel Zh. (The RT0/P0 discrete kernel is exactly divergence-free)

Proof

1.1A1F3constructalgebra

If Zh={0}, set PZh=0. Otherwise take a basis z1,…,zm of Zh and its Gram matrix Gij=(zj,zi)L2. For nonzero c∈Rm, cTGc=∥∑jcjzj∥22>0, so G is invertible. For any r∈L2(D;Rd), solve Gc=((r,zi)L2)i=1m and set PZhr=∑jcjzj. This is linear, and (r−PZhr,zi)L2=0 for every basis vector. Thus r−PZhr is orthogonal to Zh, PZhz=z for z∈Zh, and ∥r∥22=∥PZhr∥22+∥r−PZhr∥22 gives ∥PZhr∥2≤∥r∥2. These conclusions hold also for Zh={0}.

2.1A1F1F2F4step 1.1constructalgebra

Define qh=P0div⁡v, r=v−Shqh, and let PZh be the orthogonal projection constructed in step 1.1. Set Πhv:=Shqh+PZhr. Both terms are in Vh, and the second lies in Zh. Thus [F2] and [F4] give div⁡Πhv=qh=P0div⁡v. The cell-average map, Sh, and the orthogonal projection are linear, so Πh is linear.

3.1F2F4step 1.1step 2.1algebra

If vh∈Vh, then div⁡vh is cellwise constant, so P0div⁡vh=div⁡vh. Consequently vh−Sh(div⁡vh)∈Vh has zero divergence and lies in Zh by [F4]. Its orthogonal projection is itself; substituting in the formula of step 2.1 gives Πhvh=vh. Hence Πh is a projection.

4.1F1F2step 1.1step 2.1algebra∎

Let CS=1+CR2. Since ∥qh∥2≤∥div⁡v∥2, [F2] gives ∥Shqh∥2≤CR∥qh∥2, hence ∥r∥2≤∥v∥2+CR∥qh∥2. Also ∥PZhr∥2≤∥r∥2 and its divergence is zero. Therefore [F2] gives ∥Πhv∥H(div⁡)≤CS∥qh∥2+∥r∥2≤CS∥qh∥2+∥v∥2+CR∥qh∥2≤(1+CS+CR)∥v∥H(div⁡). This bound is uniform in mesh size. The formula uses only the L2 divergence, the discrete right inverse, and a finite-dimensional L2 projection, so no facet trace of v is used.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

35 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