Alphabeta Math
LemmaStatement: 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 derivative and face norms are controlled on a reference simplex

Statement

Assume Countable Choice. Let K∈{R,C}, S^d be the reference simplex, let P^ be a finite dimensional K-space of polynomial functions on it, let F^ be any facet, and let integer m≥0. For 1≤p,q≤∞ there is a finite constant C such that ∣v∣Wm,p(S^d)+∥v∥Lp(F^)≤C∥v∥Lq(S^d)(v∈P^). For every pair of integers 0≤m≤ℓ, there is also a finite constant C such that ∣v∣Wℓ,p(S^d)≤C∣v∣Wm,q(S^d)(v∈P^). For finitely many facets, one constant works for all of them. In particular, every linear degree-of-freedom functional on P^ is bounded with respect to the Lq(S^d) norm.

Facts & Assumptions

Given: Countable Choice; the reference simplex has nonempty interior and finite positive volume; P^ has a finite ordered basis; Sobolev norms use the finite-derivative convention of Integer-order Sobolev spaces and their norms, and degrees of freedom use Reference finite elements and unisolvent degrees of freedom.

[F1]

If a finite-dimensional real vector space V has positive dimension, choose an ordered basis and pull both norms back to Rdim⁡V. The theorem on Rn makes those pullbacks equivalent, and transporting the inequalities gives equivalence on V; the zero-dimensional case is immediate. (For n≥1 all norms on Rn are equivalent, Equivalent norms, and the dictionary with equivalent metrics)

[F2]

On every finite-dimensional complex normed space, any two complex norms are equivalent. (All norms on a finite-dimensional complex normed space are equivalent, Equivalent complex norms)

[F3]

A degree of freedom is a linear functional on the finite-dimensional polynomial space. (Reference finite elements and unisolvent degrees of freedom)

[F4]

The Sobolev-space norm convention assumes Countable Choice. (The Axiom of Countable Choice (ACω))

[F5]

The canonical open simplex and its facets are defined by Matching affine simplicial meshes and shape regularity; in particular the cell has nonempty interior and positive finite volume, and each facet is a bounded nondegenerate simplex of positive finite surface measure.

Proof

1.1F5givenalgebra

The cell expression N0(v):=∥v∥Lq(S^d) is a norm on P^. If it is zero, then for finite q the continuous polynomial vanishes almost everywhere, and for q=∞ it vanishes essentially everywhere. In either case, if it were nonzero at an interior point, continuity would make it bounded away from zero on an interior ball of positive measure, a contradiction. It therefore vanishes on the open simplex and hence is the zero polynomial, since its finite Taylor expansion at any interior point is exact.

2.1F1F2F3F4F5step 1.1algebra

If P^={0}, all displayed estimates and functional bounds hold immediately, so assume dim⁡P^>0. The expression N1(v):=∥v∥Lp(S^d)+∣v∣Wm,p(S^d)+∥v∥Lp(F^) is a norm: it is nonnegative, homogeneous and subadditive, and N1(v)=0 forces the cell Lp norm to vanish, so the preceding argument gives v=0. For real coefficients apply [F1], and for complex coefficients apply [F2], to N0 and N1; norm equivalence gives N1(v)≤CN0(v). Taking the maximum over the finitely many facets proves their uniform estimate. By [F3], any degree-of-freedom functional is linear on P^; it is bounded for N1 by finite-dimensional norm equivalence and hence by N0.

3.1F1F2step 2.1algebra∎

If P^={0}, the second estimate is immediate. If m=0, the second estimate is the derivative part of step 2.1 with its order there set to ℓ. If m≥1, let Pm−1 be the polynomials of degree at most m−1. The seminorm ∣v∣Wm,q vanishes exactly on P^∩Pm−1: every monomial of degree at least m has a nonzero derivative of order m, and every derivative of order m kills lower-degree monomials. It is therefore a norm on the finite- dimensional quotient P^/(P^∩Pm−1). If this quotient is zero, then the target seminorm vanishes on all of P^ because ℓ≥m, so the estimate is immediate. Otherwise add the target seminorm ∣v∣Wℓ,p to the quotient norm; it is well-defined because it also vanishes on P^∩Pm−1. The sum is another norm. Applying [F1] or [F2] to these two norms bounds the target seminorm by the order-m seminorm. This proves the second estimate.

Depends on

Used by

Dependency tree · two levels

50 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