Alphabeta Math
Pipeline-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.

Finite-element meshes and interpolation

1 · Prerequisites

2 · Summary

A finite face-to-face affine simplicial mesh is the setting for the interpolation and differential identities on this page. The construction fixes an orientation-preserving reference map and the diameter-to-inradius shape-regularity convention; curved cells are outside this scope. Oriented simplex chains, matching-facet cancellation, affine-simplex Gauss–Green, Sobolev extension, face traces, and Poincare–Wirtinger are established locally where the bounded C1-domain suppliers do not apply.

For conforming piecewise polynomials, equal interior traces give the weak cellwise gradient, while zero boundary facet values yield membership in the W0 closure and its Poincare estimate. Reference finite elements are stated conditionally on unisolvent, bounded degrees of freedom. Bramble–Hilbert and affine scaling give local interpolation, inverse, and discrete-trace estimates. Point-evaluation boundedness is proved for ℓ>d/p when p<∞, and for p=∞. The two-dimensional W1,2 counterexample proves unboundedness at that critical case; no other threshold cases are characterized.

The covariant and contravariant Piola maps are defined with det A>0. Their weak gradient, divergence and curl identities and normal/tangential moment transformations are proved on affine simplices. Transfer of a commuting interpolation diagram is conditional on the corresponding reference diagram, so arbitrary unisolvent elements are not asserted to commute.

3 · Logical flowchart

4 · Definitions, theorems and proofs

DefinitionDefinition: AI-adaptedProof: Not applicableOpen item page →

Matching affine simplicial meshes and shape regularity

Definition

Fix an integer d≥2. The underlying coordinate index set of Rd is Id={0,…,d−1}. In this definition the conventional labels 1≤i≤d are relabeled by i↦i−1: write x^i:=x^(i−1), and let ei∈Rd be the function on Id with ei(i−1)=1 and ei(k)=0 for k≠i−1. The vertex and barycentric labels 0,…,d are distinct from these underlying coordinate indices. The reference open simplex is S^d:={x^∈Rd:x^i>0 (1≤i≤d), ∑i=1dx^i<1}, with closure S^d‾=conv⁡{0,e1,…,ed}.

A matching affine simplicial mesh of a bounded polyhedral open set Ω⊂Rd is a finite set T of closed, nondegenerate d-simplices such that their union is Ω‾, their interiors are pairwise disjoint, Ω is the interior of their union, and the intersection of two distinct cells is either empty or a whole face of each. Thus no lower-dimensional crack is omitted from Ω while its surrounding cells are retained. Every interior facet is incident to exactly two cells and every boundary facet to one. The faces of a cell are the convex hulls of its vertex subsets. A facet means a face of dimension d−1.

For each cell K∈T, an affine bijection FK:S^d‾→K,FK(x^)=bK+AKx^, with invertible AK∈Rd×d is a reference map. Choose the vertex order so det⁡AK>0; this is the orientation convention used for Piola formulas. Write hK:=diam⁡(K) and let ρK be the radius of the largest Euclidean ball contained in K. A family {Th}h∈H is shape regular if there is a finite σ such that hK/ρK≤σ for every h∈H and K∈Th. This universal condition is vacuous for an empty family. This definition uses radius; references using the diameter of the inscribed ball differ by a factor of two.

An affine image of the reference square is a parallelogram. A general quadrilateral requires a nonaffine map and is outside this affine definition; curved-cell approximation is not included here.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Oriented simplicial cell chains and boundary

Definition

Let T be a matching simplicial mesh as in Matching affine simplicial meshes and shape regularity. Set C−1(T;Z)=0. For 0≤k≤d, let Ck(T;Z) be the free abelian group generated by ordered k-faces [v0,…,vk], with the orientation relation [vπ(0),…,vπ(k)]=sgn⁡(π)[v0,…,vk] for every permutation π. Define ∂0:C0→C−1 to be the zero map. For 1≤k≤d, define the simplicial boundary homomorphism ∂k:Ck→Ck−1 on a generator by ∂k[v0,…,vk]:=∑j=0k(−1)j[v0,…,v^j,…,vk]. This is the oriented incidence convention; no geometric integration is part of the definition. The identity ∂k−1∂k=0 is proved directly from this alternating formula in the following lemma.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The simplicial boundary of a boundary is zero

Statement

For every 1≤k≤d, the boundary maps of Oriented simplicial cell chains and boundary satisfy ∂k−1∘∂k=0.

Facts & Assumptions

Given: An oriented simplicial mesh and its alternating boundary maps.

[F1]

An oriented generator has boundary ∂k[v0,…,vk]=∑i=0k(−1)i[v0,…,v^i,…,vk], extended linearly. (Oriented simplicial cell chains and boundary)

Proof

1.1F1given

If k=1, then ∂k−1=∂0=0 by the definition, so the double boundary vanishes. Now let k≥2 and fix an oriented generator [v0,…,vk]. In ∂k−1∂k[v0,…,vk], a codimension-two face is obtained by deleting a unique pair of vertices with indices i<j. Deleting i first contributes coefficient (−1)i(−1)j−1 because the original index j shifts down by one; deleting j first contributes (−1)j(−1)i.

2.1step 1.1algebra∎

The sum of those two coefficients is (−1)i+j−1+(−1)i+j=0. Every codimension-two face arises from exactly these two deletion orders, so every basis coefficient in the double boundary is zero. The double boundary therefore vanishes on each generator and, by linearity, on all of Ck.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Broken and conforming polynomial spaces on a matching mesh

Definition

Let T be a matching affine simplicial mesh of Ω as defined in Matching affine simplicial meshes and shape regularity. Fix k∈N0, K∈{R,C}, and an integer q≥1. On each cell let Pk(K;Kq) denote the restrictions to K of Kq-valued polynomials of total degree at most k. The broken polynomial space is the finite product Vhbr:=∏K∈TPk(K;Kq), viewed as functions defined almost everywhere cell by cell. For an interior facet F=K∩K′, the jump is the difference of the two polynomial traces, with either fixed ordering of K,K′; its vanishing is independent of that ordering. The conforming polynomial space is Vhconf:={v∈Vhbr:v∣F,K=v∣F,K′ on every interior facet F}. The zero-boundary subspace consists of those v∈Vhconf whose polynomial trace is zero on every boundary facet. These are algebraic definitions. The Sobolev inclusions and the zero-boundary closure conclusion are proved separately in the corresponding local theorems on matching piecewise polynomials and zero-boundary values. If T=∅, then Ω=∅ by the mesh definition; the empty product is the zero vector space consisting of the unique empty function, and the trace conditions are vacuous.

DefinitionDefinition: Literature-sourcedProof: Not applicableOpen item page →

Reference finite elements and unisolvent degrees of freedom

Definition

Let d≥1, let K^⊂Rd be a nonempty bounded open reference cell, let q≥1 be an integer, and let K∈{R,C}. A reference finite element is a triple (K^,P^,Σ^) where P^ is an N-dimensional subspace of [C(K^‾;K)]q for N∈N0 and Σ^=(σ^1,…,σ^N) is a list of linear functionals on P^ for which JΣ^:P^→KN,JΣ^(p):=(σ^1(p),…,σ^N(p)), is bijective. The functionals are the degrees of freedom and the triple is unisolvent. Its shape functions are the unique dual basis ϕ^1,…,ϕ^N∈P^ satisfying σ^i(ϕ^j)=δij.

If X is a normed vector space of functions on K^ containing P^, fix for each i a bounded linear extension of σ^i to X, and denote this chosen extension by the same symbol. The reference interpolation operator associated with these chosen extensions is I^:X→P^,I^v:=∑i=1Nσ^i(v)ϕ^i. The definition of a reference finite element does not assert that any particular list of functionals is unisolvent or bounded on a given Sobolev space; those are separate proof obligations. For N=0, P^={0}, K0={0}, the empty list gives the unique bijection between these zero spaces, and the shape-function list is empty. The corresponding interpolation formula is the empty sum, hence the zero map into {0}.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Unisolvent degrees of freedom define a unique reference interpolant

Statement

Let (K^,P^,Σ^) be a reference finite element with N=dim⁡P^, dual shape functions ϕ^i, and bounded extensions of its degrees of freedom to a normed function space X containing P^. Then the operator I^v:=∑i=1Nσ^i(v)ϕ^i is the unique linear map X→P^ satisfying σ^i(I^v)=σ^i(v) for every i, and I^p=p for every p∈P^.

Facts & Assumptions

Given: The reference finite-element convention of Reference finite elements and unisolvent degrees of freedom and an input v∈X on which every degree of freedom is defined.

[F1]

The degree-of-freedom map JΣ^:P^→KN is bijective, and the shape functions satisfy σ^i(ϕ^j)=δij. (Reference finite elements and unisolvent degrees of freedom)

Proof

1.1F1given

