Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedaudited 2026-09-22
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.

Laplace resolvents of a unitary group

Statement

Assume Countable Choice and Dependent Choice. Let U be a strongly continuous one-parameter unitary group on H with infinitesimal generator G, and let λ>0. Then Q±(λ)x=0eλtU(±t)xdt is a Bochner integral depending linearly and boundedly on x, with Q±(λ)1/λ and ranQ±(λ)D(G); moreover (λG)Q±(λ)=I,Q±(λ)(λG)=I on D(G), and Q+(λ)+Q(λ)=2λQ+(λ)Q(λ).

Facts & Assumptions

[A1]

Strong measurability means pointwise almost-everywhere norm approximation by measurable simple functions. Such a function is Bochner integrable when its norm is integrable, and ff. The integral is the limit of integrals of simple approximations in integral norm (Strongly measurable Banach-valued function, Banach-valued simple function and integral, Bochner-integrable function, Bochner integrability criterion, Bochner integral norm inequality).

[A2]

Bounded linear maps commute with Bochner integrals and Bochner dominated convergence holds under Countable Choice (Bounded linear maps commute with Bochner integration, Bochner dominated convergence theorem, The Axiom of Countable Choice (ACω)).

[A5]

Lebesgue measurability and measure are invariant under translation (Lebesgue outer measure, Lebesgue measurability and Lebesgue measure are unchanged by translation).

Proof

technique · direct

Given: Countable Choice, Dependent Choice, a strongly continuous unitary group U with generator G, and λ>0.

1.1

For either sign put Fx(t)=eλtU(±t)x on [0,). It is continuous. For integer n1, approximate it on [0,n) by its values at the left endpoints of intervals of length 2n and put zero elsewhere. These are measurable simple functions with finite support measure, converging at every fixed t0 to Fx(t) by continuity. Thus Fx is strongly measurable. Compact Newton--Leibniz with primitive eλt/λ and the bridge in [A4] give 0Neλtdt=(1eλN)/λ. Monotone convergence as integer N gives 0eλtdt=1/λ. Since Fx(t)=eλtx, [A1] defines Q±x and gives Q±xx/λ. Linearity follows first for simple integrals and then by adding their approximating sequences in integral norm. Therefore these are bounded linear operators.

A1A3A4
1.2

For xD(G) write vh=(U(h)xx)/hGx for real h0. Norm preservation and the inner-product expansion give 0=2Revh,x+hvh2. Since a convergent family is bounded near zero, the limit gives ReGx,x=0. Hence Re(λG)x,x=λx2. If (λG)x=0, positivity of λ gives x=0; both shifts are injective. This argument requires no density or closedness theorem for G.

A3given
2.1

Translation of a Bochner integral is legitimate here: for simple integrable functions it follows termwise from [A5]; for their integral-norm limits the scalar change-of-variables identity follows first for nonnegative simple functions, then by monotone convergence, and shows that translation preserves the approximation error. Thus the simple identities pass to the Bochner integral by [A1]. Subdivision and linearity follow in the same way from simple integrals. Also h10hFx(s)dsxsup0shFx(s)x0 as h0. The tail hFx tends to Q±x, since the norm of the omitted integral is at most hx.

A1A4A5step 1.1
3.1

For the plus sign and h>0, commuting U(h) with integration and translating gives U(h)IhQ+x=eλh1hheλsU(s)xds1h0heλsU(s)xdsλQ+xx by step 2.1. To obtain the required two-sided derivative, if yH has right quotient vh=(U(h)yy)/hv, then U(h)yyh=U(h)vhv: its error is bounded by vhv+U(h)vv. Thus Q+xD(G) and (λG)Q+x=x. For V(t)=U(t), substitution s=t in the two-sided derivative definition gives D(GV)=D(G) and GV=G. Applying the proved plus-sign argument to V gives QxD(G) and (λ+G)Qx=x.

A2A3step 1.1step 2.1
4.1

For xD(G) let y=Q±(λG)x. Step 3.1 places y in D(G) and gives (λG)y=(λG)x. Injectivity from step 1.2 implies y=x, proving Q±(λG)=I on D(G). Together with step 3.1 this shows ranQ±=D(G) and both inverse identities with their stated domains.

step 3.1step 1.2
5.1

From (λ+G)Q=I obtain GQ=IλQ and (λG)Q=2λQI. Multiplication on the left by Q+ is legitimate on every vector because ranQD(G). Step 4.1 gives Q=2λQ+QQ+, hence Q++Q=2λQ+Q.

step 3.1step 4.1
6.1

The norm bound, range and inverse claims are steps 1.1, 3.1 and 4.1, and the sum identity is step 5.1. For H={0} the same formulas directly concern its unique full-domain operator; zero vectors give zero integrals. The strict condition λ>0 ensures integrability and injectivity. Countable Choice supplies the compact integration bridge and the Bochner framework; the declared Dependent Choice is not additionally needed by this proof. No half-line fundamental theorem for a merely bounded derivative is invoked.

A1A2A4step 1.1step 3.1step 1.2step 4.1step 5.1

Source notes

Schnaubelt, Lemma 1.18 and Proposition 1.20(a)-(b), printed pp.11-13, supplies the translated-integral route to the resolvent. Here unitarity proves injectivity directly, so the left inverse follows from the right inverse without any half-line scalar fundamental theorem or a prior closedness theorem for the generator. Both signs and the two-sided derivative are checked explicitly.

Depends on

Used by

Dependency tree · two levels

82 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