Alphabeta Math
ExampleConstruction: AI-adaptedVerification: AI-adaptedPipeline-generatedprecheck pass
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.

Abstract smoothing does not imply a spatial derivative without a PDE realisation

Statement

Assume Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an N-indexed chain) for the cited integral and semigroup suppliers.

Put N≥1:={n∈N:n≥1}. Let X=ℓ2(N≥1) and let A be the diagonal operator with D(A)={x∈ℓ2:∑nn4∣xn∣2<∞}, (Ax)n=−n2xn, which is self-adjoint and sectorial of angle π/2 (Self-adjoint nonpositive operators generate bounded analytic semigroups). Its semigroup is T(t)x=(e−n2txn)n≥1, and for every t>0 and every m≥1 one has T(t)x∈D(Am) with AmT(t)x=((−n2)me−n2txn)n for every x∈ℓ2, since sup⁡n≥1n2me−n2t≤sup⁡s≥0sme−st=(m/(et))m is finite. In particular x=(1/n)n∉D(A) satisfies T(t)x∈D(Am) for every m and every t>0. Nevertheless ℓ2(N≥1) carries no spatial variables: Am is an abstract sequence operator, and the inclusion T(t)ℓ2⊆⋂mD(Am) is a purely operator-theoretic smoothing statement. Only after identifying the abstract sequence operator with a differential operator through an elliptic-regularity theorem does D(Am) name Sobolev derivatives (Abstract generator-domain smoothing becomes spatial regularity only after domain identification).

Facts & Assumptions

Given: The complex Hilbert space X=ℓ2(N≥1) with inner product ⟨x,y⟩=∑nxnyn‾, norm ∥x∥=(∑n∣xn∣2)1/2 and standard orthonormal basis en; the diagonal operator A with D(A)={x∈X:∑nn4∣xn∣2<∞} and (Ax)n=−n2xn; the diagonal family T(t)x=(e−n2txn)n≥1 for t≥0; and the iterated domains D(Am)={x∈D(Am−1):Ax∈D(Am−1)}.

[L1]

ℓ2(N≥1) is a complex Hilbert space with the standard orthonormal basis: the trigonometric system is an orthonormal basis of L2(T;C) (The trigonometric system is complete in L2 of the torus, L2 with the integral pairing is a Hilbert space), and the Fourier coefficient map of an orthonormal basis is a linear isometry onto the corresponding ℓ2 space, which is therefore complete (A Hilbert space with a given orthonormal basis is ℓ2 of the index set, Square-summable families on an arbitrary index set and the space ℓ2(I), The Axiom of Countable Choice (ACω)).

[L2]

A self-adjoint densely defined operator with ⟨Ax,x⟩≤0 is sectorial of angle π/2 with vertex 0 and generates a bounded analytic semigroup of angle π/2 (Self-adjoint nonpositive operators generate bounded analytic semigroups).

[L3]

For a sectorial operator the generated semigroup satisfies T(t)X⊆D(Am) for every t>0, m≥1, and the contour semigroup is the unique exponentially bounded strongly continuous semigroup with that generator (Smoothing estimates for the semigroup generated by a sectorial operator, The generator of the contour semigroup is the sectorial operator, Abstract parabolic smoothing for mild solutions).

[L4]

The graph domains D(Am) carry the graph norm and are recursively defined; the remark on domain identification records that they acquire a spatial meaning only through an elliptic-regularity theorem (Abstract generator-domain smoothing becomes spatial regularity only after domain identification, A bounded linear operator between normed spaces, The operator norm as the least bound and as the unit-sphere or unit-ball supremum).

Verification

technique · direct
1.1L1givenalgebra

The diagonal operator is self-adjoint and nonpositive. D(A) contains the finitely supported vectors, hence is dense in X by [L1]; for x,y∈D(A) the series ⟨Ax,y⟩=∑n(−n2)xnyn‾ converges absolutely and equals ⟨Ay,x⟩‾ because the diagonal entries are real, so A is symmetric. If y∈D(A∗), the adjoint identity tested against each en∈D(A) gives (A∗y)n=−n2yn for every n; since A∗y∈X=ℓ2(N≥1) and (en) is an orthonormal basis by [L1], Parseval gives ∑nn4∣yn∣2=∥A∗y∥2<∞, so y∈D(A). Symmetry gives the reverse inclusion D(A)⊆D(A∗), hence D(A∗)=D(A) and A is self-adjoint. Finally ⟨Ax,x⟩=−∑nn2∣xn∣2≤0 for every x∈D(A).

