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

The mean-zero Fourier distribution solves the neutral periodic Poisson equation

Statement

Assume Countable Choice and a neutral finite point-source configuration on the cell AZ3 of Neutral point sources and Fourier data on a three-dimensional torus. Put u^(0)=0,u^(k)=4πV∣κk∣2∑i=1nqie−iκk⋅xi(k≠0). The polynomially bounded sequence u^(k) defines a periodic distribution u by Fourier pairing. It is the unique mean-zero periodic distribution satisfying −Δu=4πρ.

Facts & Assumptions

Given: Countable Choice, A∈GL3(R), a finite configuration (xi,qi)i=1n with ∑iqi=0, and a smooth periodic test function φ.

[A1]

The proof uses Countable Choice through the smooth Fourier pairing and the lattice periodic uniqueness supplier (The Axiom of Countable Choice (ACω)).

[F1]

The source distribution satisfies ⟨ρ,φ⟩=∑iqiφ(xi) and its Fourier coefficient is V−1∑iqie−iκk⋅xi; distributions are defined by continuous linear pairings on smooth periodic tests (Neutral point sources and Fourier data on a three-dimensional torus).

[F2]

Every polynomially bounded coefficient sequence defines a continuous periodic distribution by V∑kakφ^(−k); smooth Fourier series converge to the test function in every smooth seminorm (Smooth torus test functions have rapidly convergent Fourier pairings).

[F3]

Since ek(x)=eiκk⋅x, one has −Δek=∣κk∣2ek and the zero character is the constant function 1 (Neutral point sources and Fourier data on a three-dimensional torus).

Proof

technique · direct
1.1givenA1F1F2algebra

Define u^ by the displayed coefficients. For k≠0, ∣u^(k)∣≤4πQV∣κk∣2,Q=∑i∣qi∣, so the sequence is polynomially bounded. Under Countable Choice [A1], [F2] therefore defines a continuous periodic distribution u with exactly these coefficients; its zero Fourier coefficient is zero by construction.

1.2givenA1F1F2F3algebra

For a smooth periodic φ, use Countable Choice [A1], [F3], and the coefficient pairing of [F2] to compute ⟨u,−Δφ⟩=V∑k≠0u^(k)∣κk∣2φ^(−k)=4π∑iqi∑k≠0e−iκk⋅xiφ^(−k). The sums converge absolutely by [F2]. Reindex the full Fourier series by j=−k; [F2] gives ∑k∈Z3e−iκk⋅xiφ^(−k)=φ(xi). The omitted zero term contributes φ^(0)∑iqi=0 by neutrality. Hence ⟨u,−Δφ⟩=4π∑iqiφ(xi)=4π⟨ρ,φ⟩, proving −Δu=4πρ.

2.1A1F2F3algebra∎

If u1,u2 are two mean-zero periodic distribution solutions, let h=u1−u2. Testing −Δh=0 against each character gives ∣κk∣2h^(k)=0 for every k≠0. Thus all nonzero Fourier coefficients of h vanish, and its zero coefficient vanishes because both solutions have mean zero. Under [A1], the smooth Fourier partial sums converge in every smooth seminorm by [F2]; continuity of h as a distribution then makes h vanish on every smooth test function. Therefore u1=u2.

Depends on

Used by

Dependency tree · two levels

18 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