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.

Weak consistency of age-cohort characteristic quadrature

Statement

Let μ,β:[0,∞)→[0,∞) be bounded C1 functions with bounded derivatives, let n0∈C1([0,∞))∩L1(0,∞) be nonnegative, and fix T>0, Δt>0, and A>T. Put n^0=n01[0,A−T) and τA=∫A−T∞n0(a) da. Choose the initial positive cohort quadrature for n^0(a) da with support in [0,A−T) and bounded-Lipschitz defect ϵ0 on test functions of norm at most 1. For the procedure Age-cohort quadrature along exact characteristics, set N=⌊T/Δt⌋, consider its levels 0≤k≤N, and write β∞:=∥β∥∞. Assume Δt∥μ∥∞≤1. Define

∥η∥BL∗:=sup⁡∥ϕ∥∞+Lip⁡(ϕ)≤1∣∫ϕ dη∣

for a finite signed measure η. Then, for fixed T, there is CT independent of Δt, initial cohort count and cutoff such that

max⁡kΔt≤T∥νhk−n(tk,a) da∥BL∗≤CT(ϵ0+Δt+τA).

The measure norm is weak and does not assert L1 convergence of atomic cohorts to a density. The constant CT may depend on T, the stated coefficient bounds and ∥n0∥1, but is independent of the time step, cutoff and number of cohorts. For midpoint initial cohorts on [0,A−T] and Lipschitz n0, ϵ0=OA(Δa); the omitted initial tail τA remains separate.

Facts & Assumptions

Given: The renewal model, its characteristic solution, the cohort algorithm and the supplier one-step and discrete-recurrence results.

[F1]

Linear age-structured renewal transport problem: survival is S(a,s)=exp⁡(−∫aa+sμ) and births reset cohort age to zero.

[F2]

Characteristic formula and Volterra solution for age renewal transport: the exact birth rate satisfies B(t)=G(t)+∫0tK(t−s)B(s) ds, with K(s)=β(s)S(0,s), and the density is the corresponding characteristic pushforward.

[F3]

Age-cohort quadrature along exact characteristics: old cohort ages advance by Δt, cohort masses use the forward-Euler survival step, and each discrete birth mass is ΔtBhk at age zero.

[F4]

Forward Euler has uniform local order one and a one-step Lipschitz bound: on a compact tube with a C1 vector field, forward Euler has local defect O(Δt2) and one-step Lipschitz factor 1+LΔt.

[F5]

Positive age-renewal evolution and L1 data stability: for two solutions with the same rates and different initial data, their L1 difference is at most eβ∞t times the initial L1 difference.

[L1]

Finite geometric error bound from a one-step recurrence: a recurrence ek+1≤(1+Lh)ek+Ch2 on a fixed finite horizon has maximum error O(h).

Proof

1.1F1F2F5algebra

Let n^ be the exact solution with initial density n^0. Applying the characteristic formula [F2] and changing variables from age a to birth time s=t−a gives, for every bounded Lipschitz ϕ, ∫ϕ(a)n^(t,a)da=∫0A−Tϕ(x+t)S(x,t)n0(x)dx+∫0tϕ(t−s)S(0,t−s)B^(s)ds. The birth kernel K(s)=β(s)S(0,s) is bounded and Lipschitz, and G^(t)=∫0A−Tβ(x+t)S(x,t)n0(x)dx is bounded and Lipschitz because β,μ have bounded first derivatives and n0 is integrable. The mass estimate [F5] bounds B^ by β∞eβ∞T∥n0∥1. Subtracting its Volterra equation at t and t+h, the old-history kernel difference is at most Lip⁡(K)h∫0T∣B^∣ and the new interval at most h∥K∥∞∥B^∥∞. Thus B^ is Lipschitz on [0,T].

2.1F3F4L1step 1.1algebra

