Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-adaptedverified 2026-09-23 (gpt-6-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.

Young's convolution inequality under Countable Choice

Statement

Assume the Axiom of Countable Choice. Let 1≤p,q,r≤∞ satisfy

1r=1p+1q−1.

If f∈Lp(Rn) and g∈Lq(Rn), then the convolution f∗g is defined almost everywhere and satisfies

∥f∗g∥r≤∥f∥p∥g∥q.

Facts & Assumptions

Given: Countable Choice (The Axiom of Countable Choice (ACω)), exponents p,q,r as displayed, and Lp classes f,g.

[L1]

Under Countable Choice, Lebesgue measure is the completion of Borel measure and measurable functions have Borel representatives almost everywhere (L(Rn) is exactly the completion of the restriction of λn to the Borel sets, A function measurable for a completion is almost everywhere equal to one measurable for the original sigma-algebra).

[L2]

Borel representatives make (x,y)↦f~(x−y)g~(y) and its sections measurable (Borel representatives make the convolution integrand Borel measurable).

[L4]

Proof

technique · direct
1.1L1L2L5given

Under the given Countable Choice premise, choose finite-valued Borel representatives f~,g~ using [L1], applying it to real and imaginary parts. Alter values on their Borel null exceptional sets to zero. By [L2], H(x,y)=f~(x−y)g~(y) and ∣H∣ are product-measurable. Translation and reflection preserve the Lp norms of f~(x−⋅) for every x, including essential suprema. If either norm is zero, the corresponding representative vanishes almost everywhere; for every x, H(x,⋅)=0 almost everywhere by [L5]. Its integral and the claimed inequality are then zero. Hence assume both norms are positive.

1.2L2L3L5given

Suppose r<∞. The exponent identity implies p,q<∞ and r≥p,q. Tonelli and translation invariance give ∫x∫y∣f~(x−y)∣p∣g~(y)∣q dy dx=∥f∥pp∥g∥qq<∞. Therefore Ax:=∫y∣f~(x−y)∣p∣g~(y)∣q dy is finite for almost every x.

2.1L2L4L5step 1.1

If r=∞, then 1/p+1/q=1. For each x, [L4] applied to f~(x−⋅) and g~ gives ∫∣H(x,y)∣ dy≤∥f∥p∥g∥q<∞. Thus convolution exists for every x for these representatives, is measurable as an integral of product-measurable sections, and its essential supremum obeys the bound.

2.2L3L4step 1.1step 1.2algebra

Fix such an x. Factor ∣H∣ as A(y)B(y)C(y) with A=(∣f~(x−y)∣p∣g~(y)∣q)1/r,B=∣f~(x−y)∣1−p/r,C=∣g~(y)∣1−q/r. If r=p or r=q, the corresponding zero-power factor means the constant 1. The three Holder exponents are r, pr/(r−p) and qr/(r−q), with ∞ at a zero denominator; their reciprocal sum is 1. Applying generalized Holder to BC and then Holder to A(BC) (including endpoint forms) yields ∫∣H(x,y)∣ dy≤Ax1/r∥f∥p1−p/r∥g∥q1−q/r. This proves absolute convergence for almost every x. Tonelli applied to the positive and negative parts of the real and imaginary components of H makes x↦∫H(x,y) dy measurable on this full-measure domain; define it as zero elsewhere. Raise the inequality to the rth power, integrate in x, and use step 1.2 to obtain ∥f∗g∥rr≤∥f∥pr−p∥g∥qr−q∥f∥pp∥g∥qq=∥f∥pr∥g∥qr, interpreting a zero exponent as a factor 1.

3.1L2L5step 2.1step 2.2∎

If another pair of Borel representatives is chosen, each differs from the first on a Borel null set. For every fixed x, the first-factor difference is confined to a reflected translate of that null set and the second-factor difference to its original null set. By [L5] the two section products agree almost everywhere in y. Both integrals exist on a common full-measure set by the preceding bounds, and [L5] makes them equal there. Thus f∗g is a well-defined Lr class, and steps 2.1 and 2.2 prove the asserted bound.

Depends on

Used by

Dependency tree · two levels

81 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