Alphabeta Math
TheoremStatement: Literature-sourcedProof: AI-generatedPipeline-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.

Positive age-renewal evolution and L1 data stability

Statement

For Linear age-structured renewal transport problem, let β∞=∥β∥∞. The solution map Sμ,β(t):n0↦n(t,⋅) is linear and positive, and

∥Sμ,β(t)n0∥1≤eβ∞t∥n0∥1.

If n,n~ use possibly different nonnegative bounded coefficients (μ,β) and (μ~,β~) and initial data n0,n~0, put δ=∥μ−μ~∥∞+∥β−β~∥∞ and β~∞=∥β~∥∞. Then

∥n(t)−n~(t)∥1≤eβ∞t(∥n0−n~0∥1+δteβ~∞t∥n~0∥1).

Facts & Assumptions

Given: The two age-renewal models and the characteristic mild solutions supplied by Characteristic formula and Volterra solution for age renewal transport.

[F1]

Linear age-structured renewal transport problem: μ,β are nonnegative and bounded, the inflow is B(t)=∫β(a)n(t,a) da, and survival is the exponential along an age characteristic.

[F2]

Characteristic formula and Volterra solution for age renewal transport: each nonnegative initial density has one nonnegative mild solution, given by the characteristic formula and Volterra birth equation.

[F3]

Gronwall's integral inequality with variable and constant coefficients: if u(t)≤a(t)+∫0tb(s)u(s) ds with nonnegative continuous u,b and nondecreasing a, then u(t)≤a(t)e∫0tb.

Proof

1.1F1F2algebra

For nonnegative initial data, sums and nonnegative scalar multiples of the solutions in [F2] satisfy the corresponding characteristic formulas and renewal equations in [F1]; uniqueness in [F2] therefore makes S(t) additive and nonnegatively homogeneous on L+1. For arbitrary real f∈L1, put f+=max⁡{f,0}, f−=max⁡{−f,0} and define S(t)f=S(t)f+−S(t)f−. If also f=p−q with p,q≥0, then p+f−=q+f+, so cone additivity gives S(t)p−S(t)q=S(t)f+−S(t)f−. This independence of decomposition gives additivity on L1, and nonnegative homogeneity together with S(t)(−f)=−S(t)f gives real linearity. The extension obeys the same characteristic formulas and renewal relation by subtraction; it agrees with [F2] on L+1 and is positive there.

1.2F1F2algebra

Integrating the two characteristic branches in [F2] gives N(t)=∫0∞n0(x)S(x,t) dx+∫0tB(t−a)S(0,a) da. Bounded μ and continuous B permit differentiation under these integrals; using ∂tS(x,t)=−μ(x+t)S(x,t) and ∂aS(0,a)=−μ(a)S(0,a) yields N′(t)=B(t)−∫0∞μ(a)n(t,a) da for almost every t. Since 0≤B(t)≤β∞N(t) and μn≥0, we have N′(t)≤β∞N(t).

2.1F3step 1.1step 1.2algebra

Integrating the differential inequality in step 1.2 gives N(t)≤N(0)+∫0tβ∞N(s) ds. Apply [F3] with a(t)=N(0) and b=β∞ to obtain the asserted bound for nonnegative data. For arbitrary real f∈L1, positivity and linearity from step 1.1 give ∣S(t)f∣≤S(t)f++S(t)f−=S(t)∣f∣ almost everywhere. Integrating and applying the nonnegative-data bound proves ∥S(t)f∥1≤eβ∞t∥f∥1.

2.2F1F2step 1.2algebra

Subtract the two transport equations and write w=n−n~. Along characteristics, its interior forcing is (μ~−μ)n~ and its inflow forcing is ∫βw+∫(β−β~)n~. Taking absolute values in the characteristic integral formula, integrating over age, and using nonnegative survival factors gives E(t)≤E(0)+∫0t[β∞E(s)+δN~(s)] ds, where E=∥w∥1 and N~=∥n~∥1.

3.1F3step 2.1step 2.2algebra∎

By step 2.1 applied to n~, N~(s)≤eβ~∞s∥n~0∥1. Thus the nondecreasing function a(t)=E(0)+δteβ~∞t∥n~0∥1 bounds the forcing integral in step 2.2, and [F3] yields the claimed coefficient-and-initial-data stability estimate.

Depends on

Used by

Dependency tree · two levels

11 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