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

Polynomial inverse and discrete trace inequalities

Statement

Assume Countable Choice. Fix polynomial degree k≥0, 1≤p,q≤∞, and integers 0≤m≤ℓ≤k. Let the shape-regular affine simplex family be as in Matching affine simplicial meshes and shape regularity. For every cell K in that family, there is a constant independent of cell size such that, for every v∈Pk(K) and every facet F⊂∂K, ∣v∣Wℓ,p(K)≤ChKm−ℓ+d(1/p−1/q)∣v∣Wm,q(K), ∥v∥Lp(F)≤ChK(d−1)/p−d/q∥v∥Lq(K). Use 1/∞=0. Constants may depend on d,k,p,q and the family shape regularity bound, but not on K or hK.

Facts & Assumptions

Given: Countable Choice, the fixed reference simplex, a shape-regular affine mesh family, polynomial degree k, the displayed exponents, and a cell polynomial v.

[F1]

On the fixed finite-dimensional polynomial space, ∣v∣Wℓ,p≤C∣v∣Wm,q when m≤ℓ, and every facet Lp norm is bounded by the cell Lq norm, for all p,q∈[1,∞]. (Polynomial derivative and face norms are controlled on a reference simplex)

[F2]

Under an affine map, order-r Sobolev seminorms acquire factors ∥A∥r∣det⁡A∣−1/q on pullback and ∥A−1∥r∣det⁡A∣1/p on pushforward. Its oriented face area vector is det⁡(A)A−Tn^ dS^. (Affine pullback of weak derivatives and Sobolev seminorms, Gauss–Green formula on an affine simplex)

[F3]

Shape regularity gives ∥AK∥≍hK, ∥AK−1∥≍hK−1, det⁡AK≍hKd, and each facet Jacobian is comparable to hKd−1. (Shape regularity controls affine simplex geometry)

[F4]

The reference polynomial norm result [F1] uses Sobolev norms whose definition assumes Countable Choice. (The Axiom of Countable Choice (ACω))

Proof

1.1F1given

Pull v back to v^=v∘FK∈Pk(S^d). By [F1], ∣v^∣Wℓ,p≤C∣v^∣Wm,q and ∥v^∥Lp(F^)≤C∥v^∥Lq for each reference facet; finitely many facets allow one constant.

2.1F2F3F4step 1.1algebra∎

Apply the affine derivative estimates [F2] in both directions and then [F3]. For the cell inequality the total factor is bounded by ∥AK−1∥ℓ∥AK∥m∣det⁡AK∣1/p−1/q≤ChKm−ℓ+d(1/p−1/q). For the face inequality it is bounded by the physical face Jacobian to power 1/p times the inverse cell Jacobian to power 1/q, namely ChK(d−1)/p−d/q. These are the two claimed estimates.

Depends on

Used by

Dependency tree · two levels

22 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