Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-adaptedprecheck 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.

Periodic pressure Laplacian gauge, solvability, and uniform Poincare bound

Statement

Use the spaces and operators of Periodic staggered-grid velocity and pressure spaces with d≥1, N≥2, and h=1/N. Then Δh=DhGh maps Qh bijectively to itself, the kernel of Δh on all cell arrays consists exactly of the constants, and Dhv has zero mean for every v∈Vh. In addition, every q∈Qh satisfies the resolution-independent bound ∥q∥Qh≤d ∥Ghq∥Mh.

Facts & Assumptions

Given: A fixed periodic grid with d≥1, N≥2, its cell and face indexing, and the operators Gh,Dh,Δh and mass pairings.

[F1]

The pressure and velocity arrays, inner products, and operators have the staggered periodic conventions in Periodic staggered-grid velocity and pressure spaces.

[F2]

For a linear map between finite-dimensional spaces, dim⁡V=dim⁡ker⁡T+dim⁡im⁡T (Rank-nullity: dim⁡FV=nullity⁡T+rank⁡T).

Proof

1.1F1algebra

Reindexing the finite periodic sums gives, for every cell array q and face array v, (Ghq,v)Mh=hd∑i,j(qj+ei−qj)vi,jh=−hd∑jqj∑ivi,j−vi,j−eih=−hd∑jqj(Dhv)j. In particular, when q∈Qh, this is (Ghq,v)Mh=−(q,Dhv)Qh, the negative-adjoint identity in the stated mass pairings.

1.2F1F3F4givenalgebra

Let q∈Qh. Since q has mean zero, qx=N−d∑y∈JN(qx−qy), and [F3]–[F4] give the finite-sum Cauchy--Schwarz inequality ∥q∥Qh2≤N−2d∑x,y∈JN∣qx−qy∣2. For each ordered pair (x,y) choose the path that changes coordinates in the order 1,…,d, moving forward modulo N in each coordinate. It has at most dN directed edges. Cauchy--Schwarz along the path bounds ∣qx−qy∣2 by dN times the sum of squared edge differences on it.

2.1F1step 1.1

For any cell array q, applying the explicit weighted-sum identity of step 1.1 with v=Ghq gives hd∑jqj(Δhq)j=−(Ghq,Ghq)Mh≤0. If Δhq=0, then Ghq=0, so qj+ei=qj for every i,j. Coordinate steps connect all cells of the periodic grid, hence q is constant. Every constant has zero gradient, so the kernel on all cell arrays is exactly the constants.

3.1F1step 2.1algebra

For every v, summing Dhv over cells cancels each face value once with its opposite occurrence, so Dhv has zero mean. The same is true of Δhq=Dh(Ghq). Therefore Δh restricts to a linear map Qh→Qh. Its kernel there is zero by step 2.1, and its domain and codomain are the same finite-dimensional space.

4.1F2step 3.1algebra

Rank-nullity [F2] now gives dim⁡im⁡Δh=dim⁡Qh; since the image is a subspace of Qh, the restriction is onto as well as one-to-one. Thus each mean-zero right-hand side has a unique mean-zero pressure solution.

5.1F1step 1.2algebra∎

Fix one directed edge in coordinate i. For each coordinate r<i, its value along the path is yr; to use the fixed edge, yr is fixed and xr has at most N choices. For each r>i, the path still has value xr; then xr is fixed and yr has at most N choices. In coordinate i there are at most N2 ordered start/end pairs. Hence this edge occurs in at most Nd+1 paths. Summing the path bounds and dividing by N2d yields ∥q∥Qh2≤dN2−d∑i,j∣qj+ei−qj∣2=d∥Ghq∥Mh2. Taking nonnegative square roots proves the stated inequality.

Depends on

Used by

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