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.
Periodic pressure Laplacian gauge, solvability, and uniform Poincare bound
Statement
Use the spaces and operators of Periodic staggered-grid velocity and pressure spaces with , , and . Then maps bijectively to itself, the kernel of on all cell arrays consists exactly of the constants, and has zero mean for every . In addition, every satisfies the resolution-independent bound
Facts & Assumptions
Given: A fixed periodic grid with , , its cell and face indexing, and the operators and mass pairings.
The pressure and velocity arrays, inner products, and operators have the staggered periodic conventions in Periodic staggered-grid velocity and pressure spaces.
For a linear map between finite-dimensional spaces, (Rank-nullity: ).
The real coordinate pairing on a finite array space is an inner product (The standard formulas on and on are inner products).
Cauchy–Schwarz holds in every real inner-product space (Cauchy–Schwarz: , with equality exactly for dependent pairs).
Proof
Reindexing the finite periodic sums gives, for every cell array and face array , In particular, when , this is , the negative-adjoint identity in the stated mass pairings.
Let . Since has mean zero, and [F3]–[F4] give the finite-sum Cauchy--Schwarz inequality For each ordered pair choose the path that changes coordinates in the order , moving forward modulo in each coordinate. It has at most directed edges. Cauchy--Schwarz along the path bounds by times the sum of squared edge differences on it.
For any cell array , applying the explicit weighted-sum identity of step 1.1 with gives If , then , so for every . Coordinate steps connect all cells of the periodic grid, hence is constant. Every constant has zero gradient, so the kernel on all cell arrays is exactly the constants.
For every , summing over cells cancels each face value once with its opposite occurrence, so has zero mean. The same is true of . Therefore restricts to a linear map . Its kernel there is zero by step 2.1, and its domain and codomain are the same finite-dimensional space.
Rank-nullity [F2] now gives ; since the image is a subspace of , the restriction is onto as well as one-to-one. Thus each mean-zero right-hand side has a unique mean-zero pressure solution.
Fix one directed edge in coordinate . For each coordinate , its value along the path is ; to use the fixed edge, is fixed and has at most choices. For each , the path still has value ; then is fixed and has at most choices. In coordinate there are at most ordered start/end pairs. Hence this edge occurs in at most paths. Summing the path bounds and dividing by yields Taking nonnegative square roots proves the stated inequality.
Depends on
- Periodic staggered-grid velocity and pressure spaces
- The standard formulas $\langle x,y\rangle=\sum_{k<n}x_k y_k$ on $\mathbb R^n$ and $\sum_{k<n}x_k\overline{y_k}$ on $\mathbb C^n$ are inner products
- Cauchy–Schwarz: $|\langle x,y\rangle|\le\|x\|\,\|y\|$, with equality exactly for dependent pairs
- Rank-nullity: $\dim_F V=\operatorname{nullity}T+\operatorname{rank}T$
Used by
- Backward-Euler incremental pressure correction on a periodic staggered grid Algorithm
- BDF2 standard and rotational incremental pressure-correction variants Algorithm
- First-order velocity accuracy for smooth periodic Stokes data Theorem
- Mass-orthogonal periodic discrete Helmholtz projection and exact incompressibility Theorem
- Well-definedness of the periodic pressure-correction solves Theorem
Cited to discharge well-definedness by Periodic staggered-grid velocity and pressure spaces.
Dependency tree · two levels
23 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
- NPTEL, Lecture 5.4: Methods based on Coupling of Pressure and Velocity (standard reference, not scraped)
- J. L. Guermond, P. Minev, and J. Shen, An overview of projection methods for incompressible flows (standard reference, not scraped)