Alphabeta Math
PropositionStatement: Literature-sourcedProof: AI-adaptedprecheck passverified 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.

Convolution on L1(Rn) is bilinear, commutative, and associative

Statement

Assume the Axiom of Countable Choice. Convolution on L1(Rn), for n≥1, is bilinear, commutative, and associative.

Facts & Assumptions

Given: Countable Choice, n≥1, and functions in L1(Rn) for which the displayed algebra laws are to be checked.

[L3]

Convolution is the integral from Convolution of two functions on Rn.

Proof

technique · direct
1.1L1L3givenalgebra

Bilinearity follows from linearity of the integral in [L3] once [L1] guarantees absolute convergence for almost every x.

1.2L1L3L4algebra

For commutativity, fix x where convolution is defined and use the measure-preserving substitution u=x−y from [L4]: (f∗g)(x)=∫f(x−y)g(y) dy=∫g(x−u)f(u) du=(g∗f)(x). The change of variables also preserves absolute integrability, so the two sides agree almost everywhere as L1 classes.

1.3L1L2L4algebra

For associativity, Tonelli and translation invariance give ∭∣f(x−y−z)g(z)h(y)∣ dx dy dz=∥f∥1∥g∥1∥h∥1<∞. Thus for almost every x the double integral is absolutely convergent; [L2] permits interchange of y,z, and the two orders yield ((f∗g)∗h)(x) and (f∗(g∗h))(x) respectively. Representative independence follows from [L1].

2.1step 1.1step 1.2step 1.3∎

Therefore convolution is bilinear, commutative, and associative on L1(Rn) under the stated Countable Choice.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

51 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