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.
A first resolvent estimate does not ensure the prescribed semigroup bound
Statement refuted
Assume Dependent Choice (The axiom of dependent choice: a relation in which every element is related to something admits an -indexed chain). Let over the complex field (The complex numbers as , with the real embedding and imaginary unit ) have the maximum product norm (The standard product norms on a finite product of normed spaces, Real and complex scalar conventions for normed spaces); this finite-dimensional normed space is Banach (Every finite-dimensional normed space is Banach). Let (A bounded linear operator between normed spaces) be the matrix For and , every lies in and the first resolvent estimate holds (Resolvent and spectrum of a closed operator on a Banach space, The operator norm as the least bound and as the unit-sphere or unit-ball supremum). But the Hille--Yosida estimate required by Hille-Yosida generation theorem fails at : The bounded-operator exponential semigroup generated by (The exponential series of a bounded operator) is and Thus a first-power resolvent estimate alone does not ensure the semigroup bound with the same and .
Refuted claim. For every , a closed densely defined operator whose positive real resolvent set contains and satisfies only for all necessarily generates a strongly continuous semigroup bounded by .
Facts & Assumptions
Given: Dependent Choice; with the maximum product norm, on , and , .
The maximum product norm on is , with complex scalar homogeneity read using the complex modulus (The standard product norms on a finite product of normed spaces, Real and complex scalar conventions for normed spaces). The complex scalar field is (The complex numbers as , with the real embedding and imaginary unit ).
Every finite-dimensional normed space over is Banach (Every finite-dimensional normed space is Banach).
The operator norm is the least constant such that for every (The operator norm as the least bound and as the unit-sphere or unit-ball supremum). For a matrix with nonnegative entries, the upper bound by its maximum row sum is attained on whenever the largest row sum is positive.
For , the resolvent is (Resolvent and spectrum of a closed operator on a Banach space).
If a closed densely defined operator generates a semigroup with , then every satisfies for every integer (Hille-Yosida generation theorem).
A bounded operator on a Banach space generates the strongly continuous exponential semigroup (The exponential series of a bounded operator).
The real exponential constant satisfies (The elementary numerical bound ).
Matrix multiplication is given by the finite coordinate sums of Rectangular matrix multiplication and the identity matrix , including zero-sized shapes.
Proof
Let . Then and by matrix multiplication (Rectangular matrix multiplication and the identity matrix , including zero-sized shapes). The space is Banach by [F1, F2]. The maximum-row-sum estimate gives , so is bounded; its domain is all of , hence dense, and continuity shows its graph is closed.
Since , the two summands commute and . The exponential series gives For , its maximum row sum is . At this is . By [F7], , hence ; moreover because . Thus .
For every , Their product is , so every such is in . For a vector with , the first row of has modulus at most and the second at most ; the vector attains the first row sum. Thus Writing gives This proves the first-power estimate for every .
At , The maximum row sum of the square is , attained on , so Therefore the required second-power estimate fails.
The direct second-power failure in step 3.1 also rules out a semigroup with generator and the prescribed bound by [F5]. The example therefore shows that the first-power resolvent estimate alone is insufficient for a general bound with .
Depends on
- The axiom of dependent choice: a relation in which every element is related to something admits an $\mathbb{N}$-indexed chain
- Every finite-dimensional normed space is Banach
- The elementary numerical bound $2<e<3$
- A bounded linear operator between normed spaces
- The complex numbers as $\mathbb R[x]/(x^2+1)$, with the real embedding and imaginary unit $i$
- Rectangular matrix multiplication and the identity matrix $I_n$, including zero-sized shapes
- The operator norm as the least bound and as the unit-sphere or unit-ball supremum
- The standard product norms on a finite product of normed spaces
- Resolvent and spectrum of a closed operator on a Banach space
- The exponential series of a bounded operator
- Real and complex scalar conventions for normed spaces
- Hille-Yosida generation theorem
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
53 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.