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

Mesh-uniform fractional boundary flux trace

Statement

Assume Countable Choice and the fixed nonempty bounded polyhedral domain, matching shape-regular affine simplicial mesh, and Nitsche face-height convention of Symmetric and nonsymmetric Nitsche boundary forms. Let h:=max⁡KhK, ℓΩ:=diam⁡(Ω), and 1/2<s≤1. For every ζ∈H1+s(Ω), with no boundary-value or PDE assumption, (∑F∈Fh∂hF∥∂nζ∥L2(F)2)1/2≤Ch1/2∥ζ∥H1+s(Ω)=CTh1/2ℓΩ1/2∥ζ∥H1+s(Ω),CT:=CℓΩ−1/2. The trace is the restriction of the whole-space Fourier hyperplane trace and agrees with the facet trace in Fractional Bessel-potential traces on simplex facets. The constant CT may depend on the fixed domain, d, s, and the Fourier normalization, but not on the mesh.

Facts & Assumptions

Given: Countable Choice; a fixed nonempty bounded polyhedral Ω with its matching shape-regular mesh; hF=∣KF∣/∣F∣; and ζ∈H1+s(Ω) for 1/2<s≤1 in the restriction convention.

[F1]

The restriction norm is the infimum over whole-space Bessel-potential extensions, and the whole-space Hs norm is the exact weighted Fourier L2 norm (Restriction Bessel-potential spaces on polyhedral domains, Real-order Bessel-potential completion H^s, Real-order H^s as weighted Fourier distributions).

[F2]

For a whole-space Hs extension with s>1/2, the unique L2 hyperplane trace restricts on a simplex facet to the existing trace, independently of the chosen extension (Fractional Bessel-potential traces on simplex facets).

[F3]

The Fourier norm is ∥Z∥Hr(Rd)2=∫Rd⟨ξ⟩2r∣Z^(ξ)∣2 dξ (Real-order Bessel-potential completion H^s, Real-order H^s as weighted Fourier distributions).

[A1]

Countable Choice is the only choice principle assumed when selecting extensions approaching the quotient norm (The Axiom of Countable Choice (ACω)).

Proof

Given: The hypotheses and [F1]–[F3].

1.1F2F3givenchoosealgebra

The boundary of the fixed polyhedral domain lies in finitely many supporting hyperplanes P1,…,Pm. Choose any whole-space extension Z∈H1+s(Rd) of ζ. Its distributional derivative has Fourier multiplier 2πiξj; hence by [F3], ∣2πξj∣⟨ξ⟩s≤2π⟨ξ⟩1+s and ∥∇Z∥Hs2:=∑j=1d∥∂jZ∥Hs2≤(2π)2d∥Z∥H1+s2. For each Pj, choose d affinely independent points in that plane and a point off it to form a nondegenerate simplex having a facet in Pj; this only names the plane trace in [F2] and imposes no mesh condition. Apply the scalar Fourier hyperplane trace estimate in [F2] to every component ∂kZ and sum the finitely many squared inequalities. After a rigid coordinate change this gives the componentwise vector trace and ∥TPj∇Z∥L2(Pj)2:=∑k=1d∥TPj(∂kZ)∥L2(Pj)2≤Cs∥∇Z∥Hs2.

2.1F3step 1.1algebra

Group the boundary facets by their supporting planes. On a facet F⊂Pj, the scalar normal derivative is the dot product of the same plane trace with a fixed unit normal, so ∥∂nζ∥F2≤∥TPj∇Z∥L2(F)2. The boundary facets in one supporting plane have disjoint relative interiors: their relative interiors are boundary points of the polyhedral domain, and the matching mesh has disjoint cell interiors and whole-face intersections. The face-height convention gives hF≤hK/d≤h/d. Consequently ∑F∈Fh∂hF∥∂nζ∥F2≤hd∑j=1m∥TPj∇Z∥L2(Pj)2≤Ch∥Z∥H1+s(Rd)2, using step 1.1 for the last inequality.

3.1F1step 2.1A1algebra∎

For every ε>0, the restriction norm supplies an extension Zε with ∥Zε∥H1+s(Rd)≤∥ζ∥H1+s(Ω)+ε. Apply step 2.1 to Zε and let ε↓0. Taking square roots proves the first estimate; since ℓΩ>0 is fixed, writing CT=CℓΩ−1/2 gives the displayed normalization.

Source notes

The estimate groups facets by the finitely many fixed domain planes, so each whole-space hyperplane trace is counted once rather than once per mesh face. The face-height bound supplies the single factor h; no mesh-dependent facet count, zero-boundary condition, or dual PDE is used.

Depends on

Used by

Dependency tree · two levels

45 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