Alphabeta Math
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.

✓ 10 results · all verified · 1 also independently AI-judged
Every result on this page is machine-checked by a proof checker and read in full and owner-audited; the judge is an additional, independent cross-model AI review of the proofs. The 9 not AI-judged were verified by owner audit (typically over a confirmed judge false positive), not failures.

Density Separability and Convolution in Lp — Examples

1 · Prerequisites

2 · Summary

The companion page collects the concrete models behind the main page: the tent-function convolution, explicit mollification pictures, concrete dense families and separated families, the Gaussian approximate identity, and the endpoint failures the A page warns about. The L2∗L2 counterexample is written with a correct tail-decay witness rather than the invalid local-singularity sketch from the design prose.

3 · Logical flowchart

4 · Definitions, theorems and proofs

None yet.

5 · Examples, counterexamples and false statements

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passverified 2026-09-23 (gpt-6-sol)Open item page →

1[0,1]∗1[0,1] is the tent function

Example

Let f:=1[0,1] on R. Then

(f∗f)(x)=∫R1[0,1](x−y)1[0,1](y) dy

is the tent function

(f∗f)(x)={0,x≤0,x,0≤x≤1,2−x,1≤x≤2,0,x≥2.

Facts & Assumptions

Given: The indicator f=1[0,1].

Verification

technique · direct
1.1givenalgebra

For fixed x, the integrand is 1 exactly when y∈[0,1]∩[x−1,x] and zero otherwise. This bounded-support integrand is integrable for every x, and (f∗f)(x) is the length of that overlap interval.

2.1step 1.1algebra

If 0≤x≤1, the overlap is [0,x], so (f∗f)(x)=x. If [step 1.1, algebra] 1≤x≤2, the overlap is [x−1,1], so (f∗f)(x)=2−x. For x≤0 or x≥2, there is no overlap, so (f∗f)(x)=0.

3.1step 2.1∎

The explicit formula is positive precisely on (0,2), so its support is [0,2]=[0,1]+[0,1], as claimed by the displayed tent function.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passverified 2026-09-08 (Codex)Open item page →

Mollifying 1[0,1] at two scales

Example

Assume Countable Choice (The Axiom of Countable Choice (ACω)).

Let φ∈Cc∞(R) satisfy ∫φ=1 and supp⁡(φ)⊆[−1,1]. For f:=1[0,1] and ε>0,

(f∗φε)(x)=∫01φε(x−y) dy=∫(x−1)/εx/εφ(u) du.

For ε=1/4 and ε=1/8, the graph is 0 outside [−ε,1+ε], equals 1 on [ε,1−ε], and can differ from these constant pieces only in [−ε,ε] and [1−ε,1+ε], each of width 2ε. Thus the possible transition intervals have width 1/2 at scale 1/4 and width 1/4 at scale 1/8. Actual transitions may be narrower if the kernel has smaller support. A signed kernel need not produce monotone transitions or values between zero and one.

Facts & Assumptions

Given: Countable Choice, a unit-mass smooth bump φ supported in [−1,1], and f=1[0,1].

[L1]

Mollifier families are approximate identities (A unit-mass smooth bump generates an L1 approximate identity).

Verification

technique · direct
1.1L1L3givenalgebra

The substitution u=(x−y)/ε has absolute Jacobian 1/ε and reverses the interval endpoints, giving the displayed integral by [L3]. Since the scaled kernel is supported in [−ε,ε], the original integral is zero when x∉[−ε,1+ε].

2.1L1step 1.1algebra

If x∈[ε,1−ε], then x/ε≥1 and (x−1)/ε≤−1. Hence the integration interval contains the whole support of φ, and the value is exactly 1. For 0<ε<1/2, all remaining possible variation is confined to the two disjoint intervals [−ε,ε] and [1−ε,1+ε], each of width 2ε.

3.1L2step 2.1givenalgebra∎

By [L2] the convolution is smooth. Substituting ε=1/4 and ε=1/8 into step 2.1 gives the claimed widths 1/2 and 1/4. Support containment need not be equality, and no sign condition on φ was imposed, so the calculation asserts neither exact transition width nor monotonicity.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-09-01Open item page →

A concrete countable dense family in L2[0,1]

Example

Assume the Axiom of Countable Choice.

Inside L2([0,1]), the finite rational linear combinations of indicators of rational half-open intervals (a,b]⊆[0,1] form a countable dense family.

Facts & Assumptions

Given: The Axiom of Countable Choice and the space L2([0,1]).

[L1]

Rational box-step functions form a countable dense subset of Lp(Rn) for every finite p (Rational box-step functions form a countable dense subset of Lp(Rn) for 1≤p<∞).

Verification

technique · direct
1.1L1given

Specialize [L1] to n=1 and p=2. The rational boxes in one dimension are [L1, given] the rational half-open intervals (a,b], and restricting to those contained in [0,1] still leaves a countable family.

2.1step 1.1algebra

Extend a function on [0,1] by 0 outside [0,1]. Then approximation in [step 1.1, algebra] L2(R) by rational interval step functions supported in [0,1] restricts back to approximation in L2([0,1]).

3.1step 2.1∎

Therefore the stated family is an explicit countable dense subset of [step 2.1] L2([0,1]).

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-09-01Open item page →

The family {1[0,t]:t∈[0,1]} is 1-separated in L∞[0,1]

Example

The family {1[0,t]:t∈[0,1]} is 1-separated in L∞([0,1]).

Facts & Assumptions

Given: Two parameters s,t∈[0,1] with s≠t.

[L1]

L∞([0,1]) is not separable, and the proof runs through this explicit family (L∞[0,1] is not separable).

Verification

technique · direct
1.1L1givenalgebra

Assume s<t. Then [L1, given, algebra] 1[0,t]−1[0,s] equals 1 on (s,t], a set of positive measure.

2.1step 1.1algebra

Hence [step 1.1, algebra] ∥1[0,t]−1[0,s]∥∞=1. The same conclusion holds when t<s by symmetry.

3.1L1step 2.1∎

So any two distinct members of the family are distance 1 apart, which is [L1, step 2.1] exactly the one-separated property used in [L1].

ExampleConstruction: AI-adaptedVerification: AI-adaptedverified 2026-09-23 (gpt-6-sol)Open item page →

Young's inequality on an L1∗L2 pair

Example

Let f=g=1[0,1] on R. Then f∈L1(R), g∈L2(R), and the convolution satisfies

∥f∗g∥2≤∥f∥1∥g∥2=1.

In fact ∥f∗g∥2=(∫01x2 dx+∫12(2−x)2 dx)1/2=23.

Facts & Assumptions

Given: The indicator f=g=1[0,1].

Verification

technique · direct
1.1givenalgebra

For each x, the convolution integral is the length of [0,1]∩[x−1,x]; direct interval overlap gives [given, algebra] (f∗g)(x)={x,0≤x≤1,2−x,1≤x≤2,0,otherwise.

2.1step 1.1algebra

Therefore [step 1.1, algebra] ∥f∗g∥22=∫01x2 dx+∫12(2−x)2 dx=13+13=23.

3.1step 2.1∎

Since ∥f∥1=1 and ∥g∥2=1, this gives [step 2.1] ∥f∗g∥2=2/3≤1=∥f∥1∥g∥2.

ExampleConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-09-01Open item page →

The Gaussian family is an L1 approximate identity

Example

For ε>0, define the normalized Gaussian on Rn by

Gε(x):=(2πε2)−n/2e−∣x∣2/(2ε2).

Then (Gε)ε>0 is an L1 approximate identity.

Facts & Assumptions

Given: The Gaussian family (Gε).

[L1]

An L1 approximate identity is defined in An L1 approximate identity on Rn.

Verification

technique · direct
1.1L1givenalgebra

The change of variables u=x/ε gives [L1, given, algebra] ∫RnGε(x) dx=∫Rn(2π)−n/2e−∣u∣2/2 du=1, so every kernel has mass one and ∥Gε∥1=1.

2.1step 1.1algebra

For every δ>0, [step 1.1, algebra] ∫∣x∣>δGε(x) dx=∫∣u∣>δ/ε(2π)−n/2e−∣u∣2/2 du⟶0 as ε→0+, because the integration region escapes to infinity against an integrable Gaussian tail.

3.1L1step 1.1step 2.1∎

Steps 1.1 and 2.1 verify the defining clauses of [L1], so the Gaussian [L1, step 1.1, step 2.1] family is an L1 approximate identity even though it is not compactly supported.

False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-09-01Open item page →

FALSE: Cc(Rn) is dense in L∞(Rn)

Statement

False claim. Cc(Rn) is dense in L∞(Rn).

Facts & Assumptions

Given: The L∞-closure theorem for Cc(Rn).

[L1]

The closure of Cc(Rn) in L∞ is exactly C0(Rn) (The L∞-closure of Cc(Rn) is C0(Rn), not all of L∞(Rn)).

Refutation

technique · direct
1.1L1

The constant function 1 belongs to L∞(Rn) but not to [L1] C0(Rn), because it does not vanish at infinity.

2.1L1step 1.1∎

By [L1], every L∞-limit of compactly supported continuous functions [L1, step 1.1] lies in C0(Rn). Therefore 1 cannot lie in the closure of Cc(Rn), and the claim is false.

False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passjudge pass (gpt-5.6-terra)audited 2026-09-01Open item page →

FALSE: Lp(μ) is separable for every measure μ and every 1≤p<∞

Statement

False claim. For every measure space (X,A,μ) and every 1≤p<∞, the space Lp(μ) is separable.

Facts & Assumptions

Given: An uncountable set X with counting measure.

[L1]

The general separability theorem requires the Axiom of Countable Choice, sigma-finiteness, and a countably generated sigma-algebra (If μ is sigma-finite and A is countably generated, then Lp(μ) is separable for 1≤p<∞).

[L2]

Counting measure is a measure, and separability means having a countable dense subset (Counting measure on an arbitrary set, Counting measure is a measure, Separability: the existence of an at most countable dense subset).

Refutation

technique · direct
1.1L2givenalgebra

For each x∈X, let ex:=1{x}. Since [L2, given, algebra] μ({x})=1, each ex lies in Lp(μ). If x≠y, then ∥ex−ey∥pp=∣1∣p+∣−1∣p=2, so ∥ex−ey∥p=21/p.

2.1L1L2step 1.1algebra

Thus the uncountable family {ex:x∈X} is pairwise [L1, L2, step 1.1, algebra] 21/p-separated. No countable set can be dense in a metric space containing uncountably many disjoint balls of radius 21/p/3. So this Lp(μ) is not separable, contradicting the claim.

3.1L1step 2.1∎

Therefore the unrestricted statement is false; [L1] records the correct [L1, step 2.1] hypothesis ledger.

False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-09-01Open item page →

FALSE: translation is continuous in L∞

Statement

False claim. Translation is continuous in L∞(Rn).

Facts & Assumptions

Given: The indicator of the unit interval in one dimension.

Refutation

technique · direct
1.1L1givenalgebra

Let f:=1[0,1] on R. For every h≠0, the [L1, given, algebra] functions f and τhf differ by 1 on a set of positive measure: for 0<h<1, for instance, on (1,1+h] one has τhf=1 and f=0.

2.1step 1.1algebra

Therefore [step 1.1, algebra] ∥τhf−f∥∞=1 for every h≠0, so the norm does not tend to 0 as h→0.

3.1L1step 2.1∎

Hence translation is not continuous in L∞, which is exactly why [L1, step 2.1] [L1] stops at p<∞.

False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passverified 2026-09-23 (gpt-6-sol)Open item page →

FALSE: if f,g∈L1(Rn), then f∗g(x) is defined for every x

Statement

False claim. If f,g∈L1(Rn), then (f∗g)(x) is defined for every x∈Rn.

Facts & Assumptions

Given: The one-dimensional functions f(x)=g(x):={1∣x∣(log⁡(e/∣x∣))2,0<∣x∣<1/2,0,otherwise.

Refutation

technique · direct
1.1givenalgebra

The function x↦1/(∣x∣(log⁡(e/∣x∣))2) is integrable near 0 by the substitution u=log⁡(e/∣x∣), whose tail is a constant multiple of ∫∞u−2 du. Hence f,g∈L1(R).

2.1step 1.1algebra

At x=0 one has [step 1.1, algebra] ∫R∣f(−y)g(y)∣ dy=∫−1/21/2dy∣y∣2(log⁡(e/∣y∣))4. The single point y=0 is irrelevant to Lebesgue integrability, so it is enough to inspect the punctured interval (0,1/2). There the substitution u=log⁡(e/y) gives y=e1−u and dy=−e1−udu, hence ∫01/2dyy2(log⁡(e/y))4=∫log⁡(2e)∞eu−1u4 du=∞. Thus (f∗g)(0) is not defined as an absolutely convergent Lebesgue integral.

3.1step 1.1step 2.1∎

Therefore the convolution of two L1 functions need not be defined at every point.

CounterexampleConstruction: AI-adaptedVerification: AI-adaptedverified 2026-09-23 (gpt-6-sol)Open item page →

Two L2 functions can have convolution outside L2

Statement refuted

Every convolution of two L2(R) functions again belongs to L2(R).

Facts & Assumptions

Given: The one-dimensional function f(x)=g(x):=(1+∣x∣)−3/4.

Counterexample

technique · direct
1.1givenalgebra

Since [given, algebra] ∫R(1+∣x∣)−3/2 dx<∞, the functions f and g lie in L2(R).

2.1step 1.1algebra

For each fixed x, the convolution integral is finite: on a bounded y-interval its continuous integrand is bounded, while for ∣y∣>2∣x∣+2 one has 1+∣x−y∣≥(1+∣y∣)/2, so the integrand is at most 23/4(1+∣y∣)−3/2, an integrable tail. For x>2, [step 1.1, algebra] (f∗g)(x)=∫R(1+∣x−y∣)−3/4(1+∣y∣)−3/4 dy≥∫1x−1x−3/4x−3/4 dy=x−2x3/2. So for large x, (f∗g)(x)≥c x−1/2 for some c>0.

3.1step 2.1algebra∎

But [step 2.1, algebra] ∫2∞x−1 dx=∞, so the lower bound from step 2.1 shows f∗g∉L2(R). Hence the statement refuted above is false.

False statementConstruction: AI-adaptedVerification: AI-adaptedprecheck passaudited 2026-09-01Open item page →

FALSE: the Borel-representative discipline in convolution is unnecessary because continuous precomposition always preserves Lebesgue measurability

Statement

False claim. The Borel-representative discipline in the convolution construction is unnecessary because Lebesgue measurability is preserved under every continuous precomposition.

Facts & Assumptions

Given: The convolution measurability seam and the published continuous- precomposition counterexample.

[L1]

The convolution page deliberately fixes Borel representatives before forming the product-space integrand (Borel representatives make the convolution integrand Borel measurable, Convolution on L1(Rn) is independent of the chosen Borel representatives).

[L2]

Continuous precomposition need not preserve Lebesgue measurability (FALSE: composing a Lebesgue measurable function with a continuous map preserves measurability).

Refutation

technique · direct
1.1L2

Fact [L2] gives a continuous map T and a Lebesgue measurable function [L2] u such that u∘T is not Lebesgue measurable. So the slogan "Lebesgue measurability survives every continuous change of variables" is false.

2.1L1step 1.1

The displayed claim relies on exactly that false slogan. Even if some [L1, step 1.1] particular maps used in convolution behave better, the blanket justification for dropping the Borel-representative discipline recorded in [L1] fails.

3.1step 2.1∎

Therefore the displayed claim is false.

Sources