Alphabeta Math
RemarkRemark: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6.1-sol)
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.

Mihlin endpoints: weak (1,1), but no general strong endpoint bounds

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)). The displayed estimate in The Mihlin–Hörmander Fourier multiplier theorem gives strong Lp bounds for 1<p<∞. Its proof also identifies Tm as a Calderón–Zygmund operator with Hörmander constant at most CnA and L2 norm ∥m∥∞. Consequently Calderón–Zygmund operators are of weak type (1,1) gives the weak endpoint ∣{∣Tmf∣>λ}∣≤Cn(A+∥m∥∞)λ−1∥f∥1(f∈L1, λ>0), where A is the derivative-bound constant in the Mihlin theorem. This is a bound for the multiplier operator; it does not require the stronger principal-value and pointwise kernel hypotheses used for maximal truncations.

Remarks

No general strong L1 or L∞ bound follows. In dimension one, m(ξ)=−isgn⁡ξ satisfies the Mihlin hypotheses despite its jump at the origin, and its Hilbert transform has the weak endpoint above while the interval-indicator counterexamples refute compatible strong L1 and L∞ bounds (Strong type (1,1) fails for the Hilbert transform ↗, Calderón–Zygmund operators need not map L∞ to L∞ ↗). A jump at a nonzero frequency violates the Mihlin smoothness hypothesis; boundedness of a symbol alone does not imply a strong L1 bound.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

34 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