Alphabeta Math
CounterexampleConstruction: Literature-sourcedVerification: AI-adaptedPipeline-generatedjudge pass (gpt-6.1-sol)
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 N-indexed chain). Let X=C2 over the complex field (The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i) have the maximum product norm ∥(z1,z2)∥∞=max⁡(∣z1∣,∣z2∣) (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∈B(X) (A bounded linear operator between normed spaces) be the matrix A=(−140−1),D(A)=X. For M=25/16 and ω=0, every λ>0 lies in ρ(A) and the first resolvent estimate ∥R(λ,A)∥∞≤Mλ 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 n=2 Hille--Yosida estimate required by Hille-Yosida generation theorem fails at λ=3: ∥R(3,A)2∥∞=316>25144=M32. The bounded-operator exponential semigroup generated by A (The exponential series of a bounded operator) is etA=e−t(14t01), and ∥eA/2∥∞=3e−1/2>2516. Thus a first-power resolvent estimate alone does not ensure the semigroup bound with the same M>1 and ω=0.

Refuted claim. For every M≥1, a closed densely defined operator whose positive real resolvent set contains (0,∞) and satisfies only ∥R(λ,A)∥≤M/λ for all λ>0 necessarily generates a strongly continuous semigroup bounded by M.

Facts & Assumptions

Given: Dependent Choice; X=C2 with the maximum product norm, A=(−140−1) on D(A)=X, and M=25/16, ω=0.

[F1]

The maximum product norm on C2 is ∥(z1,z2)∥∞=max⁡(∣z1∣,∣z2∣), 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 C (The complex numbers as R[x]/(x2+1), with the real embedding and imaginary unit i).

[F2]

Every finite-dimensional normed space over C is Banach (Every finite-dimensional normed space is Banach).

[F3]

The operator norm is the least constant C such that ∥Bz∥∞≤C∥z∥∞ for every z∈X (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 z=(1,1) whenever the largest row sum is positive.

[F4]

For λ∈ρ(A), the resolvent is R(λ,A)=(λI−A)−1 (Resolvent and spectrum of a closed operator on a Banach space).

[F5]

If a closed densely defined operator generates a semigroup with ∥T(t)∥≤Meωt, then every λ>ω satisfies ∥R(λ,A)n∥≤M(λ−ω)−n for every integer n≥1 (Hille-Yosida generation theorem).

[F6]

A bounded operator A on a Banach space generates the strongly continuous exponential semigroup etA (The exponential series of a bounded operator).

[F7]

The real exponential constant satisfies e<3 (The elementary numerical bound 2<e<3).

[F8]

Matrix multiplication is given by the finite coordinate sums of Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes.

Proof

technique · direct matrix calculations
1.1F1F2F3given

Let N=(0100). Then N2=0 and A=−I+4N by matrix multiplication (Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes). The space X is Banach by [F1, F2]. The maximum-row-sum estimate gives ∥Az∥∞≤5∥z∥∞, so A is bounded; its domain is all of X, hence dense, and continuity shows its graph is closed.

1.2F3F6F7F8algebra

Since A=−I+4N, the two summands commute and N2=0. The exponential series gives etA=e−te4tN=e−t(I+4tN)=e−t(14t01). For t≥0, its maximum row sum is (1+4t)e−t. At t=1/2 this is 3e−1/2=3/e. By [F7], e<3, hence 3/e>3/3=3; moreover 3>25/16 because 3>(25/16)2. Thus ∥eA/2∥∞>25/16=M.

2.1F3F4F8step 1.1algebra

For every λ>0, λI−A=(λ+1−40λ+1),R(λ,A)=((λ+1)−14(λ+1)−20(λ+1)−1) Their product is I, so every such λ is in ρ(A). For a vector z with ∥z∥∞≤1, the first row of Rz has modulus at most (λ+1)−1+4(λ+1)−2 and the second at most (λ+1)−1; the vector (1,1) attains the first row sum. Thus ∥R(λ,A)∥∞=1λ+1+4(λ+1)2. Writing x=λ/(λ+1)∈(0,1) gives λ∥R(λ,A)∥∞=x+4x(1−x)=5x−4x2=2516−4(x−58)2≤2516. This proves the first-power estimate for every λ>0.

3.1F3F5F8step 2.1algebra

At λ=3, R(3,A)=(1/41/401/4),R(3,A)2=(1/161/801/16). The maximum row sum of the square is 3/16, attained on (1,1), so ∥R(3,A)2∥∞=316=27144>25144=M32. Therefore the required second-power estimate fails.

4.1F5step 3.1step 1.2∎

The direct second-power failure in step 3.1 also rules out a semigroup with generator A and the prescribed bound by [F5]. The example therefore shows that the first-power resolvent estimate alone is insufficient for a general bound with M>1.

Depends on

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.

Sources