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

L2 projections are uniformly W1p-stable on quasi-uniform conforming meshes

Statement

Assume Countable Choice and fix a degree k≥1. Take a sequence of meshes with h→0 in either branch and use the zero-boundary Lagrange spaces Vh from Quasi-uniform finite-element mass inverses have summable graph decay: globally quasi-uniform, shape-regular matching affine simplices on a bounded Lipschitz polyhedral open set in d≥2 (with the local graph-chart convention of Boundary-preserving quasi-interpolation is stable and strongly approximating), or interval partitions of a nonempty bounded interval (or a finite nonempty union of intervals with disjoint closures) in d=1. For f∈L1(Ω) define Phf∈Vh by the finite mass system

∫Ω(Phf)wh=∫Ωfwh(wh∈Vh).

This is well-defined, agrees on L2(Ω) with the L2-orthogonal projection, and is the identity on Vh. There are constants independent of h such that ∥Phf∥Lr(Ω)≤Cr∥f∥Lr(Ω)(1≤r≤∞). For every 1<p<∞ and v∈W01,p(Ω), ∥∇Phv∥Lp(Ω)≤Cp∥∇v∥Lp(Ω),Phv⟶vin W1,p(Ω). For the PE12 application, additionally assume the Axiom of Choice and p>max⁡(1,2d/(d+2)). The compact embedding The subcritical W0 one p embedding into L2 makes V=W01,p(Ω) a dense subspace of H=L2(Ω), and The zero-boundary W1p space is separable and reflexive supplies the separable reflexive Banach structure. Thus these spaces form the evolution triple of Coercive monotone p-growth diffusion fluxes and Banach evolution triples and weak time derivatives, and the Ph above is its H-orthogonal projector. Together with any time partitions whose maximum step tends to zero it satisfies the projector clauses in Conforming FEM families with stable L2 projectors. For every d≥2, the uniform Kuhn/Freudenthal meshes of Ω=(0,1)d, and for d=1 the uniform interval meshes of Ω=(0,1), are explicit nonempty instances throughout that full strict p range. Time refinement is independent of spatial refinement.

Facts & Assumptions

Given: Countable Choice; fixed k≥1; one of the two mesh branches; and a finite mesh in its family.

[F1]

The scaled mass matrix has uniform spectrum, inverse decay, absolute row and column sums, and coefficient scaling; the one-dimensional interval branch is part of its Statement (Quasi-uniform finite-element mass inverses have summable graph decay).

[F2]

The zero-boundary quasi-interpolant maps W01,p into Vh, is uniformly gradient-stable, and converges strongly in W1,p for every finite p. Its proof establishes Vh⊂W01,p directly on the interval branch as well as the interval quasi-interpolation estimates (Boundary-preserving quasi-interpolation is stable and strongly approximating).

[F3]

On d≥2 shape-regular matching simplices, degree-k polynomials satisfy the inverse estimate ∥∇wh∥Lp(K)≤ChK−1∥wh∥Lp(K) (Polynomial inverse and discrete trace inequalities). On an interval, the local upper gradient and lower function coefficient bounds in [F1], after division, give the same estimate.

[F4]

The zero-boundary conforming polynomial space on a matching simplex mesh is contained in W01,p for finite p (Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare); the interval membership branch is proved in [F2].

[F5]

Cc∞(Ω) is dense in L2(Ω) for every open Ω (Smooth compactly supported functions of an open set are dense in L2).

[F6]

An admissible stable conforming FEM sequence requires finite-dimensional Vk⊂V, their H-orthogonal projectors, uniform V-stability, strong V-approximation, and time partitions whose maximum step tends to zero (Conforming FEM families with stable L2 projectors).

[F7]

On an open set bounded in one direction, Poincaré bounds the Lp norm of a zero-boundary function by its gradient norm for finite p (The Poincare inequality for zero-boundary Sobolev closures on domains bounded in one direction).

[F8]

Hölder's inequality bounds each mass right-hand-side functional f↦∫Ωfϕi on Lp(Ω) by ∥f∥p∥ϕi∥p′ (Holder's inequality for integrals, including the endpoint cases).

[F9]

In the strict PE12 exponent range, W01,p(Ω) is densely, continuously, and compactly embedded in L2(Ω), including the interval branch (The subcritical W0 one p embedding into L2).

[F10]

For bounded open Ω and 1<p<∞, W01,p(Ω) is a separable reflexive real Banach space (The zero-boundary W1p space is separable and reflexive).

[F11]

Under the strict PE12 exponent and Axiom of Choice, the flux-space definition uses V=W01,p(Ω) with gradient norm and H=L2(Ω); Poincaré [F7] makes this norm equivalent to the inherited Sobolev norm, so [F10] supplies separability and reflexivity. The compact embedding [F9] is dense, and the evolution-triple definition fixes their real pairing (Coercive monotone p-growth diffusion fluxes, Banach evolution triples and weak time derivatives).