1.2L1givenalgebra

The diagonal family is the semigroup generated by A. For t≥0 one has ∥T(t)x∥2=∑ne−2n2t∣xn∣2≤e−2t∥x∥2, so T(t) is a contraction for t≥0; the functional equation is coefficientwise and strong continuity at 0 follows from ∥T(t)x−x∥2=∑n(1−e−n2t)2∣xn∣2→0 by dominated convergence; for x∈D(A) the difference quotients satisfy ∥(T(t)x−x)/t−Ax∥2=∑n(1−e−n2tn2t−1)2n4∣xn∣2→0 by dominated convergence, since ∣1−e−ss−1∣≤1 for s≥0 and ∑nn4∣xn∣2<∞, so A is contained in the generator; conversely, if x lies in the domain G of the generator then for each n continuity of the n-th coordinate functional gives Gxn=lim⁡t↓0(e−n2t−1)xn/t=−n2xn, so ∑nn4∣xn∣2=∥Gx∥2<∞ and x∈D(A) with Ax=Gx; hence the generator of T is exactly A.

2.1step 1.1step 1.2L2L3givenalgebra

The abstract semigroup is this diagonal semigroup. By [step 1.1] A is self-adjoint and nonpositive, so [L2] makes A sectorial of angle π/2 and the generator of a bounded analytic semigroup, while [step 1.2] exhibits T as an exponentially bounded strongly continuous semigroup with generator A; by the uniqueness in [L3] these semigroups coincide, so the diagonal family T(t)x=(e−n2txn) is the semigroup generated by A, which is the assertion of the statement.

3.1step 2.1L3givenalgebra

The iterated domains and the smoothing identities. By induction from [step 1.2] the graph domain is D(Am)={x∈X:∑nn4m∣xn∣2<∞} with (Amx)n=(−n2)mxn: the case m=1 is the definition of D(A), and if the description holds for m then Amx∈D(A) exactly when ∑nn4∣(Amx)n∣2=∑nn4m+4∣xn∣2<∞; consequently for t>0 the vector T(t)x has AmT(t)x=((−n2)me−n2txn)n and ∥AmT(t)x∥2=∑nn4me−2n2t∣xn∣2≤sup⁡n(n2me−n2t)2∥x∥2<∞, so T(t)x∈D(Am) and ∥AmT(t)∥≤sup⁡n≥1n2me−n2t≤sup⁡s≥0sme−st=(m/(et))m; this reproduces the abstract membership T(t)X⊆D(Am) of [L3] with an explicit constant.

4.1step 3.1givenalgebra

The witness is not in D(A) but is smoothed. For x=(1/n)n≥1 one has ∑n∣xn∣2=∑nn−2<∞, so x∈X, while ∑nn4∣xn∣2=∑nn2=+∞, so x∉D(A) by [step 3.1]; for every t>0 and every m≥1, however, ∑nn4me−2n2tn−2<∞ because the exponential decay dominates every polynomial, so T(t)x∈D(Am) with the series of [step 3.1], and the smoothing thus raises the abstract regularity of a vector that is not even in the domain of A.

5.1step 4.1L4givenalgebra∎

No spatial derivative is produced. The statements of steps 3.1 and 4.1 are identities between sequences: Am acts by the multiplier (−n2)m and the index n carries no spatial or differential meaning, so the inclusion T(t)ℓ2⊆⋂mD(Am) is purely operator-theoretic; by [L4] the graph domain D(Am) acquires the interpretation of Sobolev derivatives only after an elliptic-regularity theorem identifies A with a differential operator, and no such identification is present for this diagonal sequence operator, which is why the example is the companion witness to that remark.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

99 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