Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-generated‡ sources checked 2026-09-30‡ not proved here
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.

‡ Recorded, not proved here. This statement is included so the library can refer to it honestly, with a citation to the literature. It is not proved anywhere in this library: the track that would prove it has not been developed here yet.

Fefferman ball multiplier obstruction

Remark

Assume Countable Choice for the library Fourier and Lp conventions, and let n≥2. Fix a Euclidean ball B⊆Rn and let 1B be its indicator, a bounded measurable symbol. Recorded boundary result, not proved here: in the usual range 1≤p<∞ the ball indicator is an Lp(Rn) Fourier multiplier in the sense of Lp Fourier multiplier and its norm only at p=2.

The p=2 half is elementary on this page. Since ∣1B∣≤1 everywhere, Exact L2 Fourier multiplier norm gives the unique bounded L2 extension of the Schwartz-core multiplier with symbol 1B and its operator norm is exactly 1. The case p≠2 is the deep part: Fefferman proved in Theorem 1 of The multiplier problem for the ball that for n>1 the ball multiplier is bounded on Lp if and only if p=2. Williams records the same statement in Remark 3.12 and refers to Grafakos §10.1 for the argument.

This remark is a bibliographic leaf: it records the exact limitation of the L2 criterion of Exact L2 Fourier multiplier norm and supplies no proof or dependency for any later item. No Kakeya or geometric measure-theoretic argument is reproduced here, and no Lp multiplier claim other than the recorded quotation is asserted. Countable Choice is inherited from the cited L2 multiplier interface (The Axiom of Countable Choice (ACω)).

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

24 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