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.

Stable two-level P1 decomposition for structured Poisson meshes

Statement

Assume Countable Choice. Let d∈{2,3}, Ω=(0,1)d, and let M≥2 and n≥2 be integers. Write e1,…,ed for the standard coordinate vectors in Rd. In every cube of side a=1/M, for each coordinate permutation π use the simplex whose successive vertices, with x the cube's lower corner, are x, x+aeπ(1), x+a(eπ(1)+eπ(2)), through x+a∑r=1deπ(r). Subdivide each cube into nd uniform fine cubes and apply the same permutation rule at fine scale; this gives a matching, shape-regular affine simplicial fine mesh refining the coarse mesh. Write H=d a and h=d a/n. Assume an overlap radius δ=qa/n with integer ⌈d⌉≤q≤n, so h≤δ≤a. For each coarse cube Qj, let Ωj be its closed ℓ∞-neighborhood of radius δ+h, intersected with Ω‾. Let VH⊂Vh⊂H01(Ω) be the continuous zero-boundary P1 spaces on the coarse and fine meshes, and let Vj={vh∈Vh:supp⁡vh⊆Ωj}. Here ∥x∥∞=max⁡r∣xr∣, dist⁡∞(x,Q)=inf⁡y∈Q∥x−y∥∞, an ℓ∞-neighborhood of radius r is {x:dist⁡∞(x,Q)≤r}, and supp⁡v is the closure in Ω‾ of {x:v(x)≠0}. For the Poisson energy a(u,v)=∫Ω∇u⋅∇v dx, every uh∈Vh has a decomposition uh=u0+∑juj with u0∈VH and uj∈Vj satisfying a(u0,u0)+∑ja(uj,uj)≤CFE(1+(Hδ)2)a(uh,uh). The constant CFE depends only on d, the fixed uniform shape-regularity bound, the Scott–Zhang constant, and the reference P1 product interpolation constants; it is independent of M,n,δ.

Facts & Assumptions

Given: The cube mesh family and parameters in the statement, the real Poisson energy, and Countable Choice.

[F1]

On a matching shape-regular simplicial mesh of a bounded connected polygonal or polyhedral domain, the face-average P1 map Jh takes H01 into the zero-boundary continuous P1 space, is uniformly H1-seminorm stable, and satisfies ∥v−Jhv∥L2(K)≤ChK∥∇v∥L2(ωK). Here ωK is the union of cells meeting a vertex of K. Its statement assumes Countable Choice and dimensions d=2,3 (Boundary-preserving face-average P1 interpolation).

[F2]

On each fine simplex, the nodal P1 interpolant of a product of affine functions satisfies ∥∇IK(θw)∥L2(K)≤C(∥θ∇w∥L2(K)+∥w∇θ∥L2(K)) (Elementwise P1 product-cutoff energy estimate); denote its constant by CP.

[F3]

A matching affine mesh consists of face-to-face nondegenerate affine simplices, and its P1 space is the continuous piecewise-affine space (Matching affine simplicial meshes and shape regularity, Broken and conforming polynomial spaces on a matching mesh).

[F4]

A continuous matching piecewise-affine function with zero boundary facets lies in H01(Ω) (Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare).

[F5]

The zero-boundary Scott–Zhang estimate in [F1] assumes Countable Choice through the Sobolev and trace suppliers (The Axiom of Countable Choice (ACω)).

[F6]

Shape regularity bounds barycentric gradients by ∥∇λi∥L∞(K)≤ChK−1 (Shape regularity controls affine simplex geometry).

Proof

1.1F3F4givenconstruct

In a coordinate cube, the stated simplices are the regions where the normalized coordinates have one fixed weak ordering. For each coordinate pair, a coarse ordering hyperplane can meet the interior of a fine cube only when the two fine-cell indices agree; there it is the local equality hyperplane used by the fine Freudenthal triangulation. Thus every fine simplex lies in one coarse simplex. The induced order triangulation on a coordinate face is the same from either incident cube, so the meshes match. The reference simplices come from finitely many coordinate permutations, so their shape-regularity constants are bounded by a number depending only on d. By [F3], the continuous P1 spaces are nested. Their boundary nodal values vanish; [F4] places both spaces in H01(Ω).

