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

L1 convergence for BV data without renewal-boundary compatibility

Statement

Let n0≥0 belong to BV(0,∞)∩L1(0,∞), where BV means finite total variation, and let μ,β be bounded nonnegative Lipschitz rates. Fix a finite horizon T>0. Initialize the finite-volume scheme with exact cell masses Mj0=∫Cjn0(a) da. Assume every positive birth-quadrature evaluation succeeds and the quadrature rule settings are fixed over time. The compatibility between the one-sided initial trace and the renewal birth rate is not assumed. For any sequence of age cutoffs Am→∞ with Am>T for all sufficiently large m, and admissible uniform grids with integers Jm,Nm≥1, Am=JmΔam and T=NmΔtm, assume Δam,Δtm>0 and Δam,Δtm→0, Δtm/Δam∈[c−,c+] for fixed positive bounds, and the transport-plus-loss CFL; extend the cellwise-constant reconstructions by zero above each cutoff. Linear interpolation between time levels then converges to the mild solution in C([0,T];L1(0,∞)). This is an L1 convergence statement; it asserts no smooth Taylor error rate.

Facts & Assumptions

Given: The BV initial density, bounded Lipschitz rates, and the finite-volume update in Linear age-structured renewal transport problem and Finite-volume upwind scheme for age renewal transport.

[F1]

Linear age-structured renewal transport problem: a weak solution is continuous in time with values in L1 and satisfies the displayed test-function identity, initial trace and renewal birth relation.

[F2]

Characteristic formula and Volterra solution for age renewal transport: the characteristic formula and Volterra equation have a unique mild solution.

[F3]

Finite-volume upwind scheme for age renewal transport: the cell update is the explicit flux balance; birth weights are nonnegative, supported in each cell and sum to the cell width; the right boundary is absorbing.

[F4]

Positivity, L1 growth and data stability of the renewal finite-volume step: discrete masses stay nonnegative and their total is at most 1+Δtβ∞ times the preceding total.

Proof

1.1givenF3construct

Write ujk=Mjk/Δa, Bk=Bhk, λ=Δt/Δa, and Vk=∣u1k−Bk∣+∑j=2J∣ujk−uj−1k∣. The initial cell averages satisfy V0≤TV⁡(n0)+∥n0∥∞+β∞∥n0∥1, which is finite because an integrable function of finite total variation on the half-line has finite essential supremum; the first term bounds differences of adjacent cell averages by averaging the variation measure.

2.1givenF3F4step 1.1algebra

Set u0k=Bk and put d1k=u1k−Bk and djk=ujk−uj−1k for 2≤j≤J. For j≥2, subtract adjacent updates from [F3] to obtain ujk+1−uj−1k+1=(1−λ−Δtμj)(ujk−uj−1k)+λ(uj−1k−uj−2k)+Δt(μj−1−μj)uj−1k. The CFL makes the first two coefficients nonnegative, and ∣μj−μj−1∣≤Lip⁡(μ)Δa. For J≥2, summing their absolute-value bounds for j=2,…,J gives at most ∑j=2J−1∣djk∣+(1−λ)∣dJk∣+λ∣d1k∣+ΔtLip⁡(μ)Nk: for 2≤j<J the two transport coefficients add to at most 1, the last-cell coefficient is at most 1−λ, and the boundary difference contributes λ∣d1k∣. When J=1, omit this adjacent-difference sum and use only the following first-cell estimate. The first-cell jump is d1k+1=(1−λ−Δtμ1)d1k+(1−Δtμ1)Bk−Bk+1. The quadrature weights are fixed and nonnegative, so ∣Bk+1−Bk∣≤β∞∑j∣Mjk+1−Mjk∣. The update and the definition of Vk give ∑j∣Mjk+1−Mjk∣≤Δt(Vk+μ∞Nk). Also ∣(1−Δtμ1)Bk−Bk+1∣≤∣Bk−Bk+1∣+Δtμ∞Bk and Bk≤β∞Nk. Adding the first-cell bound to the preceding sum combines the d1k coefficients as (1−λ−Δtμ1)+λ≤1; all other variation coefficients are at most 1. Therefore Vk+1≤(1+CΔt)Vk+CΔtNk, with C depending only on the rate bounds and Lipschitz constants.