If N=0, there are no time steps and the survival-error claim is zero. Suppose N≥1, and put Th=NΔt>0. A cohort born with mass m0 and initial age a0 has exact survival mass solving m′(s)=−μ(a0+s)m(s); let q=m0 be its reference mass. To apply [F4] at a0=0, define the extension μˉ(r)=μ(r) for r≥0 and μˉ(r)=μ(0)+μ+′(0)rer for r<0. The one-sided derivative μ+′(0) exists; the two formulas and their first derivatives match at zero, and μˉ and μˉ′ are bounded on R. For a cohort whose reference mass is q>0, the vector field f(s,m)=−μˉ(a0+s)m is C1 on the open tube V=(−1,Th+1)×(−q,2q), where Th=NΔt, with all bounds required by [F4] uniform in a0 and proportional to q except for the state-Lipschitz constant, which is bounded by ∥μˉ∥∞. The exact continuation m(s)=mstartexp⁡(−∫0sμˉ(a0+r) dr) exists on an open interval containing [0,Th]; after shrinking that interval at the endpoints its graph lies in V. Its exact forward solution from any m∈[0,q] and its Euler input/output states lie in K=[0,Th]×[0,q]: mortality is nonnegative for ages a0+s≥0, and Δt∥μ∥∞≤1. Thus [F4] gives one-step defect at most CΔt2q and a stability factor 1+LΔt, with constants independent of a0 and proportional to q. Applying [L1] on the aligned horizon Th=NΔt gives survival-weight error at most CTΔtq over the full run; the zero-mass case is exact. For the discrete total cohort mass Nhk, positivity and Bhk≤β∞Nhk give Nhk+1≤(1+Δtβ∞)Nhk, hence Nhk≤eβ∞TNh0. Since Nh0≤∥n0∥1+ϵ0 (test the initial BL defect with ϕ≡1), the sum of the initial cohort masses and all inserted newborn masses ∑j<kΔtBhj is at most CT(∥n0∥1+ϵ0). Thus the sum of all cohort survival-weight errors is at most CTΔt(∥n0∥1+ϵ0).

3.1F2F3step 2.1algebra

Write ek=∣Bhk−B^(tk)∣. The initial-cohort contribution is at most CT(ϵ0+Δt): the test x↦β(x+tk)S(x,tk) has bounded-Lipschitz norm at most CT, and step 2.1 bounds the accumulated Euler survival error. Each cohort born during [tj,tj+1] is inserted at tj+1 with mass ΔtBhj, so at tk its age is (k−j−1)Δt. The exact renewal convolution is the integral of K(tk−s)B^(s) over s∈[0,tk]. Since K and B^ are Lipschitz, replacing this integral by the left-endpoint sum with age (k−j−1)Δt costs at most CTΔt (the age sample differs from tk−tj by one step). Replacing B^(tj) by Bhj contributes at most ∥K∥∞Δt∑j<kej, and replacing exact newborn survival by its Euler product contributes at most CTΔt by step 2.1. Therefore ek≤CT(ϵ0+Δt)+∥K∥∞Δt∑j<kej. Set rk=CT(ϵ0+Δt)+∥K∥∞Δt∑j<kej. Then ek≤rk and rk+1=rk+∥K∥∞Δtek≤(1+∥K∥∞Δt)rk, so ek≤e∥K∥∞TCT(ϵ0+Δt).

4.1F1F2F5step 1.1step 2.1step 3.1algebra∎

For any test function with ∥ϕ∥∞+Lip⁡(ϕ)≤1, the initial cohort pushforward differs from the first integral for n^ in step 1.1 by at most CT(ϵ0+Δt), using step 2.1 and the bounded-Lipschitz norm of x↦ϕ(x+t)S(x,t). The newborn cohort sum differs from the second integral by its left-Riemann error CTΔt plus Δt∑j<kej≤CT(ϵ0+Δt) by step 3.1. Thus ∥νhk−n^(tk,a)da∥BL∗≤CT(ϵ0+Δt). The initial data difference is ∥n0−n^0∥1=τA, so [F5] gives ∥n(tk)−n^(tk)∥1≤eβ∞TτA. The inequality ∥f(a)da∥BL∗≤∥f∥1 and the triangle inequality prove the stated bound.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

31 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