If N=0, then P^={0} and the empty sum defines the unique linear map X→P^; all degree-of-freedom identities are vacuous and reproduction holds for the sole element p=0. For N≥1, define I^v=∑i=1Nσ^i(v)ϕ^i. The sum is finite and each coefficient is linear in v, so I^ is a well-defined linear map into P^. Applying the jth degree of freedom gives σ^j(I^v)=∑iσ^i(v)σ^j(ϕ^i)=σ^j(v) by [F1].

2.1F1step 1.1∎

If p∈P^, then both p and I^p have the same degree-of-freedom vector, by step 1.1; injectivity of JΣ^ therefore gives I^p=p. If another J:X→P^ has the same degree-of-freedom values, then JΣ^(Jv−I^v)=0, and injectivity again gives Jv=I^v. This proves uniqueness.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

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.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Affine pullback of weak derivatives and Sobolev seminorms

Statement

Assume Countable Choice. Let F(x^)=Ax^+b be an affine bijection from a bounded open set K^⊂Rd to K, where A is invertible, and let 1≤p≤∞. For every integer r≥0 and scalar v∈Wr,p(K), the pullback v^:=v∘F belongs to Wr,p(K^). For r≥1 its first weak derivatives satisfy Dx^jv^=∑i=1dAij(Dxiv)∘F, and higher derivatives are obtained by applying this constant-matrix rule repeatedly. In particular, for each 0≤m≤r, ∣v^∣Wm,p(K^)≤C(d,m)∥A∥m∣det⁡A∣−1/p∣v∣Wm,p(K), where ∣det⁡A∣−1/p:=1 for p=∞. The reverse estimate holds with A−1 and ∣det⁡A∣1/p in place of A and ∣det⁡A∣−1/p.

Facts & Assumptions

Given: Countable Choice; the affine bijection F; an exponent 1≤p≤∞; and v∈Wr,p(K).

[F1]

A weak derivative is characterized by ∫KvDαϕ=(−1)∣α∣∫K(Dαv)ϕ for all compactly supported smooth tests. (Weak derivative of a locally integrable function, Integer-order Sobolev spaces and their norms)

[F2]

For a C1 diffeomorphism, nonnegative Lebesgue-measurable integrands obey the change-of-variables formula with ∣det⁡DF∣; Countable Choice is an explicit hypothesis. (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)

[F3]

A is constant, so the classical chain rule for a test function is Dx^j(ϕ∘F)=∑iAij(Dxiϕ)∘F. (The chain rule for differentials of smooth maps)

[F4]

For finite p, ∥g∘F∥Lp(K^)=∣det⁡A∣−1/p∥g∥Lp(K) by [F2]; for p=∞ the essential-supremum norm is preserved by a C1 bijection and its inverse, which map null sets to null sets. (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)

[F5]

The cited change-of-variables theorem assumes Countable Choice. (The Axiom of Countable Choice (ACω))

Proof

1.1F1F2F3F4F5given

If K^=∅, then K=∅ and each Sobolev space on these measure-zero domains has only the zero class; every displayed derivative identity and estimate is therefore zero equals zero. Otherwise, if r=0, the only derivative is order zero and [F4] gives ∥v∘F∥Lp(K^)=∣det⁡A∣−1/p∥v∥Lp(K), with the stated convention at p=∞. Thus the membership and pullback estimate hold in this case. For r≥1, fix j and ψ∈Cc∞(K^). Set ϕ:=ψ∘F−1∈Cc∞(K). By [F1], v and its weak first derivatives have locally integrable representatives, so vDxiϕ and (Dxiv)ϕ are integrable: the test factors are bounded and compactly supported. For an integrable real product g on K, apply [F2] separately to its nonnegative parts g+ and g−; both integrals are finite, and the constant ∣det⁡A∣>0 makes the corresponding pullback integrals finite. Subtracting their two formulas gives ∫K^g∘F=∣det⁡A∣−1∫Kg. For a complex product, apply this argument to its real and imaginary parts and combine their integrals componentwise; the weak test pairing remains bilinear, without conjugation. Changing variables by [F2] and using [F3] gives ∫K^(v∘F)Dx^jψ dx^=∣det⁡A∣−1∑iAij∫KvDxiϕ dx=−∣det⁡A∣−1∑iAij∫K(Dxiv)ϕ dx=−∑iAij∫K^((Dxiv)∘F)ψ dx^. Thus the displayed first-derivative formula holds weakly; its right side is in Lp by [F4].

2.1F3F4F5step 1.1algebra∎

For r≥1, since A is constant, differentiating the first formula weakly again applies the same rule to each Dxiv; induction on m gives every derivative of order m≤r as a sum of at most dm terms, each with a product of m entries of A multiplying a pullback of an order-m derivative of v. Taking component Lp norms and using [F4] yields the stated seminorm bound, with a finite combinatorial constant depending on d,m. Applying the proved estimate to F−1(x)=A−1(x−b) gives the reverse bound. Together with step 1.1 this includes r=0 and proves both directions.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Shape regularity controls affine simplex geometry

Statement

Assume Countable Choice. Let FK(x^)=bK+AKx^ map the fixed reference simplex S^d bijectively to a cell K of a shape-regular family, and let hK be its diameter and ρK its inradius. There are constants c,C>0, depending only on d, the reference simplex, and the shape regularity bound, such that chK≤smin⁡(AK)≤∥AK∥≤ChK,chKd≤det⁡AK≤ChKd. For each facet F, its affine surface Jacobian is comparable to hKd−1, and its altitude from the opposite vertex is comparable to hK. Thus Sobolev scaling constants can be expressed using hK alone, with constants uniform over the family.

Facts & Assumptions

Given: A nondegenerate affine simplex map, a fixed reference simplex, and the shape regularity bound hK/ρK≤σ.

[F1]

The reference simplex is fixed, with diameter DwidehatS<∞ and inradius rwidehatS>0; hK is the diameter and ρK the inradius of K. (Matching affine simplicial meshes and shape regularity)

[F2]

The oriented area element of an affine facet is n dS=det⁡(AK)AK−Tn^ dS^, so its surface Jacobian is JF=det⁡(AK)∣AK−Tn^∣ when det⁡AK>0. Affine Sobolev seminorms transform with the corresponding powers of AK and AK−1. (Gauss–Green formula on an affine simplex, Affine pullback of weak derivatives and Sobolev seminorms)

[F3]

The two affine change-of-variables suppliers used in [F2] assume Countable Choice. (The Axiom of Countable Choice (ACω))

Proof

1.1F1givenalgebra

Use a singular-value decomposition AK=UΣVT. If vmax⁡ is a unit right singular vector for smax⁡=∥AK∥, the reference inscribed ball contains two points separated by 2rS^vmax⁡; their images are separated by 2rS^smax⁡. Thus smax⁡≤hK/(2rS^). For a unit right singular vector vmin⁡ and corresponding left vector umin⁡, the width of K in direction umin⁡ equals smin⁡ times the width of the reference simplex in direction vmin⁡, which is at most smin⁡DS^. Every ball of radius t<ρK contained in K has width 2t in every direction, so letting t↑ρK gives 2ρK≤smin⁡DS^. Since hK/ρK≤σ, smin⁡≥2hK/(σDS^).

2.1step 1.1givenalgebra

Every singular value lies between chK and ChK by step 1.1. Their product is ∣det⁡AK∣=det⁡AK because the reference map is orientation preserving. Hence c′hKd≤det⁡AK≤C′hKd.

3.1F2F3step 1.1step 2.1algebra∎

For a reference facet normal n^, [F2] gives its physical surface Jacobian JF=det⁡(AK)∣AK−Tn^∣. The singular values of AK from step 1.1 are between chK and ChK, so ∣AK−Tn^∣ is between chK−1 and ChK−1. Together with the determinant bounds this gives chKd−1≤JF≤ChKd−1. The simplex pyramid identity ∣K∣=∣F∣HF/d gives HF=d∣K∣/∣F∣, so step 2.1 and these facet bounds show chK≤HF≤ChK. This proves all claimed geometric scalings.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Interior facet orientations cancel in a matching mesh

Statement

Orient every top-dimensional cell of a matching simplicial mesh by the ambient orientation of Rd, and orient each facet by the induced boundary convention of Oriented simplicial cell chains and boundary. In the sum of the oriented boundaries of all top-dimensional cells, every interior facet occurs twice with opposite signs; every boundary facet occurs once.

Facts & Assumptions

Given: A finite face-to-face triangulation of a polyhedral domain, with each interior facet incident to two cells and each boundary facet to one.

[F1]

A matching mesh is face-to-face: a shared facet is a whole facet of both cells. (Matching affine simplicial meshes and shape regularity)

[F2]

The oriented boundary of an ordered simplex is the alternating sum of its codimension-one faces. (Oriented simplicial cell chains and boundary)

Proof

1.1F1given

Let F be an interior facet. Its two incident simplex interiors lie on opposite sides of the affine hyperplane containing F; otherwise their interiors would overlap near a relative-interior point of F, contradicting the mesh definition. Therefore the two outward unit normals along F are opposites.