[A1]

Countable Choice is the declared background for the finite-element Sobolev, density, and compactness interfaces used here (The Axiom of Countable Choice (ACω)).

[A2]

The PE12 evolution-triple application assumes the Axiom of Choice through the reflexivity, compact embedding, and flux-space interfaces (The Axiom of Choice).

Proof

1.1A1F1F8givenalgebra

The nodal system in [F1] has an invertible interior mass matrix whenever Vh≠{0}; if Vh={0}, set Phf=0. For finite r, every basis function is bounded by a mesh-independent constant and is supported on the cells incident to its node. Hölder and the coefficient scaling in [F1] therefore give, for bi=h−d∫Ωfϕi, ∣bi∣r≤Ch−d∫supp⁡ϕi∣f∣r,∥b∥ℓr≤Ch−d/r∥f∥Lr(Ω). The second inequality follows because on each cell only the fixed number N(d,k) of local basis supports occur, so their overlap is bounded. For r=∞, ∥b∥ℓ∞≤C∥f∥∞.

1.2givenconstructalgebra

For d=1, the explicit meshes of Ω=(0,1) are Kj=[j/N,(j+1)/N], 0≤j<N. They meet at whole endpoints, hN=1/N, each inradius is 1/(2N), their shape ratio is 2, and θ=1; hence hN→0. For d≥2, in every grid cube a+[0,1/N]d, take the d! simplices with cumulative vertices a,a+N−1eπ1,a+N−1(eπ1+eπ2),…,a+N−1∑j=1dej for permutations π of {1,…,d}. In coordinates t=N(x−a) each is 1≥tπ1≥⋯≥tπd≥0. Sorting coordinates covers the cube and strict orderings have disjoint interiors. For a permutation π, the barycentric gaps are g0=1−tπ1, gj=tπj−tπj+1 for 1≤j<d, and gd=tπd; the simplex is gj≥0, ∑jgj=1. For two permutations, every pair of coordinates ordered oppositely must be equal in their intersection. In either order chain, that equality forces every intervening coordinate equal, hence sets the corresponding consecutive barycentric gaps to zero. The resulting equality blocks have the same relative order in both permutations: otherwise a pair of blocks would be oppositely ordered and would have been merged by an inversion equality. Thus the intersection is exactly the face obtained by setting those gaps to zero, so the within-cube triangulation is matching. On a cube face, coordinates fixed to 1 occur first and those fixed to 0 occur last in every compatible ordering; the induced ordering of the remaining coordinates is identical from either adjacent cube. Thus the global simplices meet only in whole faces and form a matching mesh.

2.1F1F8step 1.1algebra

If Vh={0}, then Phf=0 and the Lr bounds are immediate. Otherwise, if c is the coefficient vector of Phf, then Ahc=b. Let D=Ah−1, and let R,C0 bound its absolute row and column sums from [F1]. For 1<r<∞, apply [F8] on the finite counting measure to the factors aj1/r∣bj∣ and aj1−1/r, where aj=∣Dij∣. This gives ∑jaj∣bj∣≤(∑jaj∣bj∣r)1/r(∑jaj)1−1/r. If the row sum is zero both sides vanish. Raising to r and summing the rows gives ∑i∣∑jDijbj∣r≤Rr−1∑i,j∣Dij∣ ∣bj∣r≤Rr−1C0∑j∣bj∣r. For r=1, the triangle inequality and the column sums directly give ∑i∣∑jDijbj∣≤C0∑j∣bj∣, the same displayed bound. For r=∞, the row-sum bound gives ∥Db∥ℓ∞≤R∥b∥ℓ∞. Combining these coefficient estimates with [F1] proves the asserted Lr bound for Ph. If f∈L2, the mass equations are exactly orthogonality to Vh, so Ph is the orthogonal projection and fixes every wh∈Vh.

2.2givenstep 1.2algebra

Each cube simplex contains opposite cube corners and lies in its cube, so its diameter is hN=d/N. In row order π1,…,πd, the cumulative-vertex edge matrix has columns eπ1,eπ1+eπ2,…,∑j=1deπj before scaling by 1/N. Subtracting each preceding column from the next gives the permuted identity matrix, so its determinant has absolute value N−d; the simplex volume is 1/(d!Nd). Its facets in ordered coordinates are tπ1=1, tπd=0, and tπj=tπj+1. Put r=1/(2+(d−1)2) and set tπj=r+(d−j)2r. The endpoint gaps are r and successive coordinate gaps are 2r, so this point is at perpendicular distance r from every facet and is the center of an inscribed ball of radius r. For any inscribed ball of radius s, its center must have endpoint gaps at least s and successive coordinate gaps at least 2s; adding these gaps gives 1≥2s+(d−1)2s. Thus the inradius is exactly r/N and the shape ratio is d(2+(d−1)2), independent of N, all cell diameters equal hN (global quasi-uniformity with θ=1), and only the d! ordered shapes occur. The cube is a bounded Lipschitz polyhedral open set. At a boundary point choose a vector v with nj⋅v>0 for each active inward face normal nj, and write nearby points as z+y+sv with y⊥v. The active inequalities become s>−nj⋅y/(nj⋅v); inactive face inequalities remain strict in a sufficiently small neighborhood. Thus locally the cube is the epigraph of the maximum of finitely many affine functions, which is Lipschitz. These are nonempty mesh families satisfying the d≥2 hypotheses.

