Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck 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.

Coercive discrete energy for the Dirichlet leapfrog wave scheme

Statement

For the homogeneous Dirichlet recurrence of Centered leapfrog wave recurrence with Dirichlet and periodic rows, let 0<ν=ck/h<1, Vn=(Un+1−Un)/k, and Uˉn=(Un+1+Un)/2. Define En+1/2=12∥Vn∥h2+c22⟨D+Un+1,D+Un⟩e,h. Then En+1/2 is independent of n and En+1/2≥1−ν22∥Vn∥h2+c22∥D+Uˉn∥e,h2. Consequently it is a positive quadratic form on adjacent zero-boundary states. For mesh families with fixed wave speed c>0, fixed interval length L, and ν≤ν0<1, it controls the interior state and its discrete velocity with constants independent of h.

Facts & Assumptions

Given: A fixed wave speed c>0, mesh sizes h,k>0, homogeneous Dirichlet endpoint values, and the source-free centered leapfrog recurrence.

[F1]

The recurrence is δt2Un=c2ΔhUn, with U0n=UNn=0 (Centered leapfrog wave recurrence with Dirichlet and periodic rows).

[F2]

For zero endpoint values, ⟨u,−Δhv⟩h=⟨D+u,D+v⟩e,h; this is symmetric in u,v (One-dimensional discrete summation by parts with boundary terms).

[F3]

If w0=wN=0 on length L=Nh, then ∥w∥h≤L∥D+w∥e,h (A finite-grid Poincare inequality for zero endpoint values).

Proof

1.1F1algebra

In the quadratic term, D+Un+1=D+Uˉn+k2D+Vn and D+Un=D+Uˉn−k2D+Vn. Expanding their real edge inner product gives En+1/2=12∥Vn∥h2+c22∥D+Uˉn∥e,h2−c2k28∥D+Vn∥e,h2.

2.1givenstep 1.1algebra

For any zero-endpoint grid function v, (vj+1−vj)2≤2vj+12+2vj2 and summing over edges gives ∥D+v∥e,h2=1h∑j=0N−1(vj+1−vj)2≤4h2∥v∥h2. Apply this to Vn, and use ν=ck/h, in step 1.1 to obtain the asserted lower bound. Since 1−ν2>0, zero energy forces Vn=0 and D+Uˉn=0.

3.1F3step 2.1algebra

A zero-endpoint grid function with D+w=0 is constant across all edges and therefore zero. Hence step 2.1 shows En+1/2=0 only when Vn=0 and Uˉn=0, equivalently Un+1=Un=0. For uniform state control, [F3] bounds ∥Uˉn∥h by L∥D+Uˉn∥e,h, and Un+1,Un=Uˉn±(k/2)Vn; when ν≤ν0<1, the lower-bound coefficients and k≤ν0L/(Nc)≤ν0L/c are uniform in the mesh.

4.1F1F2step 1.1algebra∎

Let δt0Un=(Un+1−Un−1)/(2k). Taking the interior inner product of δt2Un+c2(−Δh)Un=0 with δt0Un, the first term is (∥Vn∥h2−∥Vn−1∥h2)/(2k). By [F2], the second is c22k(⟨D+Un+1,D+Un⟩e,h−⟨D+Un,D+Un−1⟩e,h). Their sum is (En+1/2−En−1/2)/k=0. Thus the energy is conserved.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

4 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