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 belong to , where means finite total variation, and let be bounded nonnegative Lipschitz rates. Fix a finite horizon . Initialize the finite-volume scheme with exact cell masses . 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 with for all sufficiently large , and admissible uniform grids with integers , and , assume and , 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 . This is an 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.
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.
Characteristic formula and Volterra solution for age renewal transport: the characteristic formula and Volterra equation have a unique mild solution.
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.
Positivity, L1 growth and data stability of the renewal finite-volume step: discrete masses stay nonnegative and their total is at most times the preceding total.
Proof
Write , , , and . The initial cell averages satisfy , 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.
Set and put and for . For , subtract adjacent updates from [F3] to obtain . The CFL makes the first two coefficients nonnegative, and . For , summing their absolute-value bounds for gives at most : for the two transport coefficients add to at most , the last-cell coefficient is at most , and the boundary difference contributes . When , omit this adjacent-difference sum and use only the following first-cell estimate. The first-cell jump is . The quadrature weights are fixed and nonnegative, so . The update and the definition of give . Also and . Adding the first-cell bound to the preceding sum combines the coefficients as ; all other variation coefficients are at most . Therefore , with depending only on the rate bounds and Lipschitz constants.
Iterating [F4] gives . Iterating the recurrence in step 2.1 gives . The same update gives ; hence the linear time interpolation is uniformly Lipschitz into .
On any fixed interval , the uniform and variation bounds make the time slices precompact in : replacing each slice by averages on blocks of width changes its norm by at most , 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 on every bounded age interval. A newborn cohort has age at most ; under the upwind update it can move at most one cell per step, so all newborn mass lies below age . For , births therefore contribute nothing above . An initial cell moves by at most cells, so any initial mass reconstructed above came from initial cells whose lower endpoint exceeds . Its mass is at most (extend by zero to negative ages); mortality and outflow only decrease that inherited mass. This tail tends to zero uniformly as . For the exact solution, [F2] shows that newborns have age at most , while mass above comes only from initial ages above and is at most . Hence the subsequence converges in .
Let for a compactly supported test function with terminal value zero. Multiplying [F3] by and summing by parts gives the exact discrete weak identity ; the outflow term vanishes because the test is supported below the cutoff. Uniform 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 , , so the birth sum converges to the boundary term. The limit therefore satisfies [F1] with the given initial trace.
In characteristic coordinates on , the weak identity [F1] becomes in distributions; multiplication by makes its distributional -derivative zero, and the initial trace gives . On , use and obtain with trace ; the same integrating-factor argument gives . 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
- Benoît Perthame, Introduction to Structured Equations in Biology, full lecture notes (standard reference, not scraped)
- MATH 575 lecture notes, §9 Finite difference methods for the transport equation (standard reference, not scraped)