Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)audited 2026-09-12
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.

Translation, modulation, linear dilation and reflection laws

Statement

Assume countable choice. For f∈L1(Rn;C), a,b∈Rn, and invertible real n×n matrix A, put τaf(x)=f(x−a) and Mbf(x)=e2πib⋅xf(x). Then, at every frequency, τaf^(ξ)=e−2πia⋅ξf^(ξ),Mbf^(ξ)=f^(ξ−b),f∘A^(ξ)=∣det⁡A∣−1f^(A−Tξ). Also f(−⋅)^(ξ)=f^(−ξ) and f‾^(ξ)=f^(−ξ)‾.

Facts & Assumptions

Given: The stated data and The Axiom of Countable Choice (ACω); translation has the convention of Translation of a function on Rn.

[F1]

The transform is defined on classes at every frequency (The integral transform is representative independent).

[F2]

The complex L1 change-of-variables formula for a C1 diffeomorphism uses the absolute Jacobian determinant, under countable choice (A C^1 diffeomorphism satisfies the change-of-variables formula for L^1 functions).

Proof

1.1F1F2given

The maps y↦y+a and x↦Ax are C1 diffeomorphisms of the open set Rn, with determinants 1 and det⁡A≠0. Applying F2 to ∣f∣ proves ∥τaf∥1=∥f∥1 and ∥f∘A∥1=∣det⁡A∣−1∥f∥1; unit modulus gives ∥Mbf∥1=∥f‾∥1=∥f∥1. These operations preserve null equivalence, by the same substitution applied to indicators of null sets (or directly by its null-set proof). Countable choice is precisely the assumption inherited from this Lebesgue substitution interface.

2.1F2F3step 1.1

Substituting x=y+a in the absolutely convergent translation integral gives ∫f(y)e−2πi(y+a)⋅ξ dy=e−2πia⋅ξf^(ξ). Combining exponential factors in the modulation integral gives e−2πix⋅(ξ−b), hence the modulation formula.

3.1F1F2step 1.1step 2.1∎

Substituting y=Ax gives x⋅ξ=y⋅A−Tξ and dx=∣det⁡A∣−1dy, proving the dilation formula. For A=−I its determinant has absolute value one, proving reflection even when orientation is reversed. Finally conjugate the componentwise integral for f^(−ξ): conjugation commutes with its real and imaginary integrals and sends e2πix⋅ξ to e−2πix⋅ξ. This proves the last identity. All equalities are pointwise because F1 gives absolute convergence at each frequency.

Depends on

Dependency tree · 2 levels

Sources