3.1F2F3F7F8step 2.1algebra

Fix 1<p<∞ and v∈W01,p(Ω). For sufficiently fine meshes, since PhQhv=Qhv, the inverse inequality in [F3] and the Lp bound from step 2.1 give ∥∇Phv∥p≤∥∇Qhv∥p+Ch−1∥Ph(v−Qhv)∥p≤∥∇Qhv∥p+Ch−1∥v−Qhv∥p≤Cp∥∇v∥p, by [F2]. The inverse estimate holds on the interval branch as recorded in [F3]; on simplex meshes summing its cell estimates uses hK≥θh. A sequence with h→0 has only finitely many coarser initial meshes. On each such mesh, Ph is finite rank and its coefficient functionals v↦∫Ωvϕi are bounded on Lp; hence its W1,p output norm is bounded by a mesh-dependent multiple of ∥v∥Lp by [F8]. Poincaré [F7] bounds this by a multiple of ∥∇v∥p. Enlarging Cp over the finitely many initial meshes gives the stated uniform estimate.

4.1F2step 2.1step 3.1algebra

Step 2.1 and the approximation estimate of [F2] show ∥Phv−v∥p≤Ch∥∇v∥p. For gradients, write Phv−v=Ph(v−Qhv)+(Qhv−v). Apply the uniform gradient bound proved in the preceding step to v−Qhv∈W01,p and the strong approximation in [F2]; both gradient terms tend to zero. Hence Phv→v in the full W1,p norm.

5.1A1F5step 2.1step 4.1algebra

Let ψ∈Cc∞(Ω). Since Qhψ∈Vh and PhQhψ=Qhψ, the L2 bound in step 2.1 gives ∥Phψ−ψ∥2≤∥Ph(ψ−Qhψ)∥2+∥Qhψ−ψ∥2≤(C2+1)∥Qhψ−ψ∥W1,2⟶0 by [F2]. For arbitrary f∈L2(Ω), choose ψ∈Cc∞(Ω) with ∥f−ψ∥2<ε using [F5]. The L2 orthogonal projection is a contraction, so lim sup⁡h→0∥Phf−f∥2≤2ε. Letting ε↓0 proves strong L2 convergence for every f∈L2(Ω).

6.1F2F4F6step 3.1step 4.1step 5.1step 1.2step 2.2given

On each explicit mesh family, Vh⊂V: [F4] proves this for matching simplices and the interval membership argument is part of [F2]. The preceding estimates give the H-orthogonal projectors, uniform V-stability, and strong V approximation; pair the spatial index N with any time partitions whose maximum steps tend to zero. The resulting family satisfies all clauses of [F6], with no coupling between spatial and time refinement.

7.1A2F7F9F10F11step 6.1given∎

In the PE12 branch, [A2], [F7], [F9], [F10], and [F11] give the evolution triple with dense continuous compact inclusion. The explicit stable families from step 6.1 therefore instantiate the stated PE12 application for every strict p in the Statement.

Remarks

The drawing shows only the d=2, N=1 coordinate-order subdivision. The blue triangle is K(1,2)={0≤x2≤x1≤1}, the orange triangle is K(2,1)={0≤x1≤x2≤1}, and their red diagonal is the shared whole edge x1=x2. The coordinate proof above establishes matching for all d and N; no proof uses visual features of this illustration.

\begin{tikzpicture}[scale=3]
  \fill[blue!15] (0,0)--(1,0)--(1,1)--cycle;
  \fill[orange!20] (0,0)--(0,1)--(1,1)--cycle;
  \draw[thick] (0,0) rectangle (1,1);
  \draw[very thick,red] (0,0)--(1,1);
  \draw[->] (0,0)--(1.18,0) node[right] {$x_1$};
  \draw[->] (0,0)--(0,1.18) node[above] {$x_2$};
  \node at (0.72,0.28) {$K_{(1,2)}$};
  \node at (0.28,0.72) {$K_{(2,1)}$};
  \node[below left] at (0,0) {$(0,0)$};
  \node[below] at (1,0) {$(1,0)$};
  \node[left] at (0,1) {$(0,1)$};
  \node[above right] at (1,1) {$(1,1)$};
\end{tikzpicture}

Depends on

Used by

Dependency tree · two levels

112 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