Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generatedaudited 2026-09-09
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.

Mollification of a complex two-step function

Example

Assume countable choice. Let ρ∈Cc∞(R;R) be nonnegative, supported in [−1,1], and satisfy ∫ρ=1. Put ρε(x)=ε−1ρ(x/ε) and f=1[0,1]+i1[1,2]. Then (ρε∗f)(x)=∫x−1xρε(t) dt+i∫x−2x−1ρε(t) dt. This is smooth, is supported in [−ε,2+ε], and tends to f in each finite Lp, with ∥ρε∗f−f∥p≤2(6ε)1/p(1≤p<∞, 0<ε<1/4). Its essential-supremum error is at least 1/2: every continuous function on R has essential-supremum distance at least 1/2 from this f.

Facts & Assumptions

Given: Countable choice, the specified real nonnegative mass-one smooth kernel, ε>0, and the displayed complex two-step function.

[F1]

Real mollifiers smooth locally integrable complex inputs, send compactly supported inputs to compactly supported outputs, and their scalings have mass one (Complex translation, convolution, approximate identities, and mollification).

[F2]

The complex Lp norm is the quantity Np induced by the modulus and is well-defined on a.e. classes (Complex Holder, Minkowski, and the quotient norm).

[F4]

A finite union has measure at most the sum of its component measures (Finite and countable subadditivity of measures).

[F5]

The nonnegative integral is monotone and positively homogeneous (Monotonicity and nonnegative homogeneity of the nonnegative integral).

[F6]

The simple integral is the value-weighted sum of the measures of disjoint fibers (The integral of a nonnegative simple function); on nonnegative simple functions it equals the nonnegative Lebesgue integral (The nonnegative integral agrees with the simple integral on simple functions).

Verification

technique · Compute interval integrals, localize the error to jump neighborhoods, and use continuity at zero for the infinity lower bound
1.1F1F3given

The input is bounded and supported in [0,2], so F3 makes it integrable and locally integrable. In the convolution integral, f(x−t) has real part one exactly for t∈[x−1,x] and imaginary part one exactly for t∈[x−2,x−1]. Integrating the two components gives the displayed formula. Their common endpoint has measure zero by F3. F1 makes the output smooth. Since ρε vanishes outside [−ε,ε], both integrals vanish for x<−ε and for x>2+ε, proving the stated support inclusion.

2.1F1F2F3F4F5F6step 1.1

For 0<ε<1/4, put U=⋃a∈{0,1,2}[a−ε,a+ε]. Outside U, the entire interval [x−ε,x+ε] stays in a constant region of f, so the unit kernel mass from F1 implies (ρε∗f)(x)=f(x). Each component of the convolution is between zero and one, because ρε≥0 and its integral is one. The same is true for each component of f, including its value at the shared endpoint. Consequently the modulus error is at most 2≤2 everywhere and is zero outside U. F3–F4 give μ(U)≤6ε. Since ∣ρε∗f−f∣p≤2p1U, F5–F6 and the definition of Np in F2 give ∥ρε∗f−f∥pp≤2pμ(U)≤2p6ε. Taking p-th roots proves the bound, and its limit is zero for each fixed finite p.

3.1F3step 1.1assume-contradischarge-contradiction∎

Let h be any continuous complex function. If ∥h−f∥∞<1/2, choose a real essential bound a<1/2 for the error. On (−1/2,0) the function f is zero, so ∣h(x)∣≤a a.e.; by continuity this inequality holds throughout that interval, since any failure persists on an open interval of positive measure by F3. Similarly ∣h(x)−1∣≤a throughout (0,1/2). Taking the respective limits at zero gives ∣h(0)∣≤a and ∣h(0)−1∣≤a, whence 1≤∣h(0)∣+∣h(0)−1∣≤2a<1, a contradiction. Thus every such h has error at least 1/2, in particular the smooth function from step 1.1.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

59 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