Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (gpt-5.6-terra)
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 fL1(Rn;C), a,bRn, and invertible real n×n matrix A, put τaf(x)=f(xa) and Mbf(x)=e2πibxf(x). Then, at every frequency, τaf^(ξ)=e2πiaξf^(ξ),Mbf^(ξ)=f^(ξb),fA^(ξ)=detA1f^(ATξ). 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.1

The maps yy+a and xAx are C1 diffeomorphisms of the open set Rn, with determinants 1 and detA0. Applying F2 to f proves τaf1=f1 and fA1=detA1f1; unit modulus gives Mbf1=f1=f1. 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.

F1F2given
2.1

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

F2F3step 1.1
3.1

Substituting y=Ax gives xξ=yATξ and dx=detA1dy, 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 e2πixξ. This proves the last identity. All equalities are pointwise because F1 gives absolute convergence at each frequency.

F1F2step 1.1step 2.1

Depends on

Used by

Dependency tree · two levels

35 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