2.1F2step 1.1given∎

The boundary orientation is defined by the condition that the outward normal followed by an oriented basis of the facet gives the ambient cell orientation. Replacing the outward normal by its negative reverses the induced facet orientation. Hence the two contributions of F in the cell boundary sum have opposite signs and cancel. A boundary facet has one incident cell, so it appears once with its induced boundary orientation.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Gauss–Green formula on an affine simplex

Statement

Assume Countable Choice. Let K be a nondegenerate affine d-simplex and let G∈C1(K‾;Rd). If nK,F is the outward unit normal on each facet F, then ∫Kdiv⁡G dx=∑F⊂∂K∫FG⋅nK,F dS. For an orientation-preserving affine map FK(x^)=b+Ax^, the oriented area element transforms as nK,F dS=det⁡(A)A−Tn^F^ dS^.

Facts & Assumptions

Given: Countable Choice, a nondegenerate affine simplex K, its fixed reference simplex, and a continuously differentiable vector field on K‾.

[F1]

The reference open simplex is {x^i>0, ∑ix^i<1}; every physical cell is its affine image. (Matching affine simplicial meshes and shape regularity)

[F2]

For affine maps, weak derivatives transform by the constant Jacobian chain rule, and volume measure transforms by ∣det⁡A∣. (Affine pullback of weak derivatives and Sobolev seminorms)

[F3]

The one-dimensional fundamental theorem of calculus gives ∫abf′(t) dt=f(b)−f(a) for a continuously differentiable vector-valued function. (If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz)

[F4]

Fubini's theorem permits iterated integration of the continuous bounded functions on the bounded simplex used below. (Tonelli and Fubini for the completed product, with only almost-everywhere section measurability)

[F5]

A C1 diffeomorphism obeys Lebesgue change of variables with the absolute determinant. For the bounded integrands here, apply the nonnegative formula separately to positive and negative parts. (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)

[F6]

The cited change-of-variables theorem assumes Countable Choice. (The Axiom of Countable Choice (ACω))

Proof

1.1F1F3F4givenalgebra

First take S^d. Fix i and write y=(x^j)j≠i, where yj>0 and ∑j≠iyj<1. The ith coordinate ranges from 0 to g(y):=1−∑j≠iyj. By [F3], ∫0g(y)∂iGi(y,t) dt=Gi(y,g(y))−Gi(y,0). Integrating in y and using [F4] gives the volume integral of ∂iGi as the difference of these two graph integrals. The lower graph is the coordinate facet with outward normal −ei and area factor 1, hence its flux contribution is −Gi(y,0). The upper facet is the graph x^i=1−∑j≠ix^j: its tangent Gram matrix is Id−1+11T, whose eigenvalues are 1 (multiplicity d−2) and d, so its area factor is d. Its outward unit normal is d−1/2(1,…,1), so the ith component of normal times area factor is 1. Thus the upper graph integral is exactly its ith flux contribution. Other coordinate facets have zero ith normal component. Summing over i accounts for every component of the boundary flux and proves the formula on S^d.

1.2F1givenalgebra

Let τ^1,…,τ^d−1 be an oriented tangent basis for a reference facet, with orientation chosen so its oriented area vector is n^ dS^. By the determinant definition of oriented area vector, for every w∈Rd, w⋅(nK,F dS)=det⁡(Aτ^1,…,Aτ^d−1,w)=det⁡(A)det⁡(τ^1,…,τ^d−1,A−1w)=w⋅(det⁡(A)A−Tn^ dS^). Equality against every w gives the cofactor area-vector formula. Because det⁡A>0, A−Tn^ points to the exterior side corresponding to n^, so the formula has the outward orientation.

2.1F2F5F6step 1.1step 1.2algebra∎

Define G^(x^):=det⁡(A)A−1G(b+Ax^). The chain rule gives div⁡x^G^=det⁡(A)∑j,i,l(A−1)ji(∂xlGi)(F(x^))Alj=det⁡(A)(div⁡xG)(F(x^)), since ∑jAlj(A−1)ji=δli. Applying the reference identity of step 1.1 to G^, and using [F5] to change variables in its bounded volume integrand, gives the physical volume integral. On each facet, step 1.2 gives G^⋅n^ dS^=G(F(x^))⋅det⁡(A)A−Tn^ dS^=G⋅nK,F dS. Summing the facet identities proves the stated Gauss–Green formula on K.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Smooth functions are dense in finite-order Sobolev spaces on a reference simplex

Statement

Assume Countable Choice. Let d≥2, k∈N0, 1≤p<∞, and let S^d be the reference simplex. Then restrictions of functions smooth on a neighbourhood of S^d‾ are dense in Wk,p(S^d) in its Sobolev norm. No density assertion for p=∞ is made.

Facts & Assumptions

Given: The affine reference simplex and Sobolev conventions of Matching affine simplicial meshes and shape regularity and Integer-order Sobolev spaces and their norms, with finite p and Countable Choice.

[F1]

For an invertible affine map F(x)=Ax+b, weak derivatives obey Dj(u∘F)=∑iAij(Diu)∘F; higher derivatives follow by iterating this constant-matrix rule, with the corresponding determinant norm factors. For a homothety with A=tI, this gives Dα(u∘F)=t∣α∣(Dαu)∘F. (Affine pullback of weak derivatives and Sobolev seminorms)

[F2]

For finite p, Cc∞(Rd) is dense in Wk,p(Rd); in particular its order-zero case gives density in Lp(Rd). (Compactly supported smooth functions are dense in W^{k,p}(R^n))

[F3]

Smooth cutoffs equal to one near a compact subset of an open set exist; multiplication by a smooth function with bounded derivatives preserves Wk,p; and a compactly supported Wk,p function on an open set extends by zero to Rd. (Test function cutoffs and euclidean localization, Weak Leibniz rule with a smooth factor, Compactly supported Sobolev functions extend by zero in every integer order)

[F4]

Countable Choice is the explicit assumption in the cited Sobolev, weak-derivative and density interfaces. (The Axiom of Countable Choice (ACω))

Proof

1.1F1givenalgebra

Let a be the barycenter of S^d and, for 0<t<1, set Ft(x)=a+t(x−a). The set St:=Ft−1(S^d) is open and contains S^d‾: each point of the closure is carried to a strict convex combination of that point and the interior point a, which lies in the open simplex. Thus ut:=u∘Ft is defined on St for u∈Wk,p(S^d), and [F1] gives Dαut=t∣α∣(Dαu)∘Ft.

2.1F1F2step 1.1given

For every g∈Lp(S^d), g∘Ft→g in Lp(S^d) as t↑1. To see this, extend g by zero to Rd and approximate that extension in Lp by ϕ∈Cc∞(Rd) using [F2]. For t≥1/2, change of variables bounds the pullback error by t−d/p∥g−ϕ∥Lp(Rd)≤2d/p∥g−ϕ∥p; for fixed ϕ, uniform continuity on the compact closure gives ϕ∘Ft→ϕ uniformly there. First choosing ϕ with arbitrarily small error and then taking t↑1 proves the claim. Applying it to each of the finitely many Dαu and using [F1] shows ut∣S^d→u in Wk,p(S^d).

2.2F2F3step 1.1

Fix t<1. Since S^d‾ is compactly contained in St, choose η∈Cc∞(St) equal to one near that closure by [F3]. Then ηut∈Wk,p(St) has compact support in St, so its zero extension Ut belongs to Wk,p(Rd) by [F3]. By [F2], choose ϕj∈Cc∞(Rd) converging to Ut in that norm. Since Ut=ut on a neighbourhood of the closed simplex, the restrictions ϕj∣S^d converge to ut∣S^d in Wk,p(S^d).

3.1F4step 2.1step 2.2algebra∎

Given ε>0, choose t close enough to one that ∥ut−u∥Wk,p(S^d)<ε/2 by step 2.1, and then choose j in step 2.2 with ∥ϕj−ut∥Wk,p(S^d)<ε/2. The triangle inequality gives ∥ϕj−u∥Wk,p(S^d)<ε. The choices are finite for each u,ε; Countable Choice is only the declared background of [F4], and no p=∞ density is used.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

A reference simplex is an integer-order Sobolev extension domain

Statement

Assume the Axiom of Choice. Let d≥2. For every integer k≥0 and 1≤p≤∞, there is a bounded linear operator Ek,p:Wk,p(S^d)⟶Wk,p(Rd) whose restriction to S^d is the input class. Consequently S^d is a Wk,p-extension domain in the sense of Sobolev extension domains and extension operators. The operator may be chosen with support in one fixed bounded set.

Facts & Assumptions

Given: d≥2, the reference simplex, k∈N0, 1≤p≤∞, and the Axiom of Choice.

[F1]

Affine pullback and pushforward preserve Wk,p, with weak derivatives and norm bounds controlled by the fixed affine matrix. (Affine pullback of weak derivatives and Sobolev seminorms)

