Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-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.

Upwind SBP-SAT transport satisfies the semidiscrete L2 energy identity

Statement

Let d≥1. If d=1, let the cells be a finite oriented interval mesh from Oriented interval meshes and broken polynomial spaces; if d≥2, let them form a finite matching affine simplicial mesh. On every cell assume diagonal-norm SBP data of Diagonal-norm summation-by-parts element data, with paired interior face nodes, equal paired weights, and opposite outward normals. Let β∈Rd be constant, and let the differentiable nodal state UK(t) solve the upwind SBP-SAT method of Upwind SBP-SAT discretization of constant transport with prescribed inflow values gF,q where bK,F:=β⋅nK,F<0. Write ωF,q for the diagonal entries of the face norm. On an interior face oriented from K− to K+, set bF=β⋅nF and [U]F,q=UF,q+−UF,q−. Let Γ+ and Γ− denote the boundary faces with positive and negative outward speed, respectively. For d=1, each face has one endpoint node and its face sum is a one-point sum. The discrete energy Eh=12∑KUKTHKUK satisfies dEhdt+12∑F interior∑qωF,q∣bF∣[U]F,q2+12∑F⊂Γ+∑qωF,qbK,FUF,q2+12∑F⊂Γ−∑qωF,q∣bK,F∣(UF,q−gF,q)2=12∑F⊂Γ−∑qωF,q∣bK,F∣gF,q2. Consequently, zero inflow data give a nonincreasing SBP norm.

Facts & Assumptions

Given: Positive diagonal SBP norm matrices, derivative and face restriction matrices satisfying the exact SBP identity, the upwind SAT sign convention, constant β, and matching interior face nodes, weights, and opposite normals.

[F1]

Diagonal-norm summation-by-parts element data: QK,ℓ+QK,ℓT=∑F⊂∂KnK,F,ℓRK,FTMK,FRK,F, with positive diagonal volume and face norms and matching face nodes and weights.

[F2]

Upwind SBP-SAT discretization of constant transport: HKU˙K+∑ℓ=1dβℓQK,ℓUK+∑FRK,FTMK,FbK,F(U^K,F−UK,F)=0 with the upwind trace at every face.

Proof

1.1F1F2algebra

Multiply the cell equation in [F2] on the left by UKT. The derivative term is 12ddt(UKTHKUK) because HK is symmetric. For each direction, the scalar identity UKTQK,ℓUK=12UKT(QK,ℓ+QK,ℓT)UK and [F1] give the face contribution 12∑FbK,FUK,FTMK,FUK,F after summing with coefficients βℓ. Including the SAT term, the cell energy equation is 12ddt(UKTHKUK)+∑F⊂∂K(bK,FU^K,FTMK,FUK,F−bK,F2UK,FTMK,FUK,F)=0.

2.1F1F2step 1.1algebra

Fix an interior face oriented from K− to K+ and a paired node q. Its paired face weights are equal by [F1]. If bF>0, both upwind traces are UF,q−, so the two contributions in step 1.1 sum to ωF,qbF2(UF,q−−UF,q+)2. If bF<0, the upwind traces are UF,q+ and the sum is ωF,q∣bF∣2(UF,q+−UF,q−)2. If bF=0, both contributions vanish.

2.2F2step 1.1algebra

At a boundary face with bK,F>0, U^K,F=UK,F, so each node contributes ωF,qbK,FUF,q2/2. When bK,F<0, U^K,F=gF,q, so the contribution is ωF,q∣bK,F∣(UF,q−gF,q)2/2−ωF,q∣bK,F∣gF,q2/2. Zero-speed faces contribute zero.

3.1givenstep 2.1step 2.2algebra∎

Sum the contributions from steps 2.1 and 2.2 over all cells. Each paired interior node appears once in the jump sum, and boundary nodes appear once in the corresponding inflow or outflow sum, yielding the displayed identity. Positivity of the face weights makes every dissipation term nonnegative; hence zero inflow data imply dEh/dt≤0.

Depends on

Used by

Dependency tree · two levels

5 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