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.

Fourier transform of a finite complex Borel measure

Statement

Assume countable choice. Let μ be a complex Borel measure on Rn, n1, with finite total variation. Then μ^(ξ):=e2πixξdμ(x) is a bounded uniformly continuous function and supμ^μ(Rn).

Facts & Assumptions

Proof

1.1

First repair the positive integral used to construct the complex-measure integral. Augment every finite disjoint nonnegative-simple display by its complement with coefficient 0. Pairwise intersections of two augmented displays partition the space and carry equal coefficients on nonempty cells, so finite additivity and 0(+)=0 prove representation independence. Common refinements give simple addition and monotonicity; scalar zero is direct and positive scalars are termwise. Supremum over simple minorants and the sets {ujcs}, 0<c<1, give monotone convergence; increasing simple approximations give nonnegative additivity and finite L1 linearity after positive/negative and real/imaginary decomposition. Fatou follows by applying MCT to infjmvj; applying Fatou to 2guju proves dominated convergence when ujgL1. For a canonical nonzero-level complex simple function, the triangle inequality and the definition of variation give sdμsdμ. Passing to L1(μ) simple limits using this bound constructs the complex integral, makes it independent of the approximants, and preserves the same variation bound and finite linearity. Each exponential is bounded Borel with modulus one, so it is integrable against μ. The locally reconstructed complex integral exists and gives μ^(ξ)μ(Rn); no Radon–Nikodym representation is needed.

F1F3givenconstruct
2.1

By the addition law and the locally proved variation bound, μ^(ξ+h)μ^(ξ)e2πixh1dμ(x), independently of ξ. Under the stated countable choice the sequential Euclidean limit criterion applies; the locally proved dominated convergence, with majorant 2 on this finite measure space, makes this bound tend to zero as h tends to zero. Hence the transform is uniformly continuous. Countable choice also covers the near-maximizing partition selections in the total-variation additivity proof. Finite variation was assumed; no general finiteness theorem, RN or Hahn decomposition is used.

F1F2F3step 1.1

Depends on

Used by

Dependency tree · two levels

39 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