Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge pass (gpt-6.1-sol)
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.

Orthogonality of the lattice characters over a fundamental domain

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). Let A, Λ=AZn and F be as in Fundamental parallelotopes of a lattice tile Euclidean space with covolume volume, and let λ∗,η∗∈Λ∗. Then 1covol⁡(Λ)∫Fe2πi(λ∗−η∗)⋅x dx={1,λ∗=η∗,0,λ∗≠η∗.

Facts & Assumptions

Given: Countable Choice, an invertible real n×n matrix A, the lattice Λ=AZn with dual Λ∗=A−TZn and covolume covol⁡(Λ)=∣det⁡A∣, the fundamental parallelotope F=A((0,1]n), and λ∗,η∗∈Λ∗ (Full-rank lattices, covolume, and the dual lattice, Fundamental parallelotopes of a lattice tile Euclidean space with covolume volume).

[F2]

Change of variables: for the C1 diffeomorphism y↦Ay on the open unit box, ∫F∘g(x) dx=∣det⁡A∣∫(0,1)ng(Ay) dy for nonnegative Lebesgue measurable g (A C^1 diffeomorphism satisfies the change-of-variables formula for nonnegative Lebesgue measurable functions); the boundary F∖F∘=A((0,1]n∖(0,1)n) is the image under A of a finite union of degenerate boxes, hence a null set (A linear map T of Rn sends Lebesgue measurable sets to Lebesgue measurable sets, with λn(T[E])=∣det⁡T∣ λn(E) when T is invertible and T[E] Lebesgue null when it is not, A box in Rn with parameters ai≤bi is Lebesgue measurable of measure ∏i<n(bi−ai), whichever of its faces are included), and integrals over a null set vanish (A nonnegative integral over a null set vanishes).

[F3]

The box integral factorises: for c∈Rn, ∫(0,1]ne2πic⋅y dy=∏j=1n∫01e2πicjt dt (Fubini's theorem for L^1 functions on a sigma-finite product).

[F4]

One-dimensional character integrals: ∫01e2πirt dt=1 when r=0 and 0 when r is a nonzero integer, by the complex primitive ∫01e2πirtdt=(e2πir−1)/(2πir) (Complex integration by parts on intervals and decaying lines) together with e2πir=1 for integral r (ker⁡(exp⁡)=2πiZ, and exp⁡z=exp⁡w exactly when z−w∈2πiZ); this is the unit-cube case of the orthonormality of the characters (The trigonometric characters are orthonormal in L2 of the torus), and ∣e2πic⋅y∣=1 (exp⁡(x+iy)=ex(cos⁡y+isin⁡y), ∣exp⁡(x+iy)∣=ex, and eiπ+1=0).

Proof

technique · direct
1.1F1F2F3F4givenalgebra

Put μ=λ∗−η∗, so that c=ATμ∈Zn and e2πiμ⋅x=e2πic⋅(A−1x) [F1, F4]. The integrand has modulus one on the finite-measure set F. Apply the nonnegative substitution and null-boundary formulas of [F2] separately to the positive and negative parts of its real and imaginary parts; all four integrals are finite, so recombining them gives the complex substitution formula. Together with [F3], this yields ∫Fe2πiμ⋅x dx=∣det⁡A∣∫(0,1]ne2πic⋅y dy=∣det⁡A∣∏j=1n∫01e2πicjt dt.

1.2F4givenalgebra

Each factor is evaluated by [F4]: for cj=0 the factor is ∫011 dt=1, and for cj∈Z∖{0} it is (e2πicj−1)/(2πicj)=0 because e2πicj=1. Hence the product equals 1 when every cj=0, and 0 otherwise.

2.1step 1.1step 1.2F1given∎

Since c=ATμ, we have c=0 if and only if μ=0, by invertibility of AT [F1]. Dividing the identity of step 1.1 by covol⁡(Λ)=∣det⁡A∣, the product of step 1.2 is exactly the normalised integral, so it equals 1 when λ∗=η∗ and 0 when λ∗≠η∗. Countable Choice is inherited from the change-of-variables interface used in [F2], exactly as in the volume computation of the tiling lemma.

Depends on

Used by

Dependency tree · two levels

119 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