[F2]

On a half-space, for every integer k and p there is an explicit bounded extension built from finitely many reflected values; its coefficients satisfy ∑jaj(−j)r=1 for 0≤r<k, so normal derivatives through order k−1 match at the reflecting hyperplane. Its proof verifies the weak derivative identity by ACL sections, integration by parts and Fubini, and gives a bound depending only on k,p,d. (Integer-order Sobolev extension from a half-space)

[F3]

Smooth cutoffs with compact support in a prescribed chart exist; the weak Leibniz rule bounds localized Sobolev norms; and a function supported away from the artificial edge of an open chart can be extended by zero across that edge by the weak test identity. (Test function cutoffs and euclidean localization, Weak Leibniz rule with a smooth factor, Compactly supported Sobolev functions extend by zero in every integer order)

[F5]

The Axiom of Choice implies each finite sequence of affine charts, cutoffs and local extension maps needed below can be selected; the local half-space extension theorem itself assumes this axiom. (The Axiom of Choice)

[F6]

A Wk,p-extension domain admits a bounded linear operator to Wk,p(Rd) whose restriction is the input almost-everywhere class. (Sobolev extension domains and extension operators)

Proof

1.1givenalgebra

Let z∈S^d‾. Define the barycentric affine coordinates by λ0(x)=1−∑i=1dxi and λi(x)=xi for 1≤i≤d; they sum to one and are nonnegative exactly on the closed simplex. The active set I(z)={i:λi(z)=0} has at most d elements, and the gradients of the corresponding coordinates are linearly independent. Complete these affine coordinates to an invertible affine coordinate system y=(λi)i∈I(z),ym+1,…,yd, where m=∣I(z)∣. Because every inactive barycentric coordinate is strictly positive at z, a sufficiently small neighbourhood Uz meets the simplex exactly in the orthant chart y1>0,…,ym>0; for m=0 it is an interior chart.

2.1F3F4step 1.1

The charts Uz cover the compact closure, so [F4] gives a finite subcover. Shrink them to open sets Vj still covering the closure, with V‾j⊂Uj. Use [F3] to choose smooth cutoffs θj supported compactly in Uj and equal to one on Vj. Their sum S is positive on a neighbourhood N of the closed simplex. Choose a smooth cutoff χ supported compactly in N and equal to one near the closed simplex, and set ηj=χθj/S on N, zero outside N. Then each ηj is smooth and supported in its chart, and their sum is one near the simplex. Each localized input ηju has norm bounded by a fixed multiple of ∥u∥Wk,p(S^d) by the product rule in [F3].

3.1F3step 2.1

In an interior chart, the localized function is zero near the chart edge. Its zero extension to Rd has the same weak derivatives: for any test function, multiply that test by a cutoff equal to one on the localized support, apply the weak identity on the chart, and note that all derivatives of the cutoff product agree on that support. This is the zero-extension part of [F3]. In a boundary chart with m active faces, the localized function is a Wk,p function on the orthant Om=(0,∞)m×Rd−m and vanishes near the artificial edge of the chart; extend by zero across only that artificial edge using the same test-function argument.

4.1F1F2step 3.1

Extend from Om to Rd one coordinate at a time. At each stage, apply the reflected half-space formula in [F2] to the coordinate being extended, with the other m−1 positive coordinates as tangential variables. For clarity, the coordinate formula on t<0 is ∑j=1kajw(x′,−jt), with ∑jaj(−j)r=1 for 0≤r<k; for k=0 use even reflection. For a test compactly supported in Om−1×R, apply the half-space proof's normal ACL trace and integration-by-parts identity on each compact tangential subdomain and then exhaust the test support by finitely many such subdomains. Tangential weak derivatives pass through the finite reflection sum by the weak test identity, and the displayed moment equations cancel every normal interface term. The change of variable s=−jt bounds each reflected derivative in Lp by the same finite coefficient sum as in [F2] (and by the corresponding essential supremum sum at p=∞). Thus this explicit operator is bounded on Wk,p(Om) and extends one orthant coordinate. Repeating at most m≤d times gives the required extension. Pulling back through the affine chart changes the bound by a finite factor from [F1].

5.1F5F6step 2.1step 4.1∎

Apply these local bounded linear extensions to the finitely many localized pieces and add them. Their sum is bounded and linear, and on S^d its restriction is ∑jηju=u. There are finitely many charts, all have bounded coordinate images and the reflection operators add support only by fixed finite factors, so the sum is supported in a fixed bounded set. The definition of extension domain in [F6] gives the conclusion.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Sobolev face traces and Gauss–Green on a reference simplex

Statement

Assume Countable Choice. Let 1<p<∞ and p′=p/(p−1). For each facet F of S^d, restriction of smooth functions extends uniquely to a bounded linear trace map γF:W1,p(S^d;R)→Lp(F;R). For real-valued u∈W1,p(S^d) and G∈W1,p′(S^d;Rd), the facet traces satisfy ∫S^du div⁡G+∇u⋅G dx=∑F⊂∂S^d∫FγFu γFG⋅n^F dS. Here γFG is the componentwise trace and n^F is the outward unit normal. The bounded C1-domain trace and Green theorems are not used for the simplex.

Facts & Assumptions

Given: Countable Choice, the reference simplex, 1<p<∞, and the Sobolev spaces specified in Integer-order Sobolev spaces and their norms.

[F1]

Smooth functions on a neighbourhood of the closed simplex are dense in W1,q(S^d) for every finite q. (Smooth functions are dense in finite-order Sobolev spaces on a reference simplex)

[F2]

For C1 vector fields on a nondegenerate affine simplex, the divergence integral equals the sum of outward facet fluxes. (Gauss–Green formula on an affine simplex)

[F3]

The spaces Lp(F) are complete for finite p, and Holder's inequality gives ∥fg∥L1(F)≤∥f∥Lp(F)∥g∥Lp′(F). (Riesz-Fischer completeness of Lp for 1≤p≤∞, Holder's inequality for integrals, including the endpoint cases)

[F4]

The smooth-density supplier [F1] assumes Countable Choice. (The Axiom of Countable Choice (ACω))

Proof

1.1F2F3givenalgebra

Fix a facet F opposite the vertex zF, let HF>0 be the altitude from zF to F, and put X(x)=x−zF. On F, X⋅n^F=HF; on every other facet, which contains zF, X is tangent, so its normal component is zero. For a smooth scalar u, apply [F2] to ∣u∣pX. Since p>1, ∣u∣p is continuously differentiable, and ∣X∣≤diam⁡(S^d); hence HF∫F∣u∣p dS≤d∫S^d∣u∣p dx+pdiam⁡(S^d)∫S^d∣u∣p−1∣∇u∣ dx. Holder bounds the last integral by ∥u∥pp−1∥∇u∥p. For a=∥u∥p and b=∥∇u∥p, if b≤a then ap−1b≤ap, while if a≤b then ap−1b≤bp. Thus the product is at most ap+bp. Since HF>0, the resulting inequality gives ∥u∥Lp(F)≤CF,p∥u∥W1,p(S^d).

2.1F1F3step 1.1

Let (uj) be a smooth sequence converging to u in W1,p(S^d), which exists by [F1]. Applying the estimate of step 1.1 to uj−ui shows (uj∣F) is Cauchy in the complete space Lp(F); define γFu to be its limit. The same estimate shows the limit is independent of the chosen smooth approximating sequence and ∥γFu∥Lp(F)≤C∥u∥W1,p. Linearity follows by taking approximating sequences for sums and scalar multiples.

3.1F1F2F3F4step 2.1∎

For smooth u,G, apply [F2] to the vector field uG. Its divergence is ∇u⋅G+udiv⁡G, so the displayed Green identity holds with ordinary restrictions. Choose smooth approximations uj→u in W1,p and Gj→G componentwise in W1,p′ by [F1]. By step 2.1 their facet traces converge in Lp and Lp′; Holder [F3] makes the boundary products converge in L1(F). The volume products converge in L1 by Holder and convergence of both Sobolev norms. Passing to the limit in the smooth identity proves the formula for u,G.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Continuous matching piecewise polynomials belong to W1p

Statement

Assume Countable Choice. Let T be a finite matching affine simplicial mesh of a bounded polyhedral open set Ω, let 1≤p≤∞, and let v be a real-valued scalar member of the conforming piecewise-polynomial space in Broken and conforming polynomial spaces on a matching mesh. Then v∈W1,p(Ω). Its weak gradient agrees almost everywhere on each cell with the ordinary cellwise polynomial gradient.

Facts & Assumptions

Given: Countable Choice, a finite matching mesh, v polynomial on each cell with equal polynomial traces across every interior facet, 1≤p≤∞, and φ∈Cc∞(Ω).

[F1]

The conforming condition is equality of the two polynomial traces on each whole interior facet. (Broken and conforming polynomial spaces on a matching mesh)

[F2]

