Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedprecheck passjudge 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.

The variation-of-constants integral is continuous for integrable forcing

Statement

Assume Countable Choice (The Axiom of Countable Choice (ACω)) for Lebesgue time integration. Let (T(t))t≥0 be a strongly continuous semigroup on a Banach space X with constants M≥1, ω∈R and ∥T(t)∥≤Meωt (Exponential bound for a C0-semigroup). Let T0>0 and let f:(0,T0)→X be Bochner integrable with ∫0T0∥f(s)∥ ds<∞ (Bochner-integrable function). Then uf(t):=∫0tT(t−s)f(s) ds(0≤t≤T0) is a well-defined element of X, the map t↦uf(t) is continuous on [0,T0], and ∥uf(t)∥≤MT0eωt∫0t∥f(s)∥ ds for a constant MT0 depending only on M,ω,T0 and the local bound of ∥T∥ on [0,T0].

Facts & Assumptions

Given: Countable Choice; A strongly continuous semigroup (T(t))t≥0 on a Banach space X with ∥T(t)∥≤Meωt for some M≥1, ω∈R (Exponential bound for a C0-semigroup); T0>0; a Bochner integrable f:(0,T0)→X with ∫0T0∥f(s)∥ ds<∞; and uf(t):=∫0tT(t−s)f(s) ds.

[F1]

The exponential bound makes K:=sup⁡0≤r≤T0∥T(r)∥ finite, since ∥T(r)∥≤Meωr≤Memax⁡(ω,0)T0. [thm-exponential-bound-for-a-c-zero-semigroup]

[F2]

Bochner integrability of f supplies integrable simple functions g with ∫(0,T0)∥f−g∥ arbitrarily small and a strong-measurability approximation (Bochner-integrable function, Strongly measurable Banach-valued function); a strongly measurable h with ∫∥h∥<∞ is Bochner integrable (Bochner integrability criterion).

[F3]

Linearity of the Bochner integral and the norm inequality ∥∫Eh∥≤∫E∥h∥ (Linearity of the Bochner integral, Bochner integral norm inequality, Bochner-integrable function).

[F4]

Absolute continuity of the scalar integral: for every ε>0 there is δ>0 with ∫E∥f∥<ε whenever λ(E)<δ (Absolute continuity of the integral).

[F5]

The orbit map of every vector is continuous on [0,∞) and T(h)→I strongly: T(h)x→x for every x (Strongly continuous semigroup).

Proof

technique · direct: well-definedness from the Bochner criterion, then a uniform estimate $\int\|(T(h)-I)f\|\to0$ obtained from a single simple approximation, and a splitting of the increment
1.1F1F2F3F5

Fix t∈[0,T0]. For each measurable simple approximation gn=∑jxnj1Enj to f, the map s↦T(t−s)gn(s) is strongly measurable: for each of its finitely many values xnj, approximate the continuous curve s↦T(t−s)xnj uniformly by step functions on equal partitions of [0,t], then multiply by 1Enj. Choose a partition size by its least integer giving error below 1/n on all finitely many curves. The resulting measurable simple function approximates T(t−s)gn(s) uniformly within 1/n. As gn(s)→f(s) off a null set and ∥T(t−s)∥≤K, these approximants converge pointwise there to T(t−s)f(s). Its norm is bounded by K∥f(s)∥, so [F2] gives Bochner integrability and [F3] gives ∥uf(t)∥≤Memax⁡(−ω,0)T0eωt∫0t∥f(s)∥ ds.

1.2F1F2F5

Claim: ρ(h):=∫0T0∥(T(h)−I)f(s)∥ ds→0 as h↓0. Given ε>0, choose an integrable simple function g=∑j=1mxj1Ej with ∫0T0∥f−g∥<ε/(2(K+1)) by [F2]; then ρ(h)≤(K+1)∫∥f−g∥+∑jλ(Ej)∥(T(h)−I)xj∥, and the finite sum tends to 0 as h↓0 because T(h)xj→xj for each j by [F5]. Hence lim sup⁡hρ(h)≤ε/2<ε, and ε was arbitrary.

2.1F3step 1.1

Increment splitting: for 0≤t<t+h≤T0, linearity [F3] and the semigroup law give uf(t+h)−uf(t)=∫0t+hT(t+h−s)f(s) ds−∫0tT(t−s)f(s) ds=∫tt+hT(t+h−s)f(s) ds+∫0tT(t−s)(T(h)−I)f(s) ds, where in the last term T(t−s+h)=T(t−s)T(h).

3.1F1F3F4step 1.2step 2.1

Taking norms in [step 2.1] and using K from [F1] and the norm inequality [F3]: ∥uf(t+h)−uf(t)∥≤K∫tt+h∥f(s)∥ ds+Kρ(h)→0 as h↓0, the first term by absolute continuity [F4] and the second by [step 1.2]. The backward increment is bounded by K∫t−ht∥f∥+Kρ(h) by the same splitting with t−h in place of t, hence also tends to 0.

4.1F1F3F4step 3.1

Continuity at the endpoints: ∥uf(h)−uf(0)∥≤K∫0h∥f∥→0 by [F3], [F4], and at t=T0 the backward bound of [step 3.1] applies; hence t↦uf(t) is continuous on the closed interval [0,T0], and the estimate of [step 1.1] is the stated bound with MT0:=Memax⁡(−ω,0)T0.

5.1step 1.1step 1.2step 3.1step 4.1∎

The claims of the statement follow: uf is well defined, continuous on [0,T0], and bounded by MT0eωt∫0t∥f∥; no compactness of the range of f and no choice beyond the declared Bochner framework was used.

Depends on

Used by

Dependency tree · two levels

36 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