Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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 0=a0<a1<⋯<aJ=A with Δa=aj−aj−1, nonnegative cell masses Mj, a bounded nonnegative fertility function β:[0,A]→[0,β∞], and one rule setting for each cell. A setting is either midpoint with an integer panel count qj≥1, or capped adaptive with finite depth Dj∈N, positive integer panel-call budget Pj≥1, and indicator tolerance τj>0. If no settings are supplied, use midpoint with qj=1 in every cell. In each cell Cj=[aj−1,aj], let uj=Mj/Δa and approximate ∫Cjβ(a)uj da by its selected positive rule:

  1. Midpoint mode: use ujQM(β;aj−1,aj,qj) from Composite midpoint rule on a uniform grid and record status midpoint.
  2. Capped adaptive mode: call Finite-depth adaptive Simpson with an indicator on β over Cj with inputs (Dj,Pj,τj), then multiply its estimate by uj 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

Bh=∑j=1JujQj(β),

the per-cell statuses, and the sum of any reported adaptive indicators. Both rules have nonnegative quadrature weights summing to Δa, so 0≤Bh≤β∞∑jMj. 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