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.

Age-cutoff survival, outflow and infinite-age tail bounds

Statement

Let A>T and let n0≥0 be integrable. For an initial cohort of age a, its survival through duration s satisfies

e−∥μ∥∞s≤S(a,s)≤e−μ∗s,μ∗:=ess inf⁡r≥0μ(r).

No cohort born during [0,T] reaches age A. The exact number of initial individuals that exits through age A by time t≤T is

OA(t)=∫A−tAn0(a)S(a,A−a) da≤∫A−T∞n0(a) da.

Let nA be the finite-age solution from Characteristic solution and mass bound for the finite-age renewal model with initial data n0A=n01[0,A], extended by zero above A. Then

sup⁡0≤t≤T∥n(t)−nA(t)∥1≤2eβ∞T∫A−T∞n0(a) da.

Under the smooth discretization hypotheses of First-order finite-volume convergence for compatible smooth renewal data, let uhk be its piecewise-constant reconstruction, extended by zero above A. At every time level,

∥uhk−n(tk,⋅)∥1≤2eβ∞T∫A−T∞n0(a) da+CT(Δa+Δt+ϵQ).

The cutoff term and the mesh/time/quadrature term are separately displayed.

Facts & Assumptions

Given: The infinite-age model and mild solution from Linear age-structured renewal transport problem and Characteristic formula and Volterra solution for age renewal transport, with nonnegative initial density and A>T.

[F1]

Linear age-structured renewal transport problem: a cohort of age a follows a(s)=a+s and survives for duration s by S(a,s).

[F2]

Characteristic formula and Volterra solution for age renewal transport: the infinite-age mild solution is unique and is given by characteristics and its birth-rate Volterra equation.

[F3]

Characteristic solution and mass bound for the finite-age renewal model: the absorbing finite-age solution is unique and has mass at most eβ∞t times its initial mass.

[F4]

Positive age-renewal evolution and L1 data stability: infinite-age solutions with the same rates differ in L1 by at most eβ∞t times the difference in initial data.

[F5]

First-order finite-volume convergence for compatible smooth renewal data: for the exact finite-age solution, the numerical cell-mass error is bounded separately by CT(Δa+Δt+ϵQ).

Proof

1.1givenF1algebra

For an initial cohort at age a, the survival factor is the exponential of minus the integrated mortality along a(s)=a+s by [F1]. Since μ∗≤μ(r)≤∥μ∥∞ almost everywhere, integrating these inequalities over [a,a+s] and exponentiating proves the two survival bounds.

2.1givenstep 1.1algebra

A newborn has age at most t≤T<A by time t, so it cannot contribute to outflow at A. An initial individual of age a exits by time t exactly when A−t≤a≤A, and its survival to the exit age is S(a,A−a). Integrating over those initial ages gives the formula for OA(t); using S≤1 and A−t≥A−T gives the stated upper bound.

3.1givenF2F3F4step 2.1algebra

Split n0=n01[0,A−T]+n01(A−T,∞). By linearity of the Volterra equations in [F2] and [F3], it suffices to compare the evolutions of these two parts. Every initial cohort in the first part remains below age A through time T, and its newborn descendants have age at most T<A; the characteristic formulas therefore make the infinite-age and finite-age evolutions identical for this part. The infinite-age evolution of the second part has mass at most eβ∞T∫A−T∞n0 by [F4]. The finite-age model starts this part only with its restriction to [0,A], whose mass is no larger than the same tail; its mass is at most that same exponential factor by [F3]. The triangle inequality gives the factor-two bound in the Statement.

4.1F5step 3.1algebra∎

Under the smooth hypotheses of [F5], the piecewise-constant reconstruction differs in L1 from the finite-age solution by at most CT(Δa+Δt+ϵQ) at each time level. Add this to the infinite-versus-cutoff error from step 3.1 by the triangle inequality. This is the displayed fully discrete bound, with the mesh/time/quadrature and age-tail contributions separate.

Depends on

Used by

Dependency tree · two levels

14 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