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

Degree-explicit polynomial trace inverse inequality on simplices

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)), as required by the affine-scaling supplier used below.

Let K be a nondegenerate d-simplex, d≥2, let F be one of its facets, and let p≥0. For every v∈Pp(K),

∥v∥L2(F)2≤(p+1)(p+d)∣F∣d∣K∣∥v∥L2(K)2.

If K belongs to a shape-regular affine simplex family with hK=diam⁡(K) and shape bound σ, then

∥v∥L2(F)2≤Cd,σ(p+1)(p+d)hK∥v∥L2(K)2.

For p≥1, the normal derivative of v has degree at most p−1 on K and satisfies the same inequalities with (p+1)(p+d) replaced by p(p+d−1). In particular, polynomial normal-flux trace penalties have the explicit scale p(p+d−1)/hK; this is an inverse trace bound, not a p-approximation or a DG coercivity theorem.

Facts & Assumptions

Given: Countable Choice, a nondegenerate simplex K, a face F, an integer p≥0, and, for the scaled inequality, a shape-regular family.

[F1]

Weighted Jacobi endpoint kernel on the reference interval: every degree-m polynomial q on [0,1] satisfies ∣q(0)∣2≤(m+1)(m+d)∫01(1−t)d−1∣q(t)∣2 dt.

[F2]

The altitude from the opposite vertex a to F is HF=d∣K∣/∣F∣, and the map x=(1−t)y+ta has volume Jacobian HF(1−t)d−1 for y∈F, 0<t<1.

[F3]

Shape regularity controls affine simplex geometry: under shape bound σ, ∣F∣/∣K∣≤Cd,σ/hK. The supplier assumes Countable Choice.

[F4]

Fubini's theorem for L^1 functions on a sigma-finite product: the simplex-pyramid parameterization in [F2] permits integrating the bounded polynomial integrand first along t and then over F.

[A1]

The mesh and polynomial-degree conventions for affine simplices are those of Variable-degree conforming hp spaces on matching affine meshes; in particular the unit normal to a flat face is constant.

Proof

1.1F1F2F4givenalgebra

Fix y∈F and let qy(t)=v((1−t)y+ta). This is a polynomial of degree at most p in t, and qy(0)=v(y). Apply [F1] with m=p, then integrate the resulting inequality over F. In the map (y,t)↦(1−t)y+ta, each tangent direction in F is scaled by 1−t, while the remaining component is the altitude HF; hence the absolute volume Jacobian is HF(1−t)d−1, as stated in [F2]. By Fubini [F4], ∥v∥L2(F)2≤(p+1)(p+d)∫F∫01(1−t)d−1∣v((1−t)y+ta)∣2 dt dSy=(p+1)(p+d)∣F∣d∣K∣∥v∥L2(K)2. This proves the exact reference-geometric inequality.

2.1A1F1F2step 1.1

The cellwise normal derivative ∂nv=nF⋅∇v is a polynomial of degree at most p−1. If p=0 it is zero. If p≥1, repeat step 1.1 with degree m=p−1; the endpoint factor becomes p(p+d−1).

3.1F3step 1.1step 2.1algebra∎

In a shape-regular family, apply [F3] to the factor ∣F∣/∣K∣ in step 1.1 and in the same argument for ∂nv. This gives both hK−1 estimates. The only declared choice assumption is the Countable Choice required by [F3]; [F4] adds no choice hypothesis, and the linewise kernel uses finite-dimensional algebra.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

18 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