Alphabeta Math
DefinitionDefinition: 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.

Linear age-structured renewal transport problem

Definition

Fix a finite horizon T>0. Let mortality and fertility be bounded Lipschitz functions μ,β:[0,∞)→[0,∞), and let n0∈L1(0,∞) be nonnegative. The linear age-structured renewal transport problem is

nt(t,a)+na(t,a)=−μ(a)n(t,a),a>0,0<t≤T,

with initial density n(0,a)=n0(a) and inflow condition

n(t,0)=B(t),B(t):=∫0∞β(a)n(t,a) da.

Here a is age, B is the birth rate, and the characteristic age path solves the first-order initial value problem a′(s)=1 in the sense of First-order systems, initial value problems, and solutions on intervals, hence a(s)=a(0)+s. Define survival from age a over duration s≥0 by

S(a,s):=exp⁡ ⁣(−∫aa+sμ(r) dr).

A weak solution on [0,T] is a nonnegative n∈C([0,T];L1(0,∞)) with continuous B:[0,T]→[0,∞) satisfying B(t)=∫0∞β(a)n(t,a) da and, for every ϕ∈Cc1([0,T]×[0,∞)) with ϕ(T,a)=0,

−∫0T ⁣∫0∞n(t,a)(ϕt+ϕa−μ(a)ϕ) da dt=∫0∞n0(a)ϕ(0,a) da+∫0TB(t)ϕ(t,0) dt.

A mild solution is a weak solution that also satisfies, for almost every a≥0,

n(t,a)={n0(a−t)S(a−t,t),a≥t,B(t−a)S(0,a),0≤a<t,

The formula follows the age characteristics a′(s)=1 and their mortality survival. No delay equation or finite-age cutoff is identified with this model by definition.

Depends on

Used by

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