A C1 field on a simplex satisfies the cellwise Gauss–Green formula. (Gauss–Green formula on an affine simplex)

[F3]

The two outward normals on an interior matching facet are opposite, so its oriented contributions cancel when cell boundaries are summed. (Interior facet orientations cancel in a matching mesh)

[F4]

A weak first derivative is characterized by integration against compactly supported smooth tests, and W1,p consists of Lp classes whose weak first derivatives lie in Lp. (Weak derivative of a locally integrable function, Integer-order Sobolev spaces and their norms)

[F5]

Countable Choice is the explicit background assumption in the Sobolev-space definition. (The Axiom of Countable Choice (ACω))

Proof

1.1F2given

If T=∅, then Ω=∅ by the mesh definition; v is the unique zero class in W1,p(Ω) and the cellwise-gradient assertion has no cells. Assume now T≠∅. The mesh is finite and each cellwise polynomial and its ordinary first derivatives are bounded on the closed cell. Thus v and the piecewise function gi=∂i(v∣K) belong to Lp(Ω) for every 1≤p≤∞. Fix a coordinate i and a test function φ∈Cc∞(Ω). On each cell apply [F2] to G=(vφ)ei to obtain ∫Kv ∂iφ dx=−∫Kgiφ dx+∑F⊂∂K∫Fvφ(nK,F)i dS.

2.1F1F3F4F5step 1.1∎

Sum these finitely many identities over K. On an interior facet, [F1] gives a common trace for vφ and [F3] gives opposite outward normals, so the two flux integrals cancel. On a boundary facet, φ=0 because its support is compact in Ω. Therefore ∫Ωv ∂iφ dx=−∫Ωgiφ dx. By [F4], gi is the weak ith derivative. This holds for every coordinate i; all gi are in Lp, so v∈W1,p(Ω) with the stated cellwise gradient.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare

Statement

Assume Countable Choice. Let Ω be a bounded polyhedral open set with a finite matching affine simplicial mesh, let 1≤p<∞, and let v be a real-valued conforming piecewise polynomial whose polynomial trace vanishes on every boundary facet. Then v∈W01,p(Ω),∥v∥Lp(Ω)≤CΩ∥∇v∥Lp(Ω). Here W01,p is the norm closure of Cc∞(Ω); no C1 trace characterization is used.

Facts & Assumptions

Given: Countable Choice, the finite matching mesh, the conforming and zero-boundary conditions, bounded Ω, and finite p.

[F1]

On each simplex, a C1 vector field satisfies the cellwise Gauss–Green formula. (Gauss–Green formula on an affine simplex)

[F2]

The mesh is the interior of the union of its cells, so each boundary component of a local simplicial link reaches an exterior facet. Equal polynomial traces and opposite facet orientations cancel interior fluxes; the zero-boundary condition makes every exterior facet trace zero. (Matching affine simplicial meshes and shape regularity, Broken and conforming polynomial spaces on a matching mesh, Interior facet orientations cancel in a matching mesh)

[F3]

The zero-boundary space is precisely the norm closure of Cc∞(Ω) in W1,p(Ω). (Zero-boundary Sobolev space as a norm closure)

[F4]

If Ω is bounded in one direction, every w∈W01,p(Ω) satisfies ∥w∥Lp≤C(p)(b−a)∥∇w∥Lp for a slab of width b−a and 1≤p<∞. (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction)

[F5]

Compactly supported Sobolev functions extend by zero, and compactly supported W1,p(Rd) functions can be approximated by smooth compactly supported functions. Smooth cutoffs and the weak product rule are available. (Compactly supported Sobolev functions extend by zero in every integer order, Compactly supported smooth functions are dense in W^{k,p}(R^n), Test function cutoffs and euclidean localization, Weak Leibniz rule with a smooth factor)

[F6]

A decreasing sequence of measurable subsets of a finite-measure set has measures tending to the measure of its intersection. (Continuity from above when one set has finite measure)

[F7]

The Sobolev class and its norm use the weak-derivative and Lp conventions of Integer-order Sobolev spaces and their norms.

[F8]

Standard smooth mollifiers turn a Lipschitz cutoff into a smooth one; convolution with a unit-mass mollifier is smooth, and its Lipschitz bound does not exceed that of the original function. (The mollifier family generated by a unit-mass smooth bump, Convolution with a mollifier is smooth, and derivatives pass under the integral sign, Explicit compactly supported smooth cutoffs)

[F9]

The Sobolev and zero-boundary suppliers used above assume Countable Choice. (The Axiom of Countable Choice (ACω))

Proof

1.1F1F2F7given

If Ω=∅, then v=0 and the conclusion is immediate. Assume henceforth Ω≠∅. Extend v by zero to v~ on Rd and define gi to be its cellwise derivative on mesh cells and zero outside Ω‾. On each cell apply the simplex Green formula to vφei for an arbitrary φ∈Cc∞(Rd). Fact [F1] gives the cell identity. Interior facet terms cancel by [F2]; boundary facet terms vanish by the zero-boundary clause of [F2]. Summing the finitely many cell identities gives ∫Rdv~ ∂iφ=−∫Rdgiφ. Both functions are in Lp, so [F7] gives v~∈W1,p(Rd) with gradient g.

1.2F5F8givenalgebra

Put dΩ(x)=dist⁡(x,Rd∖Ω), which is 1-Lipschitz. Choose a smooth scalar step θ with θ(s)=0 for s≤1, θ(s)=1 for s≥2, and 0≤θ≤1. For ϵ>0 set ζϵ(x)=θ(dΩ(x)/ϵ) and convolve it with a nonnegative smooth mollifier of integral one supported in the ball of radius ϵ/4, obtaining ηϵ. Then ηϵ is smooth, supported in Ω, equals zero where dΩ≤3ϵ/4, equals one where dΩ≥9ϵ/4, and ∥∇ηϵ∥∞≤∥θ′∥∞/ϵ. Since Ω is bounded, its support is compact in Ω.

2.1F2step 1.1given

Let M be the maximum of the cellwise suprema of ∣∇v∣. Across every interior facet the polynomial traces agree; on every boundary facet they agree with zero. For a point x in the mesh skeleton, its minimal mesh face is the unique mesh face whose relative interior contains x; the local star of that face means the union of the cells containing it. If the minimal face is a facet, there are exactly two incident cells at an interior facet and exactly one at a boundary facet. In the interior case their values at x agree by the matching polynomial traces; in the boundary case the single cell value agrees with exterior zero by the zero boundary trace. For the remaining faces, let c≥2 be their codimension. The incident simplicial cones in their local star cut a small sphere in the normal space of the face, of dimension c−1, into a finite face-to-face triangulation of the local directions in Ω. Within each connected component, top-dimensional pieces are connected by facet adjacency: perturb a path in that open component to avoid the finite union of codimension-two faces. At an interior point the direction set is the whole sphere, which is connected because c≥2, so matching traces make all incident polynomial values agree. At a boundary point every component has a boundary direction; following facet adjacencies reaches a boundary facet, where the polynomial value is zero, so all cell limits in that component are zero. Thus in all cases the cellwise continuous representatives and the exterior zero fit continuously on the whole finite polyhedral partition. Restrict this continuous function to any line segment. The segment is divided by the finitely many cell facets into finitely many intervals; on each cell interval its derivative along the segment has magnitude at most M, and on exterior intervals it is zero. Continuity at the interval endpoints then gives ∣v~(x)−v~(y)∣≤M∣x−y∣ for all x,y. Thus ∣v(x)∣≤Mdist⁡(x,Rd∖Ω).

3.1F5F6step 2.1step 1.2

The difference v−ηϵv and its weak gradient are supported in Eϵ={x∈Ω:dΩ(x)<9ϵ/4}. On this layer, step 2.1 gives ∣v∣≤(9/4)Mϵ, and step 1.2 gives ∣v∇ηϵ∣≤(9/4)M∥θ′∥∞. Also ∣∇v∣≤M. For n∈N0, the sets E1/(n+1) decrease to the empty set and ∣E1∣≤∣Ω∣<∞, so [F6] gives ∣E1/(n+1)∣→0. These bounds show ∥v−η1/(n+1)v∥W1,p(Ω)→0 for finite p.

4.1F3F5F9step 3.1

Each η1/(n+1)v has compact support in Ω. By [F5] extend it by zero to W1,p(Rd) and approximate there by ϕj∈Cc∞(Rd). Choose a smooth cutoff χ∈Cc∞(Ω) equal to one near the compact support of η1/(n+1)v. Then χϕj∈Cc∞(Ω) and, by the weak product rule, χϕj→η1/(n+1)v in W1,p(Ω). A diagonal choice with step 3.1 proves v∈W01,p(Ω) by [F3].

5.1F4F9step 4.1∎

A bounded set lies in a slab of finite width b−a. Apply [F4] to the membership from step 4.1, obtaining the displayed inequality with CΩ=C(p)(b−a) for the fixed exponent p.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Poincare–Wirtinger inequality on a reference simplex

