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.
Positive composite or capped-adaptive quadrature for renewal births
Definition
Input a uniform age partition with , nonnegative cell masses , a bounded nonnegative fertility function , and one rule setting for each cell. A setting is either midpoint with an integer panel count , or capped adaptive with finite depth , positive integer panel-call budget , and indicator tolerance . If no settings are supplied, use midpoint with in every cell. In each cell , let and approximate by its selected positive rule:
- Midpoint mode: use from Composite midpoint rule on a uniform grid and record status
midpoint. - Capped adaptive mode: call Finite-depth adaptive Simpson with an indicator on over with inputs , then multiply its estimate by and retain its status and indicator. The fertility evaluator returns a finite value at every requested node or reports failure.
If an evaluation fails, return failure and no birth rate. Otherwise return
the per-cell statuses, and the sum of any reported adaptive indicators. Both rules have nonnegative quadrature weights summing to , so . An adaptive accepted status means only that its indicators meet the requested budget; neither that indicator nor a cap-reached estimate bounds the true quadrature error. Any convergence theorem using this procedure must separately assume or prove a true quadrature-defect bound.
Depends on
Used by
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)
- Tobin A. Driscoll and Richard J. Braun, Fundamentals of Numerical Computation, §5.7 (standard reference, not scraped)
- MATH 373 lecture notes, §8 Approximation of Integrals (standard reference, not scraped)