Alphabeta Math
RemarkRemark: Literature-sourcedProof: Not applicablePipeline-generated
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.

Semigroup sign and generator conventions

Statement

Generation and automatic exponential-bound results below are understood under the DC hypotheses of their supplier theorems.

This track consistently writes the abstract evolution equation as u′=Au+f and defines the generator by Ax=lim⁡t↓0(T(t)x−x)/t; the heat flow on a Dirichlet domain is therefore generated by A=ΔD, the Dirichlet Laplacian (the negative of the L2 operator associated with the Dirichlet energy form), not by −ΔD. Sources writing u′+Bu=0 or ut+Au=0 use B=−A or generate e−tA: Brezis's maximal-monotone chapter is stated for u′+Au=0 with A m-accretive, so its A corresponds to −A here, and Pazy-type statements u˙+Au=0 translate the same way. Resolvents are normalised as R(λ,A)=(λI−A)−1; a source using (A−λ)−1 has the opposite sign, and its resolvent equals −R(λ,A) at the same parameter, so the norms of all powers are unchanged. The contraction case ∥T(t)∥≤1 corresponds to M=1, ω=0; boundedness (M>1) is not the same as contractivity, and the general generation theorem keeps all resolvent powers.

The convention of this track. The abstract evolution equation is written u′(t)=Au(t)+f(t),u(0)=x, and the generator is defined by Ax=lim⁡t↓0(T(t)x−x)/t on its domain (Infinitesimal generator of a C0-semigroup). The resolvent is normalised as R(λ,A)=(λI−A)−1. If ∥T(t)∥≤Meωt for all t≥0, then for every real λ>ω the Laplace representation is R(λ,A)x=∫0∞e−λtT(t)x dt (Resolvent and spectrum of a closed operator on a Banach space, Laplace transform formula for the resolvent); membership in ρ(A) alone does not guarantee convergence of this integral.

Translation dictionary. A source that writes the homogeneous equation as u′+Bu=0 or ut+Au=0 is using the opposite sign: its B equals −A in this track, and its solutions are e−tB in its own notation, that is etA here. In the same way a source whose resolvent is (A−λ)−1 instead of (λI−A)−1 has the opposite shift convention; (A−λI)−1=−R(λ,A) at the same λ; its nth power is (−1)nR(λ,A)n, so its norm is unchanged. Negating the operator itself is a separate change of generator sign.

Heat flow. With this convention the Dirichlet heat flow ∂tu=Δu on a Dirichlet domain is generated by A=ΔD, the Dirichlet Laplacian (the negative of the L2 operator associated with the Dirichlet energy form), and not by −ΔD; the sign of the generator is the sign of the spatial operator in the equation, not its negative. The dissipativity used by Lumer-Phillips is therefore the inequality Re⁡⟨ΔDu,u⟩≤0 on the domain of the Dirichlet Laplacian (Infinitesimal generator of a C0-semigroup names the generator whose behaviour is being discussed), and this is the identification used downstream when the heat semigroup is realised from the Laplacian.

Contraction versus boundedness. The contraction case is the pair M=1, ω=0 of the general generation theorem; a bound with M>1 alone does not imply that the semigroup is contractive, and the general theorem keeps all resolvent power estimates, the first estimate alone guaranteeing all powers when M=1 (with exponential rescaling if ω≠0). This dictionary is the one applied when Hille-Yosida generation theorem is specialised to A=ΔD and when variation of constants is written in the form u(t)=T(t)x+∫0tT(t−s)f(s) ds.

Depends on

Used by

Dependency tree · two levels

26 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