Statement

Assume Countable Choice. For every 1≤p<∞ there is Cd,p<∞ such that for all u∈W1,p(S^d;R), ∥u−uS^d∥Lp(S^d)≤Cd,p∣u∣W1,p(S^d),uS^d:=∣S^d∣−1∫S^du dx.

Facts & Assumptions

Given: Countable Choice, the bounded convex reference simplex and 1≤p<∞.

[F1]

Smooth functions on a neighbourhood of the closed simplex are dense in W1,p(S^d). (Smooth functions are dense in finite-order Sobolev spaces on a reference simplex)

[F2]

Along a segment, the fundamental theorem gives the integral of the directional derivative, bounded by segment length times the integral of ∣∇u∣. (If f:[a,b]→Rm is differentiable with integrable f′ then ∫abf′=f(b)−f(a); and a bounded derivative makes f Lipschitz)

[F3]

Jensen bounds the pth power of an average by the average of the pth powers; Tonelli/Fubini permits the pair and parameter integrals; Holder controls integrals on the finite-measure simplex; affine change of variables has its determinant factor. (Jensen's integral inequality for a probability measure, Tonelli and Fubini for the completed product, with only almost-everywhere section measurability, Holder's inequality for integrals, including the endpoint cases, A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)

[F4]

The smooth-density supplier [F1] assumes Countable Choice. (The Axiom of Countable Choice (ACω))

Proof

1.1F2F3given

First take u smooth. For x,y∈S^d, convexity keeps zt=tx+(1−t)y in the simplex. The segment identity and ∣x−y∣≤h:=diam⁡(S^d) give ∣u(x)−u(y)∣p≤hp∫01∣∇u(tx+(1−t)y)∣p dt, by [F2] and Jensen on the unit interval. Jensen again gives ∣u(x)−uS^d∣p≤∣S^d∣−1∫S^d∣u(x)−u(y)∣p dy.

2.1F3step 1.1algebra

Integrate the last bound over x. For t≥1/2, fix y and use x↦tx+(1−t)y; its Jacobian is td, and its image is contained in the simplex, so its integral is at most 2d∫S^d∣∇u∣p. For t≤1/2, fix x and use y↦tx+(1−t)y, whose inverse Jacobian is at most 2d, giving the same bound. Tonelli [F3] therefore yields ∥u−uS^d∥pp≤2dhp∥∇u∥pp. Taking pth roots proves the estimate for smooth u.

3.1F1F4step 2.1algebra∎

For arbitrary u∈W1,p choose smooth uj→u in W1,p by [F1]. Holder on the finite-measure simplex gives ∫uj→∫u, so (uj)S^d→uS^d; also ∥uj−u∥p→0 and ∥∇uj∥p→∥∇u∥p. Passing to the limit in the smooth inequality of step 2.1 proves the statement.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Bramble–Hilbert approximation on a reference simplex

Statement

Assume Countable Choice. Let 1≤p<∞, integer r≥1, integer s≥0, and real-valued v∈Wmax⁡(r,s),p(S^d). There is a polynomial q∈Pr−1(S^d), chosen by matching all means ∫S^dDαq=∫S^dDαv for ∣α∣≤r−1, such that:

  • if 0≤s≤r, then ∥v−q∥Ws,p(S^d)≤C∣v∣Wr,p(S^d);
  • if s>r, then ∥v−q∥Ws,p(S^d)≤C∑j=rs∣v∣Wj,p(S^d).

The second clause assumes v∈Ws,p; constants depend only on d,p,r,s.

Facts & Assumptions

Given: 1≤p<∞, integers r≥1 and s≥0, and v∈Wmax⁡(r,s),p(S^d).

[F1]

The mean-zero Poincare–Wirtinger inequality holds on the reference simplex for every finite p. (Poincare–Wirtinger inequality on a reference simplex)

[F2]

Sobolev classes provide all weak derivatives up to the specified integer order, and their norms are finite sums of derivative Lp norms. (Integer-order Sobolev spaces and their norms)

[F3]

The mean-zero Poincare supplier [F1] assumes Countable Choice. (The Axiom of Countable Choice (ACω))

[F4]

Holder's inequality on the finite-volume simplex sends Lp derivatives into L1 for finite p. (Holder's inequality for integrals, including the endpoint cases)

Proof

1.1givenalgebra

The monomials xα with ∣α∣≤r−1 form a basis of Pr−1. Thus if N is the number of these multi-indices, then N=dim⁡Pr−1. Define the linear moment map M:Pr−1→RN by M(q)α=∣S^d∣−1∫S^dDαq. If every component is zero, take the largest degree m of a nonzero homogeneous part of q. For each ∣α∣=m, Dαq is the constant α! times the coefficient of xα in that highest homogeneous part; its zero mean forces that coefficient to vanish. This contradicts the choice of m. Repeating downward shows q=0, so M is injective and, since its domain and codomain have the same finite dimension, bijective.

2.1F2F4step 1.1given

The vector of means of Dαv, ∣α∣≤r−1, is defined because each derivative is in Lp on the finite-measure simplex and therefore in L1 by [F4]. By bijectivity in step 1.1 there is a unique q∈Pr−1 with those moments. For w=v−q, each derivative Dαw, ∣α∣≤r−1, has zero mean; and every derivative of q of order at least r is zero.

3.1F1F2F3step 2.1

Apply [F1] to every mean-zero derivative of order r−1 in step 2.1; its Lp norm is bounded by the Lp norms of derivatives of order r of v, since Drq=0. Apply [F1] successively to derivatives of orders r−2,r−3,…,0, each of which also has zero mean; at each stage its norm is bounded by the next derivative order already controlled. Thus all derivatives of w of order at most r are bounded by C∣v∣Wr,p. If s≤r, retaining only orders through s proves the first clause.

4.1F2step 2.1step 3.1algebra∎

If s>r, the same argument controls all derivative orders at most r−1 by C∣v∣Wr,p. For each r≤∣β∣≤s, Dβw=Dβv because Dβq=0. Adding the finitely many derivative bounds through order s gives ∥w∥Ws,p≤C∑j=rs∣v∣Wj,p, proving the second clause.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Local interpolation estimates on shape-regular affine meshes

Statement

Assume Countable Choice. Let k≥0, 1≤p<∞, and let (S^d,P^,Σ^) be a reference finite element whose polynomial space contains Pk. Assume its degrees of freedom are bounded on Wℓ,p(S^d) for an integer ℓ≥1, let r,m∈N0, and let I^ be its interpolant. Thus I^q=q for q∈Pk. On a shape-regular affine mesh as in Matching affine simplicial meshes and shape regularity, for each cell K with its orientation-preserving reference map FK define IKv=(I^(v∘FK))∘FK−1. For every such cell, if ℓ≤r≤k+1 and 0≤m≤r, then for v∈Wr,p(K), ∣v−IKv∣Wm,p(K)≤ChKr−m∣v∣Wr,p(K). If ℓ>k+1 and 0≤m≤k+1, then for v∈Wℓ,p(K), ∣v−IKv∣Wm,p(K)≤C∑n=k+1ℓhKn−m∣v∣Wn,p(K). The constants are uniform over the mesh family and depend on the stated reference element, exponents and shape-regularity bound. For Lagrange elements in the existing mesh dimension range d≥2, assume additionally the Axiom of Choice for the automatic nodal-boundedness application. Then Sobolev threshold for Lagrange point evaluations on a reference simplex supplies the boundedness hypothesis when ℓ>d/p; unisolvence of a particular node set remains a separate hypothesis.

Facts & Assumptions

Given: A shape-regular affine simplex family, finite p, a unisolvent reference element, Countable Choice, and the stated degree-of-freedom boundedness on Wℓ,p(S^d).

[F1]

Unisolvent degrees of freedom define a linear interpolation operator that reproduces every polynomial in its finite-element space. (Reference finite elements and unisolvent degrees of freedom, Unisolvent degrees of freedom define a unique reference interpolant)

[F2]

On the fixed reference polynomial space, every derivative norm is bounded by its coefficient or cell Lp norm; hence bounded degrees of freedom give a bounded interpolant into every polynomial derivative norm. (Polynomial derivative and face norms are controlled on a reference simplex)

[F3]

For real-valued v, Bramble–Hilbert supplies a polynomial q of degree at most r−1 with ∥v−q∥Wm,p≤C∣v∣Wr,p when m≤r, and for q∈Pk with v∈Wℓ,p, ∥v−q∥Wℓ,p≤C∑n=k+1ℓ∣v∣Wn,p when ℓ>k+1. (Bramble–Hilbert approximation on a reference simplex)

[F4]

Under affine pullback/pushforward, order-s seminorms acquire ∥A∥s∣det⁡A∣−1/p or ∥A−1∥s∣det⁡A∣1/p factors. (Affine pullback of weak derivatives and Sobolev seminorms)

[F5]

