Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generated
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.

Uniform periodic, infinite, and Dirichlet grid conventions

Definition

Use N for the natural-number index set (including zero) (The natural numbers N (von Neumann)), R for the real scalar field (The real numbers), and C with its real embedding and modulus (The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i, Real and imaginary parts, complex conjugation, and modulus).

Let N≥2, h>0, k>0, and tn=nk. For the finite periodic grid put JN={0,…,N−1} and reduce every shifted index modulo N. A periodic grid function is a map v:JN→C, with weighted norm ∥v∥2,h=(h∑j=0N−1∣vj∣2)1/2. The infinite uniform grid has indices j∈Z and positions xj=jh. On the periodic and infinite grids define (D+v)j=vj+1−vjh,(D−v)j=vj−vj−1h,(D0v)j=vj+1−vj−12h,(Δhv)j=vj+1−2vj+vj−1h2. Use the inner product linear in its first entry, ⟨p,q⟩2,h=h∑j=0N−1pjqj‾,⟨D+p,D+q⟩e,h=h∑j=0N−1(D+p)j(D+q)j‾, where the indices in D+ are reduced periodically, and set ∥D+p∥e,h2=⟨D+p,D+p⟩e,h. The same definitions apply to real-valued grid functions.

For a finite interval of length L=Nh, use physical nodes xj=jh with indices j=0,…,N. On its edges j=0,…,N−1 define (D+v)j=(vj+1−vj)/h, and on interior nodes j=1,…,N−1 use (Δhv)j=(vj+1−2vj+vj−1)/h2. At the right endpoint define (D−v)N=(vN−vN−1)/h. For interior-node arrays r,s indexed by j=1,…,N−1 and edge arrays p,q indexed by j=0,…,N−1, define ⟨r,s⟩h=h∑j=1N−1rjsj‾,∥r∥h2=⟨r,r⟩h,⟨p,q⟩e,h=h∑j=0N−1pjqj‾. Set ∥p∥e,h2=⟨p,p⟩e,h. For nodal grid functions, interior pairings and norms mean restriction to the interior nodes. Thus ∥⋅∥h is a norm on the zero-endpoint subspace, but only a seminorm on the full nodal space. Dirichlet grid functions have prescribed endpoint values; when they are zero, the interior norm and edge inner product above are the ones used for the wave energy.

All statements below distinguish these periodic, infinite, and finite-interval index sets. Periodic Fourier calculations are not boundary estimates for the finite-interval grid.

Depends on

Used by

Dependency tree · two levels

17 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