Alphabeta Math
ExampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-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.

A one-frequency Fourier layer on the circle

Example

On the one-dimensional torus, let v(x)=sin⁡(2πx) and use a Fourier cutoff K≥1. If the spectral matrices satisfy R1=R−1=1 and all other retained matrices vanish, then the spectral part of the layer returns v exactly. If the cutoff is K=0, its spectral part is zero because v^(0)=0. These finite-mode computations illustrate the layer definition and make no approximation or universality claim for the full Fourier neural-operator architecture.

Facts & Assumptions

Given: v(x)=sin⁡(2πx) on T=R/Z and the Fourier coefficient convention in the Fourier neural-operator layer definition.

[F1]

The Fourier coefficient of e2πikx at index j is 1 if j=k and 0 otherwise, by integrating the exponential over one period.

Verification

Proof strategy: compute the two nonzero Fourier coefficients.

1.1givenF1algebra

Using sin⁡(2πx)=(e2πix−e−2πix)/(2i) and [F1], v^(1)=1/(2i), v^(−1)=−1/(2i), and every other coefficient is zero.

2.1step 1.1algebra∎

With R1=R−1=1, the retained sum is e2πix/(2i)−e−2πix/(2i)=v(x). At cutoff zero, the sum has only the k=0 term, which vanishes because v^(0)=0.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

6 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