Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-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.

Carleson operator and measurable linearisation

Definition

Assume The Axiom of Choice for the countable-choice hypotheses of the Schwartz Fourier and integrability suppliers. Use the transform f^(ξ)=f(x)e2πixξdx of Fourier transform on complex L1 classes, with absolute convergence and representative independence from The integral transform is representative independent. For fS(R) as in Schwartz space and its seminorms, Fourier transform acts continuously on Schwartz space and Schwartz derivatives are integrable give f,f^L1. Define Taf(x)=af^(ξ)e2πixξdξ,CRf(x)=supaRTaf(x). These integrals converge absolutely at every x and satisfy Taf(x)f^1. The cutoff function is continuous in a: since f^ is bounded, Taf(x)Tbf(x)f^ab. Hence the supremum equals the supremum over rational a.

For fixed a, Taf is continuous in x. To check this without an unproved interchange, first truncate its absolutely integrable frequency tail beyond ξ>R to make that tail contribution to any difference less than a prescribed epsilon. On the remaining interval, e2πixξe2πiyξ2πRxy, so the integral difference is bounded by 2πRxyf^1. Thus the countable rational supremum is measurable.

For a nonempty finite list of rational cutoffs q1,,qM, put CMf=max1jMTqjf. Choose the least maximizing index j(x); its level sets are finite intersections of measurable comparison sets, so af(x)=qj(x) is measurable. Then CMf(x)=Taf(x)f(x). For a fixed measurable selector a, the map fTa(x)f(x) is linear; when the selector was chosen from f, it is frozen before invoking a uniform operator estimate. No single selector is claimed to attain the unrestricted real supremum.

For h(x)=Taf(x)f(x) put u(x)=h(x)/h(x) when h(x)0 and u(x)=1 otherwise. This is a measurable unimodular phase and hu=h. Thus, on a measurable finite-measure testing set E, pairing h with u1E gives Eh. The phase at zero is fixed explicitly. All finite selectors use least-index rules; AC is inherited from the stated analytic suppliers, not from selecting maximizers.

Depends on

Used by

Dependency tree · two levels

25 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