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

Second-order consistency of staggered periodic sampling

Statement

Use Periodic staggered-grid velocity and pressure spaces with h=1/N. For a smooth periodic vector field u∈C4(Td;Rd), define Rhu by sampling component i at each face centre xj+hei/2. For a smooth periodic scalar p∈C3(Td), define Rhp by sampling at cell centres xj. Put ∥r∥Q~h=(hd∑jrj2)1/2 for all cell arrays r; this agrees with ∥r∥Qh on Qh. Then uniformly for N≥2, ∥DhRhu−Rh(∇⋅u)∥Q~h+∥AhRhu−Rh(−Δu)∥Mh+∥GhRhp−Rh(∇p)∥Mh≤Ch2, where C depends only on d and the suprema of the displayed fields' derivatives through orders 4 for u and 3 for p. Here the sampling of a vector field is facewise componentwise. For any g∈C2(Td) with zero integral, the cell-centred or face-centred midpoint samples have discrete mean whose absolute value is at most Cdh2∥D2g∥∞.

Facts & Assumptions

Given: The unit torus, the staggered periodic grid and operators, and the bounded derivatives in the statement.

[F1]

Cell and face centres, discrete differences, and weighted mass norms are defined in Periodic staggered-grid velocity and pressure spaces.

[F2]

The unit torus is partitioned into the Nd periodic grid cells of side h=1/N, centred at cell sampling points. Smooth fields on Td are used through their smooth 1-periodic lifts to Rd, including across periodic seams.

[F3]

If g has continuous derivatives through order m+1, Taylor's theorem gives a pointwise remainder g(x)−∑j=0mg(j)(c)(x−c)j/j!=g(m+1)(ξ)(x−c)m+1/(m+1)! (Taylor's Lagrange remainder follows from repeated Rolle steps).

[F4]

Differentiating the line restriction t↦g(x+tz) uses the ordinary chain rule (Sum, product, quotient, and chain rules from difference quotients).

Proof

1.1F1F2F3givenalgebra

For g∈C3(Td), Taylor's formula with Lagrange remainder at the midpoint and [F3] with m=2 give g(x+hei/2)−g(x−hei/2)=h ∂ig(x)+r,∣r∣≤h3∥∂i3g∥∞/24. The same midpoint formula, with the two cell centres surrounding face xj+hei/2, gives (GhRhp)i,j=∂ip(xj+hei/2)+O(h2), with the pointwise error bounded by h2∥∂i3p∥∞/24.

1.2F1F2F3givenalgebra

For g∈C4(Td), [F3] with m=3 at x gives g(x+hei)−2g(x)+g(x−hei)=h2∂i2g(x)+r, where the two fourth-order Lagrange remainders have total absolute value at most h4∥∂i4g∥∞/12. Apply this in every coordinate to ui at its face centre. It follows that (AhRhu)i,j=−(Δui)(xj+hei/2)+O(h2), with the error bounded by h2∑ℓ∥∂ℓ4ui∥∞/12.

2.1F1F2F3step 1.1algebra

Applying the midpoint formula to component ui at cell centre xj shows, by [F3] with m=2, (DhRhu)j=∑i∂iui(xj)+rj,∣rj∣≤h224∑i∥∂i3ui∥∞. Thus the discrete divergence differs pointwise from the sampled continuous divergence by O(h2).

3.1F1F2step 1.1step 2.1step 1.2algebra

Each pointwise error bound in steps 1.1–1.2 is uniform. The weighted mass of the grid contains hdNd=1 total cell volume and there are d velocity components. Therefore the corresponding mass norms are bounded by the same constants (or their finite d-component sum) times h2. Combining the divergence, vector Laplacian and pressure gradient bounds proves the first claim.

4.1F1F2F3F4givenalgebra∎

On each cell centred at xj, fix x and put z=x−xj and ψ(t)=g(xj+tz) for 0≤t≤1. By [F3] with m=1 and [F4], g(x)=g(xj)+∇g(xj)⋅z+rj(x) with ∣rj(x)∣≤Cd∥D2g∥∞∣z∣2. The linear term integrates to zero on the centred cell, so the difference between hdg(xj) and ∫Cjg is at most Cdhd+2∥D2g∥∞. Summing the Nd cells yields ∣hd∑jg(xj)−∫Tdg(x) dx∣≤Cdh2∥D2g∥∞. The face centres for any fixed component likewise centre a translated partition into cells of side h, so the same estimate holds for their samples. If the integral vanishes, this gives the stated discrete-mean bound.

Depends on

Used by

Dependency tree · two levels

8 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