3.1F4step 2.1algebra

Iterating [F4] gives Nk≤(1+Δtβ∞)kN0≤ekΔtβ∞N0≤eβ∞TN0. Iterating the recurrence in step 2.1 gives Vk≤(1+CΔt)kV0+CΔt∑r=0k−1(1+CΔt)k−1−rNr≤eCT(V0+CTeβ∞TN0). The same update gives ∑jΔa∣ujk+1−ujk∣≤Δt(Vk+μ∞Nk); hence the linear time interpolation is uniformly Lipschitz into L1.

4.1F2step 3.1construct

On any fixed interval [0,R], the uniform L1 and variation bounds make the time slices precompact in L1: replacing each slice by averages on blocks of width ρ changes its L1 norm by at most ρVk, while those block averages lie in a bounded finite-dimensional set. A diagonal extraction at rational times and the uniform time-Lipschitz bound from step 3.1 give a subsequence converging uniformly in time in L1 on every bounded age interval. A newborn cohort has age at most T; under the upwind update it can move at most one cell per step, so all newborn mass lies below age T/c−+Δa. For R>T/c−+Δa, births therefore contribute nothing above R. An initial cell moves by at most k cells, so any initial mass reconstructed above R came from initial cells whose lower endpoint exceeds R−kΔa−Δa≥R−T/c−−Δa. Its mass is at most ∫R−T/c−−2Δa∞n0 (extend n0 by zero to negative ages); mortality and outflow only decrease that inherited mass. This tail tends to zero uniformly as R→∞. For the exact solution, [F2] shows that newborns have age at most T, while mass above R>T comes only from initial ages above R−T and is at most ∫R−T∞n0. Hence the subsequence converges in C([0,T];L1(0,∞)).

5.1F1F3step 4.1algebra

Let ϕjk=ϕ(tk,(aj−1+aj)/2) for a compactly supported C1 test function with terminal value zero. Multiplying [F3] by ϕjk+1 and summing by parts gives the exact discrete weak identity −∑k,jMjk(ϕjk+1−ϕjk)−Δt∑k,j<JFjk(ϕj+1k+1−ϕjk+1)+Δt∑k,jμjMjkϕjk+1=∑jMj0ϕj0+Δt∑kBkϕ1k+1; the outflow term vanishes because the test is supported below the cutoff. Uniform L1 convergence, Lipschitz continuity of μ,β, and mesh refinement make the sums converge to the weak transport/loss terms. Since each positive birth rule is supported in its cell and its weights sum to Δa, ∣Bk−∫β(a)uh(tk,a)da∣≤2Lip⁡(β)Δa Nk, so the birth sum converges to the boundary term. The limit therefore satisfies [F1] with the given initial trace.

6.1F1F2step 5.1algebra∎

In characteristic coordinates x=a−t on a>t, the weak identity [F1] becomes ∂tv(t,x)=−μ(x+t)v(t,x) in distributions; multiplication by exp⁡(∫xx+tμ) makes its distributional t-derivative zero, and the initial trace gives v(t,x)=n0(x)S(x,t). On 0<a<t, use s=t−a and obtain ∂aw(s,a)=−μ(a)w(s,a) with trace w(s,0)=B(s); the same integrating-factor argument gives w(s,a)=B(s)S(0,a). Substitution into the renewal relation in [F1] yields the Volterra equation of [F2], whose solution is unique. Thus every subsequential limit equals the mild solution. Since every subsequence has a further subsequence with this same limit, the entire sequence converges.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

7 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