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 , , and let and be integers. Write for the standard coordinate vectors in . In every cube of side , for each coordinate permutation use the simplex whose successive vertices, with the cube's lower corner, are , , , through . Subdivide each cube into 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 and . Assume an overlap radius with integer , so . For each coarse cube , let be its closed -neighborhood of radius , intersected with . Let be the continuous zero-boundary P1 spaces on the coarse and fine meshes, and let Here , , an -neighborhood of radius is , and is the closure in of . For the Poisson energy , every has a decomposition with and satisfying The constant depends only on , the fixed uniform shape-regularity bound, the Scott–Zhang constant, and the reference P1 product interpolation constants; it is independent of .
Facts & Assumptions
Given: The cube mesh family and parameters in the statement, the real Poisson energy, and Countable Choice.
On a matching shape-regular simplicial mesh of a bounded connected polygonal or polyhedral domain, the face-average P1 map takes into the zero-boundary continuous P1 space, is uniformly -seminorm stable, and satisfies Here is the union of cells meeting a vertex of . Its statement assumes Countable Choice and dimensions (Boundary-preserving face-average P1 interpolation).
On each fine simplex, the nodal P1 interpolant of a product of affine functions satisfies (Elementwise P1 product-cutoff energy estimate); denote its constant by .
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).
A continuous matching piecewise-affine function with zero boundary facets lies in (Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare).
The zero-boundary Scott–Zhang estimate in [F1] assumes Countable Choice through the Sobolev and trace suppliers (The Axiom of Countable Choice ()).
Shape regularity bounds barycentric gradients by (Shape regularity controls affine simplex geometry).
Proof
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 . By [F3], the continuous P1 spaces are nested. Their boundary nodal values vanish; [F4] places both spaces in .
Let be the face-average Scott–Zhang map of [F1], set , and . Each coarse element patch meets only coarse cubes whose coordinate indices differ from that of by at most one. Thus at most coarse simplex patches contain a fixed point. Squaring and summing [F1] over the coarse mesh gives for a constant depending only on 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].
For each coarse cube define At every , at least one coarse cube contains , so the denominator is at least . Since , at most functions are nonzero at a point; each is -Lipschitz. The quotient rule for Lipschitz functions with denominator at least gives , , and almost everywhere. Let be its fine-grid nodal P1 interpolant. The nodal values sum to one, hence on every fine simplex; barycentric coordinates give . On a fine simplex with vertices and barycentric coordinates , The Lipschitz bound and [F6] imply for a constant depending only on dimension and shape regularity. If is nonzero on a fine simplex, one of its vertices lies within distance of , so the whole simplex lies in by the added radius . At most expanded coarse cubes contain any point: in each coordinate their side length is at most , so at most seven grid intervals can contain that coordinate. Every clipped expanded cube has side lengths between and , so its aspect ratio is at most ; hence these subdomains are uniformly shape-regular and have diameter at most .
At every fine-grid vertex, . The nodal interpolant is linear on each fine simplex, so the local functions satisfy . Each is supported in . At a boundary vertex , since ; hence every has zero boundary nodal values and belongs to by [F4]. Thus is a decomposition in the stated spaces.
Apply [F2] elementwise and : Indeed, each point belongs to at most supports, , and . Also by step 1.2.
Substitute the two estimates of step 1.2 into step 2.2 and add . With the result is This is the asserted stable-decomposition bound.
Depends on
- Finite-dimensional Schwarz subspace-correction data
- Elementwise P1 product-cutoff energy estimate
- Boundary-preserving face-average P1 interpolation
- Matching affine simplicial meshes and shape regularity
- Broken and conforming polynomial spaces on a matching mesh
- Shape regularity controls affine simplex geometry
- Zero-boundary conforming polynomials lie in W0 1p and satisfy Poincare
- The Axiom of Countable Choice ($\mathrm{AC}_\omega$)
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
- Jinchao Xu, Iterative Methods by Space Decomposition and Subspace Correction, SIAM Review 34(4) (1992) (standard reference, not scraped)
- Peter Bastian, Lecture Notes on Parallel Solution of Large Sparse Linear Systems, University of Heidelberg (2015) (standard reference, not scraped)