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.

Local inverse trace bound for a polynomial normal flux

Statement

Assume Countable Choice. Fix d≥2, a degree k≥1, and a shape-regular matching affine simplicial mesh family as in Matching affine simplicial meshes and shape regularity. There is a selected constant 1≤Ctr<∞, depending only on d,k and the shape-regularity bound, such that for every cell K, every facet F⊂∂K, and every scalar vh∣K∈Pk(K), hF∥∂nK,Fvh∥L2(F)2≤Ctr2∥∇vh∥L2(K)2, where hF=∣K∣/∣F∣ and nK,F is the outward unit normal of K on F.

Facts & Assumptions

Given: Countable Choice; a shape-regular matching affine simplicial mesh; k≥1; a cell polynomial vh; a facet F; and hF=∣K∣/∣F∣.

[F1]

For every cell polynomial q of degree at most k−1, the polynomial facet trace satisfies ∥q∥L2(F)≤ChK−1/2∥q∥L2(K) (Polynomial inverse and discrete trace inequalities).

[F2]

Shape regularity gives hF≤ChK for each facet (Shape regularity controls affine simplex geometry).

[F3]

The gradient of a degree-k polynomial has components in Pk−1(K), and ∣∇vh⋅nK,F∣≤∣∇vh∣ pointwise.

[F4]

The polynomial inverse-trace theorem and the affine simplex scaling results used in [F1]–[F2] assume Countable Choice (The Axiom of Countable Choice (ACω)).

Proof

Given: Countable Choice, K,F,vh, and the bounds in [F1]–[F4].

1.1F1F3F4given

Apply [F1] to each component ∂jvh, which has degree at most k−1. Summing the d squared inequalities and using [F3] gives ∥∂nK,Fvh∥L2(F)2≤∥∇vh∥L2(F)2≤C02hK−1∥∇vh∥L2(K)2 for a finite C0 depending only on d,k and the shape bound.

2.1F2step 1.1algebrachoose

Multiply step 1.1 by hF and use hF/hK≤C from [F2]. Choose Ctr:=max⁡{1,C0C}; this is positive, finite, uniform over the family, and proves the required bound.

3.1givenstep 2.1algebra∎

If the family contains a cell, fix one of its facets and test the inequality with the affine polynomial p(x):=nK,F⋅x, which belongs to Pk(K) because k≥1. Then ∇p=nK,F and ∂nK,Fp=1, so hF∥∂nK,Fp∥F2=(∣K∣/∣F∣)∣F∣=∣K∣=∥∇p∥K2>0. Thus, for a family containing a cell, every admissible positive constant satisfies Ctr2≥1. For an empty family the bound is vacuous; in either case step 2.1 selects Ctr≥1.

Depends on

Used by

Dependency tree · two levels

13 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