Shape regularity gives ∥AK∥≍hK, ∥AK−1∥≍hK−1 and det⁡AK≍hKd. (Shape regularity controls affine simplex geometry)

[F6]

Under the additional Axiom of Choice and the existing dimension restriction d≥2, Lagrange point evaluations are bounded when ℓ>d/p. (Sobolev threshold for Lagrange point evaluations on a reference simplex) The generic estimate takes bounded degrees of freedom as a hypothesis.

[F7]

The Bramble–Hilbert supplier [F3] assumes Countable Choice through the reference Poincare–Wirtinger inequality. (The Axiom of Countable Choice (ACω))

[F8]

For complex-valued Sobolev functions, real and imaginary parts and their weak derivatives are taken componentwise; the pointwise inequalities ∣Re⁡z∣,∣Im⁡z∣≤∣z∣≤∣Re⁡z∣+∣Im⁡z∣ combine the real-valued Sobolev estimates into the corresponding complex-valued estimates, with at most a fixed factor in the constant. (Integer-order Sobolev spaces and their norms)

Proof

1.1F1F2F6given

On the reference cell, write I^w as the finite sum of its degree-of-freedom values times the dual shape functions. The assumed boundedness of each functional and [F2] bound ∣I^w∣Wm,p≤C∥w∥Wℓ,p. For any reproduced q, linearity gives v^−I^v^=(v^−q)−I^(v^−q), so ∣v^−I^v^∣Wm,p≤∣v^−q∣Wm,p+C∥v^−q∥Wℓ,p. For the automatic Lagrange application, under the additional Axiom of Choice, d≥2, and ℓ>d/p, [F6] verifies nodal-functional boundedness. For the generic estimate, boundedness is the explicit hypothesis, so this additional choice assumption is not used.

2.1F3F7F8step 1.1

If ℓ≤r≤k+1 and v^ is real-valued, choose the Bramble–Hilbert polynomial q∈Pr−1⊆Pk from [F3]. If v^ is complex-valued, apply the first clause of [F3] to Re⁡v^ and Im⁡v^ separately, obtaining qR,qI∈Pr−1, and set q=qR+iqI. In either case q is reproduced by I^. Since m≤r and ℓ≤r, [F3] bounds both terms in step 1.1 for the real case; for the complex case, [F8] combines the two real estimates and changes only the constant. Thus ∣v^−I^v^∣Wm,p≤C∣v^∣Wr,p.

2.2F3F7F8step 1.1

If ℓ>k+1 and v^ is real-valued, choose the Bramble–Hilbert polynomial q∈Pk from [F3]. If v^ is complex-valued, apply the second clause of [F3] with r=k+1, s=ℓ to its real and imaginary parts, obtaining qR,qI∈Pk, and set q=qR+iqI. In either case q is reproduced by I^. Then [F3] bounds the Wℓ,p norm of v^−q by C∑n=k+1ℓ∣v^∣Wn,p; because m≤k+1<ℓ, the same controls its Wm,p norm. For complex v^, [F8] combines the component estimates with at most a fixed change in C. Step 1.1 gives ∣v^−I^v^∣Wm,p≤C∑n=k+1ℓ∣v^∣Wn,p.

3.1F4F5F7step 2.1algebra

For v^=v∘FK, use [F4] to transform the physical error to the reference cell and the reference derivatives of v back to the physical cell. The product of the two determinant factors cancels; the remaining matrix factors are bounded by C∥AK−1∥m∥AK∥r≤ChKr−m by [F5]. This gives the first physical estimate from step 2.1.

4.1F2F4F5F7step 2.2algebra∎

In the second case, apply the same transformation separately to each order n in step 2.2. Its matrix factor is bounded by C∥AK−1∥m∥AK∥n≤ChKn−m by [F5]; summing over k+1≤n≤ℓ gives the second physical estimate. The constants in [F2]–[F7] are uniform over the fixed reference element and the shape-regular family, proving uniformity.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

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.

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Covariant and contravariant Piola maps and H(div)/H(curl) spaces

Definition

Assume Countable Choice. Let d≥2, take K^=S^d as in Matching affine simplicial meshes and shape regularity, and let K=F(K^) under an affine cell map F(x^)=Ax^+b with det⁡A>0. Weak derivatives use the signed test identity of Weak derivative of a locally integrable function. For d≥2 define H(div⁡,K):={v∈L2(K;Rd):div⁡v∈L2(K)}, where div⁡v=∑iDivi weakly, meaning ∫Kv⋅∇ϕ=−∫K(div⁡v)ϕ for every ϕ∈Cc∞(K). For d=2, define the weak scalar curl by ∫K(curl⁡v)ϕ=∫K(v1∂2ϕ−v2∂1ϕ) for every ϕ∈Cc∞(K). For d=3, define the weak vector curl by ∫K(curl⁡v)⋅ψ=∫Kv⋅curl⁡ψ for every ψ∈Cc∞(K;R3). In dimensions d=2,3 set H(curl⁡,K):={v∈L2(K;Rd):curl⁡v∈L2(K;Rd∗)}, with d∗=1 for d=2 and d∗=3 for d=3.

The covariant Piola pushforward of a reference vector field is (PFcurlv^)(F(x^)):=A−Tv^(x^), and the contravariant Piola pushforward is (PFdivv^)(F(x^)):=1det⁡AAv^(x^). The scalar pullback is u↦u∘F. The exact mapping properties, weak differential identities, and oriented trace-moment transformations are established in the corresponding affine Piola theorem below.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Affine Piola maps commute with differential operators and preserve moments

Statement

Assume Countable Choice. Let d=2 or 3 and let F(x^)=Ax^+b map a reference simplex to an affine cell with det⁡A>0. The contravariant Piola map PFdivv^=(det⁡A)−1Av^∘F−1 maps H(div⁡,S^d) into H(div⁡,K) and div⁡(PFdivv^)=(det⁡A)−1(div⁡^v^)∘F−1. The covariant Piola map PFcurlv^=A−Tv^∘F−1 maps H(curl⁡,S^d) into H(curl⁡,K); in d=2 its scalar curl is (det⁡A)−1(curl⁡^v^)∘F−1, and in d=3 its vector curl is (det⁡A)−1A(curl⁡^v^)∘F−1. For every u^∈W1,2(S^d;R), the scalar pullback u=u^∘F−1 belongs to W1,2(K;R) and its gradient satisfies ∇u=PFcurl(∇^u^). For smooth fields, contravariant normal fluxes satisfy v⋅n dS=v^⋅n^ dS^; covariant tangential pullbacks satisfy v(F(x^))⋅Aτ^=v^(x^)⋅τ^ for every reference tangent τ^. Thus edge line integrals and normal-flux moments are preserved, and face tangential moments transform with this pullback and the induced facet surface Jacobian. These formulas record the chosen orientation; reversing a facet orientation reverses its signed moment.

Facts & Assumptions

Given: Countable Choice, the affine map, det⁡A>0, d∈{2,3}, and the weak graph spaces and Piola maps of Covariant and contravariant Piola maps and H(div)/H(curl) spaces.

[F1]

Weak derivatives pull back through an affine map by the constant matrix chain rule, and affine change of variables multiplies volume by det⁡A. (Affine pullback of weak derivatives and Sobolev seminorms)

[F2]

The cofactor area-vector identity is n dS=det⁡(A)A−Tn^ dS^, with outward orientation preserved when det⁡A>0. (Gauss–Green formula on an affine simplex)

[F3]

Lebesgue change of variables holds for nonnegative measurable integrands; apply it to positive and negative parts for integrable signed pairings. (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions)

[F4]

The affine pullback and change-of-variables suppliers assume Countable Choice. (The Axiom of Countable Choice (ACω))

[F5]

Applying the affine weak-derivative transformation to F−1 gives Dxi(u^∘F−1)=∑j(A−1)ji(Dx^ju^)∘F−1 for u^∈W1,2(S^d;R). (Affine pullback of weak derivatives and Sobolev seminorms)

Proof

1.1F1F3F4given

For v^∈H(div⁡,S^d) and ϕ∈Cc∞(K), put ϕ^=ϕ∘F. Then [F1] and the determinant substitution give ∫K(PFdivv^)⋅∇ϕ dx=∫S^dv^⋅∇ϕ^ dx^=−∫S^d(div⁡^v^)ϕ^ dx^. The final expression equals −∫K[(det⁡A)−1div⁡^v^∘F−1]ϕ dx. This is the distributional divergence identity.

1.2F1algebra

