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.
Every approximate identity converges to the identity in for
Statement
Assume the Axiom of Countable Choice.
Let be an approximate identity on . If and , then
Facts & Assumptions
Given: The Axiom of Countable Choice, an approximate identity, an exponent , and .
Approximate identities are defined in An approximate identity on .
Translation is continuous in finite ( in as , for ).
Minkowski's integral inequality and Young's inequality are available (Minkowski's integral inequality, Young's convolution inequality under Countable Choice).
Proof
Because , one may write [L1, L3, given, algebra] Applying [L3] gives
Let be arbitrary. If , then in and step [L1, L2, L3, step 1.1, choose, algebra] 1.1 gives for every . Assume now , and put . By [L2], choose so that whenever . By [L1], choose so that For such , split the integral from step 1.1 into and . The near part is at most . For the far part, [L3] gives , so Hence whenever .
Because was arbitrary, as [step 2.1] , proving the convergence in .