1.2F1F3F5givenalgebra

Let JH be the face-average Scott–Zhang map of [F1], set u0=JHuh, and w=uh−u0∈Vh. Each coarse element patch ωK meets only coarse cubes whose coordinate indices differ from that of K by at most one. Thus at most Md=3dd! coarse simplex patches contain a fixed point. Squaring and summing [F1] over the coarse mesh gives ∥w∥L2(Ω)≤CSH∥∇uh∥L2(Ω),∥∇u0∥L2(Ω)≤CS∥∇uh∥L2(Ω) for a constant CS depending only on d and shape regularity. The second inequality is the global stability part of [F1]. The stated Countable Choice assumption supplies the choice principle required by the Scott–Zhang and Sobolev-trace suppliers in [F1].

1.3F3F6givenalgebra

For each coarse cube define ψj(x)=max⁡(0,1−dist⁡∞(x,Qj)δ),ηj(x)=ψj(x)∑kψk(x). At every x∈Ω, at least one coarse cube contains x, so the denominator is at least 1. Since δ≤a, at most 4d functions ψk are nonzero at a point; each is 1/δ-Lipschitz. The quotient rule for Lipschitz functions with denominator at least 1 gives 0≤ηj≤1, ∑jηj=1, and ∥∇ηj∥L∞≤(1+4d)/δ almost everywhere. Let θj=Ihηj be its fine-grid nodal P1 interpolant. The nodal values sum to one, hence ∑jθj=1 on every fine simplex; barycentric coordinates give 0≤θj≤1. On a fine simplex with vertices x0,…,xd and barycentric coordinates λi, ∇θj=∑i=1d(ηj(xi)−ηj(x0))∇λi. The Lipschitz bound and [F6] imply ∥∇θj∥L∞(K)≤Cθ/δ for a constant Cθ depending only on dimension and shape regularity. If θj is nonzero on a fine simplex, one of its vertices lies within ℓ∞ distance δ of Qj, so the whole simplex lies in Ωj by the added radius h. At most N=7d expanded coarse cubes contain any point: in each coordinate their side length is at most a+2(δ+h)≤5a, so at most seven grid intervals can contain that coordinate. Every clipped expanded cube has side lengths between a and 5a, so its aspect ratio is at most 5; hence these subdomains are uniformly shape-regular and have diameter at most 5H.

2.1F3F4step 1.2step 1.3construct

At every fine-grid vertex, ∑jθjw=w. The nodal interpolant is linear on each fine simplex, so the local functions uj=Ih(θjw) satisfy ∑juj=w. Each uj is supported in Ωj. At a boundary vertex w=0, since uh,u0∈Vh; hence every uj has zero boundary nodal values and belongs to H01(Ω) by [F4]. Thus uh=u0+∑juj is a decomposition in the stated spaces.

2.2F2step 1.2step 1.3algebra

Apply [F2] elementwise and (s+t)2≤2s2+2t2: ∑j∥∇uj∥L2(Ω)2≤2CP2N(∥∇w∥L2(Ω)2+Cθ2δ2∥w∥L2(Ω)2). Indeed, each point belongs to at most N supports, 0≤θj≤1, and ∣∇θj∣≤Cθ/δ. Also ∥∇w∥2≤(1+CS)∥∇uh∥2 by step 1.2.

3.1step 1.2step 2.2algebra∎

Substitute the two estimates of step 1.2 into step 2.2 and add ∥∇u0∥22≤CS2∥∇uh∥22. With CFE=1+CS2+2CP2N((1+CS)2+Cθ2CS2), the result is ∥∇u0∥22+∑j∥∇uj∥22≤CFE(1+(H/δ)2)∥∇uh∥22. This is the asserted stable-decomposition bound.

Depends on

Used by

Dependency tree · two levels

36 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