For smooth v^, differentiate v=A−Tv^∘F−1 componentwise. In three dimensions, write C=A−1. For any z∈R3 and indices m,ℓ, the scalar triple product gives z⋅((CTem)×(CTeℓ))=det⁡[z,CTem,CTeℓ]=det⁡(C)det⁡[C−Tz,em,eℓ]=det⁡(C) z⋅(C−1(em×eℓ)). Since this holds for every z, comparing components yields ϵijkCmjCℓk=(det⁡A)−1Airϵrmℓ. The chain rule then gives curl⁡xv=(det⁡A)−1A(curl⁡x^v^)∘F−1. In two dimensions write A=(abcd) and Δ=ad−bc>0. Then v1=(dv^1−cv^2)/Δ, v2=(−bv^1+av^2)/Δ, ∂x1=(d∂x^1−c∂x^2)/Δ, and ∂x2=(−b∂x^1+a∂x^2)/Δ. Substituting these four expressions and cancelling the two mixed terms gives ∂x1v2−∂x2v1=(det⁡A)−1(∂x^1v^2−∂x^2v^1)∘F−1.

2.1F1F3F4step 1.1algebra

The physical field and candidate divergence in step 1.1 lie in L2(K): affine change of variables makes their squared norms finite constant multiples of the reference squared norms, and multiplication by the fixed matrix A/(det⁡A) preserves finiteness. The test identity in step 1.1 therefore gives membership in H(div⁡,K) and the asserted divergence formula.

2.2F1F3F4step 1.2givenalgebra

For d=3, take ψ∈Cc∞(K;R3) and set ψ^=AT(ψ∘F). The component calculation in step 1.2 gives curl⁡x^ψ^=det⁡(A)A−1(curl⁡xψ)∘F. Change variables and use the weak curl identity on the reference cell: ∫Kv⋅curl⁡ψ dx=∫S^dv^⋅curl⁡ψ^ dx^=∫S^d(curl⁡^v^)⋅ψ^ dx^=∫K[(det⁡A)−1A(curl⁡^v^)∘F−1]⋅ψ dx. For d=2, take ϕ∈Cc∞(K) and set ϕ^=ϕ∘F. The determinant identity det⁡(A)det⁡(A−Tv^,A−T∇ϕ^)=det⁡(v^,∇ϕ^) transforms the weak scalar-curl pairing into ∫S^d(v^1∂2ϕ^−v^2∂1ϕ^), which by the weak reference curl identity equals ∫S^d(curl⁡^v^)ϕ^ and hence the pairing with the asserted physical scalar curl. In both dimensions the mapped field and candidate curl lie in L2 by the fixed-matrix and determinant bounds. Thus the weak definition gives the claimed H(curl⁡) mapping.

2.3F2F4step 1.1step 1.2algebra

The normal flux identity follows by dotting v=(det⁡A)−1Av^ with the area vector [F2]: v⋅n dS=(det⁡A)−1Av^⋅det⁡(A)A−Tn^ dS^=v^⋅n^ dS^. For a reference tangent τ^, v(F)⋅Aτ^=(A−Tv^)⋅Aτ^=v^⋅τ^. Along an edge this equality is the line-form identity v⋅dx=v^⋅dx^. On a facet, integration against a pulled-back tangent vector and scalar weight gives ∫Fv⋅(Aτ^)(q^∘F−1) dS=∫F^(v^⋅τ^)q^JF dS^, where JF is the affine facet surface Jacobian. The normal-flux moment with scalar weight q^ equals ∫F^(v^⋅n^)q^ dS^. The signs are those of the selected outward facet orientation; reversing it reverses the signed normal moment.

3.1F1F5algebra∎

For u^∈W1,2(S^d;R), apply [F5] to F−1. For each i, Dxi(u^∘F−1)=∑j(A−1)ji(Dx^ju^)∘F−1. In vector notation this is ∇x(u^∘F−1)=A−T(∇^u^)∘F−1=PFcurl(∇^u^), which proves the scalar-gradient identity.

LemmaStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Affine Piola transport preserves commuting interpolation diagrams

Statement

Let V^j and Vj be reference and physical spaces related by invertible affine Piola maps Pj:V^j→Vj. Let D^j and Dj be the corresponding differential operators, and assume the proved affine identities DjPj=Pj+1D^j from Affine Piola maps commute with differential operators and preserve moments. Suppose reference interpolation operators I^j are defined on spaces containing the relevant inputs and satisfy D^jI^j=I^j+1D^j there. Define the physical interpolants by Piola conjugation Ij=PjI^jPj−1. Then DjIj=Ij+1Dj on every input for which these compositions are defined. This is conditional on the reference commuting identity; it does not assert that arbitrary unisolvent degrees of freedom commute.

Facts & Assumptions

Given: Unisolvent reference interpolants as in Reference finite elements and unisolvent degrees of freedom and Unisolvent degrees of freedom define a unique reference interpolant, invertible affine Piola maps, and the reference commuting identities in the statement.

[F1]

The physical and reference differential operators satisfy DjPj=Pj+1D^j on their domains. (Affine Piola maps commute with differential operators and preserve moments)

[F2]

The interpolation operator defined by the dual shape functions is a linear map on its declared domain. (Unisolvent degrees of freedom define a unique reference interpolant)

Proof

1.1F1givenalgebra

By definition Ij=PjI^jPj−1. Using [F1] and the assumed reference commutation, DjIj=DjPjI^jPj−1=Pj+1D^jI^jPj−1=Pj+1I^j+1D^jPj−1.

2.1F1F2step 1.1algebra∎

Apply [F1] to Pj−1, equivalently D^jPj−1=Pj+1−1Dj. Substitution into step 1.1 gives DjIj=Pj+1I^j+1Pj+1−1Dj=Ij+1Dj, which is the claimed physical commuting identity. The only interpolation property used was the explicitly assumed reference identity, proving the conditional scope.

TheoremStatement: Literature-sourcedProof: AI-adaptedOpen item page →

Sobolev threshold for Lagrange point evaluations on a reference simplex

Statement

Assume the Axiom of Choice. Let d≥2, let N∈N0, choose x1,…,xN∈S^d‾, and let ℓ≥1 be an integer. If 1≤p<∞ and ℓ>d/p, then each point evaluation has a unique continuous-representative value and ∣u(xj)∣≤C∥u∥Wℓ,p(S^d). If p=∞, the same conclusion holds for every ℓ≥1. Consequently any finite set of Lagrange nodal evaluations is bounded on the stated Sobolev space and defines a well-defined degree-of-freedom functional there. No boundedness at ℓ=d/p is asserted.

Facts & Assumptions

Given: The Axiom of Choice, d≥2, integer ℓ≥1, the reference simplex, and the exponent in the appropriate branch.

[A1]

The Axiom of Choice states that every family of nonempty sets has a choice function. (The Axiom of Choice)

[F1]

The reference simplex is a bounded extension domain for every integer Sobolev order and exponent. (A reference simplex is an integer-order Sobolev extension domain)

[F2]

On a bounded extension domain, if kp>d, higher-order Sobolev embedding gives a continuous representative and a norm bound; its proof assumes the Axiom of Choice. (Higher-order Sobolev embedding)

[F3]

For finite p, the Sobolev norm is the ℓp norm of the finite vector of derivative Lp norms; for p=∞ it is their maximum. (Integer-order Sobolev spaces and their norms)

[F4]

Holder's inequality on the finite-measure simplex sends each bounded L∞ derivative into every finite Lq space with the expected measure factor. (Holder's inequality for integrals, including the endpoint cases)

[F5]

The reference finite-element convention requires a unisolvent list of linear functionals on its finite-dimensional space and chosen bounded extensions to the interpolation domain. Thus, for nodal degrees of freedom of such an element, the Sobolev evaluation maps must extend the polynomial evaluations; unisolvence is a separate hypothesis. (Reference finite elements and unisolvent degrees of freedom)

Proof

1.1A1F1F2given

Suppose p<∞ and ℓ>d/p. Then ℓp>d, so apply [F2] with k=ℓ, n=d, and extension domain [F1]. It gives a continuous representative on the closed simplex and a bound for its supremum by C∥u∥Wℓ,p. Two continuous representatives of the same almost-everywhere class agree everywhere: if their difference were nonzero at a point of the closed simplex, continuity on the closure and the fact that the simplex is the closure of its interior would give a nonempty interior ball on which the difference stays nonzero, contradicting almost-everywhere equality. Thus every u(xj) is uniquely defined and obeys the displayed bound.

2.1A1F1F2F3F4F5algebra∎

If p=∞, choose any finite q>d. Since the simplex has finite volume, [F4] gives ∥Dαu∥Lq≤∣S^d∣1/q∥Dαu∥L∞ for ∣α∣≤1, so Wℓ,∞⊂W1,q continuously. The same simplex extension result [F1] and embedding [F2], now with k=1 and q>d, give a unique continuous representative and the required bound by ∥u∥Wℓ,∞. In either branch, evaluation is linear because a linear combination of continuous representatives is the unique continuous representative of the corresponding Sobolev class. On a polynomial it is the ordinary nodal value, so these bounded maps extend any prescribed nodal degrees of freedom as required by [F5], without asserting unisolvence of an arbitrary node list; for N≥1, the nodes have a common bound by taking the maximum of their constants, while for N=0 the assertion is vacuous and any finite constant, such as C=1, suffices.

5 · Examples, counterexamples and false statements

None yet.

Sources