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.

Zero facet traces of functions in H1_0 on an affine mesh

Statement

Assume Countable Choice. Let Ω have a finite matching affine simplicial mesh Th as in Matching affine simplicial meshes and shape regularity, and let H01(Ω;R)=W01,2(Ω;R) have the closure convention of Zero-boundary Sobolev space as a norm closure and The notation Hk and the reserved zero-boundary symbol. For every boundary facet F⊂∂K there is a bounded affine-simplex trace map TK,F:W1,2(K;R)→L2(F;R) agreeing with classical restriction on smooth functions. If w∈H01(Ω;R), then TK,F(w∣K)=0 in L2(F;R). In particular, any globally H1(Ω;R) function that is polynomial on each cell and belongs to H01(Ω;R) has zero classical boundary restriction on every boundary facet.

Facts & Assumptions

Given: Countable Choice; a finite matching affine mesh; a boundary facet F of its incident cell K; and the closure-defined real space H01(Ω;R).

[F1]

On the reference simplex, restriction of smooth functions extends to a bounded linear trace map γF^:W1,2(S^d)→L2(F^) (Sobolev face traces and Gauss–Green on a reference simplex).

[F2]

Each cell is an invertible affine image of the reference simplex, and affine pullback sends W1,2(K) to W1,2(S^d) with the weak derivative and norm transformation stated in Matching affine simplicial meshes and shape regularity and Affine pullback of weak derivatives and Sobolev seminorms.

[F3]

The affine map restricts to a facet map with a positive constant surface Jacobian, so dS=JFdS^ (Gauss–Green formula on an affine simplex).

[F4]

H1(Ω;R)=W1,2(Ω;R) and H01(Ω;R) is the closure of Cc∞(Ω;R) in this Sobolev norm (The notation Hk and the reserved zero-boundary symbol, Zero-boundary Sobolev space as a norm closure, Integer-order Sobolev spaces and their norms).

[F5]

Countable Choice permits choosing one approximant for each positive integer from the nonempty sets supplied by the closure condition (The Axiom of Countable Choice (ACω)).

Proof

Given: The mesh, cell K, facet F, and hypotheses in the Statement and [F1]–[F5].

1.1F1F2F3given

Let FK(x^)=bK+AKx^ be the reference map and let w^=w∘FK. By [F2], w^∈W1,2(S^d) and its norm is bounded by a finite constant depending on AK times ∥w∥W1,2(K). The surface Jacobian JF is positive and constant by [F3]. Define TK,Fw by pullback of γF^w^; then ∥TK,Fw∥L2(F)2=JF∥γF^w^∥L2(F^)2≤JFCF^2∥w^∥W1,2(S^d)2≤CK,F2∥w∥W1,2(K)2. Thus the trace is bounded, and it agrees with ordinary restriction for smooth w by [F1].

2.1F4F5step 1.1given

Let w∈H01(Ω;R). For each m≥1, the closure property [F4] and Countable Choice [F5] give ϕm∈Cc∞(Ω;R) with ∥w−ϕm∥W1,2(Ω)<1/m. Restriction to K cannot increase this norm, so step 1.1 gives ∥TK,F(w∣K)−TK,F(ϕm∣K)∥L2(F)≤CK,F/m. The support of each ϕm is compactly contained in Ω, hence ϕm vanishes in a neighborhood of the boundary facet F and its trace is zero by step 1.1. Letting m→∞ proves TK,F(w∣K)=0.

3.1step 1.1step 2.1given∎

If p is polynomial on K, then it is smooth and step 1.1 identifies TK,F(p) with its classical restriction. Therefore for a global piecewise-polynomial p∈H01(Ω), step 2.1 makes that restriction zero on each boundary facet. This proves the final assertion.

Source notes

The zero-trace conclusion is proved from the stated closure convention and a continuous simplex trace map. No trace characterization of H01 is imported.

Depends on

Used by

Dependency tree · two levels

29 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