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.
Linear age-structured renewal transport problem
Definition
Fix a finite horizon . Let mortality and fertility be bounded Lipschitz functions , and let be nonnegative. The linear age-structured renewal transport problem is
with initial density and inflow condition
Here is age, is the birth rate, and the characteristic age path solves the first-order initial value problem in the sense of First-order systems, initial value problems, and solutions on intervals, hence . Define survival from age over duration by
A weak solution on is a nonnegative with continuous satisfying and, for every with ,
A mild solution is a weak solution that also satisfies, for almost every ,
The formula follows the age characteristics and their mortality survival. No delay equation or finite-age cutoff is identified with this model by definition.
Depends on
Used by
- Age-cohort quadrature along exact characteristics Algorithm
- Finite-volume upwind scheme for age renewal transport Algorithm
- Positive composite or capped-adaptive quadrature for renewal births Algorithm
- Finite-age renewal model with absorbing outflow Definition
- A longer run exposes age-cutoff outflow error Example
- A narrow maturation kernel approaches a delayed birth term Example
- Constant mortality with age-localized fertility Example
- Age-cutoff survival, outflow and infinite-age tail bounds Theorem
- Characteristic formula and Volterra solution for age renewal transport Theorem
- First-order finite-volume convergence for compatible smooth renewal data Theorem
- L1 convergence for BV data without renewal-boundary compatibility Theorem
- Positive age-renewal evolution and L1 data stability Theorem
- Positivity, L1 growth and data stability of the renewal finite-volume step Theorem
- Weak consistency of age-cohort characteristic quadrature Theorem
Dependency tree · two levels
3 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
- Benoît Perthame, Introduction to Structured Equations in Biology, full lecture notes (standard reference, not scraped)
- Åke Brännström, Linus Carlsson, and Daniel Simpson, On the Convergence of the Escalator Boxcar Train (standard reference, not scraped)