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.

RT0 facet-flux unisolvence and global H(div) conformity

Statement

Assume Countable Choice and the mesh conventions of Affine simplicial meshes and RT/BDM spaces. On each d-simplex K, RT⁡0(K)={a+cx:a∈Rd,c∈R} has dimension d+1, and the d+1 integrated outward facet-normal fluxes determine its element uniquely. A piecewise RT0 field belongs to H(div⁡;D) exactly when its oriented integrated fluxes match across every shared facet; such a field belongs to H0(div⁡;D) exactly when its normal component (equivalently its integrated outward flux) also vanishes on every boundary facet.

Facts & Assumptions

Given: Countable Choice, a conforming affine simplicial mesh, and piecewise RT0 vector polynomials with the stated facet flux conditions.

[A1]

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

[F1]

RT0 on a cell is P0(K)d+xP0(K), and each simplex has d+1 facets. (Affine simplicial meshes and RT/BDM spaces)

[F2]
[F3]

On a smooth field on a simplex, the integral of its divergence equals the sum of its outward facet fluxes. (Gauss–Green formula on an affine simplex)

[F4]

H1 functions on a cell have L2 facet traces; the traces from adjacent cells agree for a global H1 function. (H1 facet trace inequality on shape-regular simplices, H1 traces agree across interior mesh facets)

[F5]

Smooth-neighborhood functions are dense in H1 of each cell. (Smooth-neighborhood density in H1 of a simplex)

[F6]

The weak normal trace on the global domain is Green duality, and H0(div) is its zero kernel. (Weak normal trace by Green duality, Zero-normal-trace H(div) space)

[F7]

The regular-distribution map is injective on Lloc1 modulo almost-everywhere equality under Countable Choice. An L2 function is locally integrable: on compact C, finite Lebesgue measure and Cauchy–Schwarz give ∫C∣h∣≤∣C∣1/2∥h∥2. (Locally integrable functions embed in distributions, Cauchy-Schwarz inequality for L2, Lebesgue measure is sigma-finite, and every metrically bounded subset of Rn has finite outer measure)

Proof

1.1A1F1F3algebra

On the reference simplex S^d={xi>0,∑ixi<1}, each coordinate facet has outward normal −ei and area 1/(d−1)!, while the top facet has outward normal (1,…,1)/d and area d/(d−1)!. For v^=a+cx, the constant-vector facet fluxes sum to zero by [F3], and the flux sum of cx is c/(d−1)!=dc∣S^d∣. If all facet fluxes vanish then c=0; the coordinate-facet fluxes then force each ai=0. The flux map is injective between spaces of dimension d+1, hence bijective.

2.1F1F2step 1.1algebra

For any physical simplex, [F2] transports the reference flux degrees of freedom bijectively, so the same unisolvence holds. On each facet, (a+cx)⋅n is constant because x⋅n is constant on its supporting hyperplane; equal integrated fluxes therefore give equal normal components.

3.1F1F3step 2.1algebra

Let v be a piecewise RT0 field with matching shared-facet fluxes. For ϕ∈Cc∞(D), apply [F3] to ϕv cellwise and sum: interior facet terms cancel by step 2.1 and the common value of ϕ, and boundary terms vanish because ϕ is compactly supported. Thus ∫Dv⋅∇ϕ=−∑K∫K(div⁡v)ϕ. The cellwise divergence is constant and in L2, so v∈H(div⁡;D) by definition.

3.2A1F3F7step 2.1constructcontradiction

Conversely, let v be a piecewise RT0 field in H(div), with global L2 divergence g. For every test supported in one cell, the global distributional identity and cellwise Gauss–Green give zero pairing with g minus that cell's polynomial divergence. This difference is in L2(K) and hence in Lloc1(K) by [F7]; extending from real to complex tests by linearity, injectivity [F7] makes the difference zero almost everywhere on the cell. For arbitrary ϕ∈Cc∞(D), summing cellwise Green formulas and comparing with the global distributional identity yields ∑F=K+∩K− interior∫Fϕ(vK+⋅nK++vK−⋅nK−)=0. Each normal sum is constant on its facet. If one were nonzero, choose a nonnegative smooth test supported in a small ball around a relative-interior point of that facet, meeting no other facet, and positive on a subpatch; the sum would be a nonzero constant times a positive surface integral, a contradiction. Hence all interior fluxes match.

4.1A1F4F5F6step 2.1step 3.1constructalgebra

Suppose the interior fluxes match. For w∈H1(D), approximate each restriction w∣K in H1 by smooth-neighborhood functions using [F5]. The trace bound [F4] and volume convergence pass cellwise Gauss–Green to each restriction. Interior traces of w agree by [F4], and the normal components of v agree by step 2.1, so interior terms cancel. If cF denotes the constant outward normal component on a boundary facet F, the resulting identity is ∫D(v⋅∇w+div⁡v w)=∑F⊂∂DcF∫FγFw. By [F6] this is the weak normal-trace functional; in particular, if every boundary flux is zero then v∈H0(div⁡;D).

5.1A1F4F6step 3.2step 4.1constructcontradiction∎

Conversely, if v∈H0(div⁡;D), its zero trace and the identity in step 4.1 give ∑F⊂∂DcF∫FγFw=0 for every w∈H1(D). For any selected boundary facet, choose a smooth function on Rd supported in a small ball about a relative-interior point of that facet, positive on a subpatch, and meeting no other boundary facet; its restriction lies in H1(D). The sum then reduces to the selected cF times a positive surface integral, so cF=0. Thus every boundary facet flux vanishes.

Depends on

Used by

Dependency tree · two levels

66 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