Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

Probability

1,641 missions · 709 completed

Missions

Open932Completed709All1641
🏆Completed
Actuarial Science·Captain: WillR

Actuarial Mathematics XI: Annual Net Reserve RecursionTextbook

Motivation and actuarial setting

Prospective policy reserves measure the expected present value of an insurer's remaining benefits less remaining premiums, per policy still in force at a valuation date. When premiums and benefits occur at annual dates, consecutive reserve values satisfy a one-year cashflow balance. That recursion is central to valuation systems, reserve roll-forwards and the decomposition of a life insurance premium into risk and savings components.

This mission develops the annual net premium reserve recursion for a finite-term life assurance. It builds on the conceptual framework of prospective policy values without importing unconfirmed declarations from earlier Prove2Me missions. The principal actuarial sources are Gerber, Life Insurance Mathematics, third edition, Chapter 6 §6.3, notably equation (6.3.4) [1], and Dickson, Hardy and Waters, Actuarial Mathematics for Life Contingent Risks, first edition, Chapter 7 §7.3.3 [2]. Both develop the balance between an opening reserve, the premium due and the expected benefit plus closing reserve.

A key objective is correct treatment of impossible conditional events: the aggregate expected-loss recursion does not require next-year survival to have positive probability, while the familiar conditional-reserve formula needs the next year's reserve to be defined for an in-force life.

Time axis and cashflows

Let K:Ω→NK:\Omega\to\mathbb NK:Ω→N be measurable curtate lifetime under a probability measure PPP. Fix the contract term n∈Nn\in\mathbb Nn∈N, integer valuation date ttt, deterministic annual discount factor vvv, death benefit bbb and level premium π\piπ. The insurer receives a premium at the start of each policy year j<nj<nj<n for which K≥jK\ge jK≥j. If K<nK<nK<n, it pays the death benefit at the end of policy year KKK, at calendar time K+1K+1K+1.

The realised present value of the remaining net insurer loss, evaluated immediately before the time-ttt premium, is

Ln,t(ω)=bvK(ω)+1−t1{t≤K(ω)<n}−π∑t≤j<nvj−t1{K(ω)≥j}.L_{n,t}(\omega) =bv^{K(\omega)+1-t} \mathbf1_{\{t\le K(\omega)<n\}} -\pi\sum_{t\le j<n}v^{j-t}\mathbf1_{\{K(\omega)\ge j\}}.Ln,t​(ω)=bvK(ω)+1−t1{t≤K(ω)<n}​−πt≤j<n∑​vj−t1{K(ω)≥j}​.

The date-ttt premium appears in this expression and is worth one unit before multiplying by π\piπ. Premiums earned before ttt are excluded. The cashflow has finite calendar horizon even if the lifetime distribution is unbounded.

One-year death and survival partition

Define the probabilities of being in force, dying during the following year and surviving one further year by

St=P(K≥t),Dt=P(K=t),St+1=P(K≥t+1).S_t=P(K\ge t),\qquad D_t=P(K=t),\qquad S_{t+1}=P(K\ge t+1).St​=P(K≥t),Dt​=P(K=t),St+1​=P(K≥t+1).

The event {K≥t}\{K\ge t\}{K≥t} partitions into two disjoint events, {K=t}\{K=t\}{K=t} and {K≥t+1}\{K\ge t+1\}{K≥t+1}, so

St=Dt+St+1.S_t=D_t+S_{t+1}.St​=Dt​+St+1​.

When St>0S_t>0St​>0, conditional annual death and survival probabilities are

qt=DtSt,pt=St+1St,qt+pt=1.q_t=\frac{D_t}{S_t},\qquad p_t=\frac{S_{t+1}}{S_t},\qquad q_t+p_t=1.qt​=St​Dt​​,pt​=St​St+1​​,qt​+pt​=1.

No annual death-event independence assumption is made. The result follows directly from the disjoint partition of a natural-valued lifetime.

Pathwise and aggregate cashflow recursions

For t<nt<nt<n, the future loss satisfies the pointwise identity

Ln,t(ω)+π 1{K(ω)≥t}=vb 1{K(ω)=t}+vLn,t+1(ω).L_{n,t}(\omega)+\pi\,\mathbf1_{\{K(\omega)\ge t\}} =vb\,\mathbf1_{\{K(\omega)=t\}} +vL_{n,t+1}(\omega).Ln,t​(ω)+π1{K(ω)≥t}​=vb1{K(ω)=t}​+vLn,t+1​(ω).

If the person dies in year ttt, the current premium is collected and the discounted death benefit becomes due. If the person survives, the one-step-discounted continuation accounts for all remaining premiums and the eventual death benefit. Before the start of the contract's surviving period, all relevant terms vanish.

Taking expectations and using integrability of the finite-term cashflow gives the unnormalised recurrence

EP[Ln,t]+πSt=v(bDt+EP[Ln,t+1]).\mathbb E_P[L_{n,t}]+\pi S_t =v\left(bD_t+\mathbb E_P[L_{n,t+1}]\right).EP​[Ln,t​]+πSt​=v(bDt​+EP​[Ln,t+1​]).

This identity remains meaningful when St+1=0S_{t+1}=0St+1​=0, because the future loss at t+1t+1t+1 is zero almost surely in that case. It is the safest formulation to prove before dividing by survival probabilities.

The conditional annual reserve

For St>0S_t>0St​>0, define the prospective reserve per policy in force at time ttt as

Vt=EP[Ln,t]St.V_t=\frac{\mathbb E_P[L_{n,t}]}{S_t}.Vt​=St​EP​[Ln,t​]​.

The Lean definition uses ordinary real division, which is totalised at zero, but the actuarial interpretation above is asserted only under a positive survival-probability assumption. If both St>0S_t>0St​>0 and St+1>0S_{t+1}>0St+1​>0, substitute E[Ln,t]=StVt\mathbb E[L_{n,t}]=S_tV_tE[Ln,t​]=St​Vt​ and E[Ln,t+1]=St+1Vt+1\mathbb E[L_{n,t+1}]=S_{t+1}V_{t+1}E[Ln,t+1​]=St+1​Vt+1​ into the aggregate identity. Division by StS_tSt​ yields

Vt+π=v(qtb+ptVt+1).\boxed{V_t+\pi=v\bigl(q_tb+p_tV_{t+1}\bigr).}Vt​+π=v(qt​b+pt​Vt+1​).​

The equation is the classical annual reserve balance: opening reserve plus premium equals the expected discounted claim and next-year reserve. Gerber [1, §6.3] also develops its decomposition into risk and savings premiums. This mission targets the core recursion and its probability and integrability prerequisites, rather than treating that later decomposition as already formalised.

The death-certain boundary St+1=0S_{t+1}=0St+1​=0 is not hidden under a fictitious conditional reserve at t+1t+1t+1. The aggregate identity above applies directly. A later extension can derive the explicit terminal conditional formula from it while preserving the zero-probability interpretation.

Formal graph and boundary cases

The draft introduces four definitions: the realised remaining loss, the in-force survival mass, death-year mass and prospective reserve quotient. Its twelve supporting theorems establish maturity and inception boundaries, the survival-event partition, conditional death/survival probabilities, loss integrability, the pointwise and integrated one-year recursions, reserve normalisation and the conditional reserve identity. A capstone combines the probability identity with the annual reserve recursion.

For t≥nt\ge nt≥n, no covered future cashflow remains. At t=0t=0t=0, S0=1S_0=1S0​=1, so the reserve is the unconditional expected loss at issue. The principal recursions allow any fixed real vvv; the usual insurance interpretation adopts a nonnegative discount factor. The proof obligations are finite-horizon and do not require a maximum possible lifetime.

The items are proposed Lean statements rather than accepted proofs. Their modules are dependency-ordered, with imports only at the beginning of each file. Until the supporting definitions have been individually published, downstream proof targets which import their modules must not be represented as ready for successful standalone compilation.

References

[1] Gerber, Hans U. (1997), Life Insurance Mathematics, third edition, Springer, Chapter 6, §6.3, Recursions, especially equations (6.3.4)–(6.3.10) and the premium risk/savings interpretation. Springer book DOI.

[2] Dickson, David C. M., Hardy, Mary R. and Waters, Howard R. (2009), Actuarial Mathematics for Life Contingent Risks, first edition, Chapter 7, Policy Values, §7.3.3, Recursive formulae for policy values. This chapter explicitly develops one-year annual policy-value recursions and related annual profit calculations.

[3] Open Actuarial Textbooks Project, Life Contingencies: Basic Life Contingent Benefits, Chapter 3, for the curtate-lifetime timing conventions used in the finite death-benefit and premium cashflows.

17 thms1 active userReviewed
🏆Completed
Actuarial Science·Captain: WillR

Actuarial Mathematics X: Finite-State Multiple-State ValuationTextbook

Motivation and actuarial context

Life-contingent benefits may depend on more than whether an insured life is alive or dead. Disability, recovery, critical illness and multiple causes of exit can all be represented by finite sets of states with possible transitions between them. Multiple-state models make it possible to value benefits on a transition, annuities paid while occupying a state, and different amounts payable according to the insured's health or other status. Dickson, Hardy and Waters develop the actuarial multiple-state setting in Actuarial Mathematics for Life Contingent Risks (2009), Chapter 8 [1]. Promislow presents a discrete-time, potentially non-stationary Markov model and its insurance and annuity applications in Fundamentals of Actuarial Mathematics (2015), §§19.2.1–19.2.3 [2].

This mission establishes the finite-state, discrete-time algebra needed before tackling more difficult continuous-time transition intensities, differential equations or multistate reserves. The capstone connects composition of transition matrices with discounted state-dependent cashflows. The mathematical emphasis is on correct probabilities, annual timing and finite sums.

Discrete-time transition kernel

Let SSS be a nonempty finite set of possible policyholder states. For one policy year, define PabP_{ab}Pab​ as the probability of ending the year in state bbb, conditional on starting in state aaa. To represent a genuine transition kernel it must satisfy

Pab≥0,∑b∈SPab=1(a,b∈S).P_{ab}\ge0,\qquad \sum_{b\in S}P_{ab}=1 \quad(a,b\in S).Pab​≥0,b∈S∑​Pab​=1(a,b∈S).

The model allows a different transition matrix in each year. It does not assume a constant transition law or that every state can reach every other state. For two successive policy years, with transition kernels PPP and QQQ, the two-step transition probability is

(PQ)ac=∑b∈SPabQbc.(PQ)_{ac}=\sum_{b\in S}P_{ab}Q_{bc}.(PQ)ac​=b∈S∑​Pab​Qbc​.

The intermediate state bbb is summed out. This is the finite Chapman–Kolmogorov composition used in the non-stationary discrete Markov chain of [2, §19.2.1]. The proof must show that composing two nonnegative row-stochastic kernels produces another nonnegative row-stochastic kernel. Associativity,

(PQ)R=P(QR),(PQ)R=P(QR),(PQ)R=P(QR),

then permits an arbitrary finite sequence of yearly transition matrices to be grouped without changing the resulting transition probabilities.

The matrix calculations alone are not a theorem asserting that an arbitrary stochastic process has the Markov property. They formalise the transition-probability algebra assuming the yearly probabilities are the kernels of a Markov model. Proving a full path-space conditional-probability construction is outside this mission.

Discounted state-dependent cashflows

Suppose an annual payment depends on the state occupied after the next transition. Write rbr_brb​ for the amount paid at the next year end when the new state is bbb, and NbN_bNb​ for the continuation value at that date. Let vvv be the deterministic one-period discount factor. The one-step prospective value in current state aaa is

V(a)=v∑b∈SPab(rb+Nb).V(a)=v\sum_{b\in S}P_{ab}(r_b+N_b).V(a)=vb∈S∑​Pab​(rb​+Nb​).

Both rrr and NNN are measured at the next year end, so this formula applies precisely one period of discounting to both. A constant amount ccc paid at the next year end has value vcvcvc, by the row-sum property. The valuation operator is linear in reward and continuation cashflows, and it is nonnegative when the discount factor, transition probabilities and cashflows are nonnegative.

For a payment rcr_crc​ arising only at the end of the second year, the two-stage recursion simplifies to

V0(a)=v∑bPab(v∑cQbcrc)=v2∑c(PQ)acrc.\begin{aligned} V_0(a) &=v\sum_b P_{ab} \left(v\sum_cQ_{bc}r_c\right)\\ &=v^2\sum_c(PQ)_{ac}r_c. \end{aligned}V0​(a)​=vb∑​Pab​(vc∑​Qbc​rc​)=v2c∑​(PQ)ac​rc​.​

This identity reconciles backward valuation with forward transition-probability composition. It is the discrete precursor to larger actuarial valuation and reserve recursions. Promislow's §§19.2.2–19.2.3 discuss state- and transition-dependent insurance and annuity cashflows [2].

Boundary conditions and limitations

When the discount factor is zero, a payment made only at the next year end has zero present value. When all future rewards and continuation values are zero, the valuation is zero. Neither algebraic identity requires a particular health-state interpretation.

The theorem graph uses a finite state type and sums over all states. A true actuarial example must supply valid transition probabilities, distinguish payments made on entering a state from those made for occupying the state, and preserve the timing of an insurance payment at the end of the year. No independence between annual state indicators is assumed. Multistate variance calculations need joint transition probabilities rather than naively treating indicators as independent [2, §19.2.2].

The mission creates three definitions, twelve supporting theorems and one capstone. The proof path begins with row normalisation and nonnegativity, proves composition and associativity, and then develops constant, zero, linear and two-step discounted reward identities. The capstone combines the preservation of a stochastic kernel, associative composition and the two-step reward valuation.

These are proposed Lean theorem statements, not claims of completed proofs. This draft uses Mathlib's finite-sum and elementary order algebra, with no reliance on unpublished actuarial mission definitions.

References

[1] Dickson, David C. M., Hardy, Mary R. and Waters, Howard R. (2009), Actuarial Mathematics for Life Contingent Risks, first edition, Cambridge University Press, Chapter 8, Multiple State Models, especially §§8.2–8.4. This provides the actuarial interpretation of state transitions and the Markov modelling assumptions.

[2] Promislow, S. David (2015), Fundamentals of Actuarial Mathematics, third edition, Wiley, ISBN 9781118782460, Chapter 19, Multi-state Models, §§19.2.1–19.2.3. The discrete non-stationary transition model and subsequent state-dependent life insurance and annuity examples are the direct cashflow motivation.

[3] Norris, J. R. (1997), Markov Chains, Cambridge University Press, §1.1, Definition and Basic Properties. The book defines a stochastic matrix by its probability-distribution rows and states Theorems 1.1.1–1.1.3 on the Markov property and powers of the transition matrix. Its basic homogeneous-chain construction is a supporting special case, not an assertion that the time-varying matrices in this mission are all equal.

16 thms1 active userReviewed
🏆Completed
Actuarial Science·Captain: WillR

Actuarial Mathematics IX: Prospective Term Insurance ReservesTextbook

Motivation and actuarial context

A net premium is usually set at policy inception. As an insured life survives and the remaining insurance term shortens, the expected future claim outgo and future premium income change. A prospective policy value measures the expected present value of the insurer's future loss on a policy that is still in force at the valuation date. This is the natural next stage after the equivalence principle of Actuarial Mathematics VIII. Dickson, Hardy and Waters provide the insurer's future-loss definition and the annual-cashflow policy-value framework in Actuarial Mathematics for Life Contingent Risks (2009), Chapter 7, §§7.3.1–7.3.3 [1]. Promislow covers both deterministic reserve recursions and the stochastic approach to reserves [2].

This mission formalises a finite-term life-assurance reserve at an integer valuation duration. Its central feature is survival conditioning: the reserve is a liability per surviving in-force policy, rather than the unconditional present value of the original contract. Separating these quantities avoids a common modelling error in stochastic policy values.

Model, contract timing and in-force event

Let K:Ω→NK:\Omega\to\mathbb NK:Ω→N be measurable curtate future lifetime under a probability measure PPP. Let n∈Nn\in\mathbb Nn∈N denote the term, t∈Nt\in\mathbb Nt∈N the valuation duration, v∈Rv\in\mathbb Rv∈R a fixed per-period discount factor, b∈Rb\in\mathbb Rb∈R the death benefit and π∈R\pi\in\mathbb Rπ∈R the annual level premium.

Premiums are payable in advance at integer times j<nj<nj<n while the life is alive. The benefit, if payable, occurs at the end of the year of death, at date K+1K+1K+1. Only cashflows on or after duration ttt enter the reserve, with discount exponents measured from ttt.

The in-force survival event is

St={ω∈Ω:K(ω)≥t}.S_t=\{\omega\in\Omega:K(\omega)\ge t\}.St​={ω∈Ω:K(ω)≥t}.

When P(St)>0P(S_t)>0P(St​)>0, conditioning on this event gives the valuation basis for policies in force at ttt. A statement about reserves conditional on survival must not silently assume that P(St)>0P(S_t)>0P(St​)>0.

Future benefit, premium and loss values

The remaining unit term-assurance benefit present value is

Bn,t(ω)=1{t≤K(ω)<n} vK(ω)+1−t.B_{n,t}(\omega)= \mathbf1_{\{t\le K(\omega)<n\}}\,v^{K(\omega)+1-t}.Bn,t​(ω)=1{t≤K(ω)<n}​vK(ω)+1−t.

The remaining premium-annuity present value is

Yn,t(ω)=∑t≤j<nvj−t1{K(ω)≥j}.Y_{n,t}(\omega)= \sum_{t\le j<n} v^{j-t} \mathbf1_{\{K(\omega)\ge j\}}.Yn,t​(ω)=t≤j<n∑​vj−t1{K(ω)≥j}​.

The realised future net loss is therefore

Ln,t(ω;b,π)=bBn,t(ω)−πYn,t(ω).L_{n,t}(\omega;b,\pi)= bB_{n,t}(\omega)-\pi Y_{n,t}(\omega).Ln,t​(ω;b,π)=bBn,t​(ω)−πYn,t​(ω).

These finite expressions make it explicit whether a premium due at the valuation instant is included. Here ttt is immediately before the premium at time ttt, consistent with an annual premium payable in advance. The choice is essential when comparing reserve formulas across valuation conventions.

At t=0t=0t=0 the in-force event is certain. At or after t=nt=nt=n, both remaining cashflow components vanish because the contract's coverage and premium period have ended.

Prospective reserve and normalisation

For positive survival probability, the prospective term-policy reserve per in-force policy is

Vn,t=EP[Ln,t∣St]=EP[Ln,t]P(St).V_{n,t} =\mathbb E_P[L_{n,t}\mid S_t] =\frac{\mathbb E_P[L_{n,t}]}{P(S_t)}.Vn,t​=EP​[Ln,t​∣St​]=P(St​)EP​[Ln,t​]​.

The second equality holds because the model defines the realised future loss as zero outside StS_tSt​. It is a conditional-event expectation, rather than an unrestricted claim about conditional expectation with respect to an arbitrary sigma-algebra. The formal quotient definition makes the denominator explicit, and the principal reserve interpretation and capstone theorem retain P(St)>0P(S_t)>0P(St​)>0 as a hypothesis.

Linearity separates the reserve into benefit and premium components:

Vn,t=b EP[Bn,t∣St]−π EP[Yn,t∣St].V_{n,t}= b\,\mathbb E_P[B_{n,t}\mid S_t] -\pi\,\mathbb E_P[Y_{n,t}\mid S_t].Vn,t​=bEP​[Bn,t​∣St​]−πEP​[Yn,t​∣St​].

In particular, multiplying both cashflow amounts by c∈Rc\in\mathbb Rc∈R gives

Vn,t(cb,cπ)=cVn,t(b,π).V_{n,t}(cb,c\pi)=cV_{n,t}(b,\pi).Vn,t​(cb,cπ)=cVn,t​(b,π).

The finite payment period ensures integrability for any fixed real discount factor. When studying economic reserve properties, a nonnegative or positive discount factor can be imposed separately. No assumption of independence between survival indicators, benefits and premiums is made.

Boundary cases and formalisation strategy

The principal boundary checks are survival at inception, t=0t=0t=0; exhaustion of cover at t≥nt\ge nt≥n; finite sums with n=0n=0n=0; and zero in-force probability. The total real-valued quotient happens to evaluate to zero when both its numerator and denominator are zero in Lean, but this does not create an actuarially meaningful conditional reserve for an impossible in-force event. The descriptive and main conditional theorems are explicitly scoped to positive probability.

Five definitions provide the in-force event, future benefit PV, future premium PV, future loss PV and the prospective reserve. Supporting theorems develop survival-event measurability, cashflow boundaries, nonnegativity where applicable, integrability, inception valuation, benefit–premium decomposition and scaling. The capstone combines the survival-normalised expected-loss identity, valuation decomposition and scaling.

The formalisation is deliberately self-contained at the level of future cashflow definitions so the owner Draft does not depend on the unconfirmed publication of any Mission VIII declarations. The intended later bridge is an exact identity between the duration-zero future loss and the loss-at-issue formula from Mission VIII, once those definitions are published. All theorems are proposed proof targets, not assertions of accepted proofs.

Gerber [4, §§6.3 and 6.5] provides an independent treatment of net premium reserves and annual reserve recursions. Its equation (6.5.6) expresses a whole-life net reserve through the premium difference, illustrating the same prospective viewpoint but not asserting the more general term-reserve theorem of this mission.

References

[1] Dickson, David C. M., Hardy, Mary R. and Waters, Howard R. (2009), Actuarial Mathematics for Life Contingent Risks, first edition, Chapter 7, Policy Values, Cambridge University Press. Relevant sections: §7.3.1 (future loss), §7.3.2 (policy values for annual cashflows) and §7.3.3 (recursive policy values), printed pages 176–195.

[2] Promislow, S. David (2015), Fundamentals of Actuarial Mathematics, third edition, Wiley, ISBN 9781118782460. In particular §6.3 (reserve recursion) and §15.5 (stochastic reserves).

[3] Dickson, Hardy and Waters (2009), Chapter 6, §6.5.1, equation (6.1), on the equivalence principle at policy inception, publisher book record.

[4] Gerber, Hans U. (1997), Life Insurance Mathematics, third edition, Springer, Chapter 6, Net Premium Reserves, §6.3 and §6.5, including the premium-difference reserve formula (6.5.6).

19 thms1 active userReviewed
🏆Completed
Actuarial Science·Captain: WillR

Actuarial Mathematics VIII: Net Level Premiums and the Equivalence PrincipleTextbook

Motivation and actuarial context

The equivalence principle is one of the foundational methods of setting premiums for life-contingent contracts. It requires that the insurer's expected present value of future benefits equal the expected present value of future net premium income at policy inception. As a result, the expected present value of the net future-loss random variable is zero. Dickson, Hardy and Waters define the net future-loss random variable in Actuarial Mathematics for Life Contingent Risks (2009), §6.4, and state the equivalence principle in §6.5.1, equation (6.1) [1]. Promislow develops the corresponding stochastic premium principle in Fundamentals of Actuarial Mathematics (2015), §15.6.1 [2].

This mission makes that principle a rigorous theorem for a finite-term life assurance financed by level premiums payable annually in advance. It proves that a unique net premium exists when at least one premium is due and nonnegative discount factors are used, and it separately addresses the zero-term case where uniqueness fails. The formal treatment distinguishes realised loss from expected loss, keeps mortality and discounting assumptions explicit, and avoids treating survival-contingent benefits and premiums as independent.

Insurance contract, premium dates and realised loss

Let (Ω,P)(\Omega,P)(Ω,P) represent the probability space, with a measurable natural-valued curtate future lifetime KKK. Let n∈Nn\in\mathbb Nn∈N denote the policy term, v∈Rv\in\mathbb Rv∈R the annual discount factor, b∈Rb\in\mathbb Rb∈R a deterministic death benefit and π∈R\pi\in\mathbb Rπ∈R a level premium.

A unit nnn-year term assurance pays once, at the end of the year of death, if death occurs within the covered term. Its realised benefit present value is AnA_nAn​, reusing the published definition from Actuarial Mathematics II. In conventional cashflow notation,

An(ω)=∑0≤k<nvk+11{K(ω)=k}.A_n(\omega)= \sum_{0\le k<n}v^{k+1}\mathbf 1_{\{K(\omega)=k\}}.An​(ω)=0≤k<n∑​vk+11{K(ω)=k}​.

This is the discrete term-assurance structure from [3, §3.2.2, equation (3.8)]. Premiums are due at the start of each covered year while the insured remains alive. The realised present value of unit premium income is

Yn(ω)=∑0≤k<nvk1{K(ω)≥k}.Y_n(\omega)= \sum_{0\le k<n}v^k\mathbf 1_{\{K(\omega)\ge k\}}.Yn​(ω)=0≤k<n∑​vk1{K(ω)≥k}​.

The insurer's discounted net future loss at inception is then

Ln(ω;π,b)=bAn(ω)−πYn(ω).L_n(\omega;\pi,b) =bA_n(\omega)-\pi Y_n(\omega).Ln​(ω;π,b)=bAn​(ω)−πYn​(ω).

The same curtate lifetime determines both premium income and death benefit outgo. No independence assumption is made between these two random variables.

The equivalence-principle premium

Because the sums are finite, their measurability and integrability can be established from measurability of KKK for any finite real vvv. Linearity of expectation gives

EP[Ln(π,b)]=bEP[An]−πEP[Yn].\mathbb E_P[L_n(\pi,b)] =b\mathbb E_P[A_n]-\pi\mathbb E_P[Y_n].EP​[Ln​(π,b)]=bEP​[An​]−πEP​[Yn​].

For a positive term n≥1n\ge1n≥1 and v≥0v\ge0v≥0, the first premium at time zero is certain: v0=1v^0=1v0=1. All subsequent premium present values are nonnegative. Consequently,

Yn(ω)≥1,EP[Yn]≥1>0.Y_n(\omega)\ge1, \qquad \mathbb E_P[Y_n]\ge1>0.Yn​(ω)≥1,EP​[Yn​]≥1>0.

The denominator in the premium formula is therefore strictly positive. Solving the linear expected-loss equation leads to the net level premium

π∗(b)=bEP[An]EP[Yn],EP[Ln(π∗(b),b)]=0.\pi^*(b)= \frac{b\mathbb E_P[A_n]}{\mathbb E_P[Y_n]}, \qquad \mathbb E_P[L_n(\pi^*(b),b)]=0.π∗(b)=EP​[Yn​]bEP​[An​]​,EP​[Ln​(π∗(b),b)]=0.

The theorem also proves uniqueness: any real premium π\piπ satisfying EP[Ln(π,b)]=0\mathbb E_P[L_n(\pi,b)]=0EP​[Ln​(π,b)]=0 must equal π∗(b)\pi^*(b)π∗(b). This is the formal analogue of the equivalence premium calculation in [1, equation (6.1)]. As a related worked example, [1, equation (6.2)] gives a net premium for an endowment contract using the ratio of benefit and premium-annuity values. The mission specialises the general principle to an nnn-year term assurance.

Scaling, boundaries and assumptions

Linearity yields the scaling identity

π∗(cb)=cπ∗(b)\pi^*(cb)=c\pi^*(b)π∗(cb)=cπ∗(b)

for any constant ccc. In particular, a zero benefit produces a zero premium under the ratio definition. A nonnegative benefit gives a nonnegative premium when 0≤v0\le v0≤v, although the core algebraic scaling theorem does not require positive bbb.

The boundary n=0n=0n=0 is deliberately distinct. Neither a term-assurance benefit nor a premium can occur, so A0=Y0=L0=0A_0=Y_0=L_0=0A0​=Y0​=L0​=0. Every quoted level premium has zero expected loss in this empty contract, and uniqueness does not follow. The ratio definition is therefore paired with explicit theorem hypotheses rather than falsely suggesting a unique zero-term premium.

At v=0v=0v=0 and n≥1n\ge1n≥1, the certain initial premium remains payable at inception, while all covered death benefits are paid at strictly positive times and have zero discounted value. The net premium is zero. At v=1v=1v=1, all payment sums remain finite and integrable for fixed nnn, so no artificial upper bound v<1v<1v<1 is needed for these finite-term results.

Formalisation and dependency structure

The mission introduces three definitions: the realised finite premium annuity-due present value, the realised term-policy loss, and the equivalence net premium. Supporting theorems establish the initial premium lower bound, measurability and integrability, positivity of the expected premium annuity, linearity of expected loss, existence and uniqueness of the equivalence premium, benefit scaling, and the zero-term and zero-discount boundaries. The capstone combines positivity, zero expected loss, uniqueness and benefit scaling.

The only previously published actuarial definition imported is the nnn-year term-assurance present value from Mission II. The mathematical arguments use finite sums and integration under a probability measure, rather than relying on unproved statements from other draft missions. All declarations in this owner Draft are mathematical proof targets. Their presence in a proposal does not mean that their proofs have been accepted.

Gerber [4, §5.3.1] independently develops annual-premium term insurance, including its realised loss and the net premium equations (5.3.9)–(5.3.11). Those results corroborate the payment timing and the equivalence-premium construction adopted here.

References

[1] Dickson, David C. M., Hardy, Mary R. and Waters, Howard R. (2009), Actuarial Mathematics for Life Contingent Risks, first edition, Cambridge University Press, book DOI 10.1017/CBO9780511800146. See §6.4, The present value of future loss random variable, and §6.5.1, Net premiums, particularly equations (6.1)–(6.2).

[2] Promislow, S. David (2015), Fundamentals of Actuarial Mathematics, third edition, Wiley, ISBN 9781118782460. See §15.6.1, The equivalence principle, and §15.6, The stochastic approach to premiums.

[3] Open Actuarial Textbooks Project, Life Contingencies, Chapter 3, Basic Life Contingent Benefits, §3.2.2, equation (3.8), finite term assurance.

[4] Gerber, Hans U. (1997), Life Insurance Mathematics, third edition, Springer, Chapter 5, Net Premiums, particularly §5.3.1, equations (5.3.9)–(5.3.11), on finite term insurance and net annual premiums.

19 thms1 active userReviewed
🏆Completed
Actuarial Science·Captain: WillR

Actuarial Mathematics VII: Flat-Interest Assurance–Annuity EquivalenceTextbook

Motivation and actuarial context

Whole-life assurance and a whole-life annuity-due are two fundamental life-contingent contracts. The assurance provides one unit of benefit at the end of the year of death, whereas the annuity-due provides one unit at the start of each year that the life is still eligible for payment, including time zero. Under a constant positive effective annual interest rate, their realised present values satisfy an exact finite-geometric-series identity. This provides an unusually direct connection between insurance benefits, annuity values and the distribution of curtate future lifetime. The relationship and its expected-value and variance consequences are stated in Life Contingencies, Chapter 3, equations (3.13)–(3.14) [1].

This mission formally develops that equivalence in Lean, starting from the individual cashflows and ending with a capstone theorem that combines the pointwise, expectation and variance results. It also isolates the assumptions needed for these results, supplies reusable bounds and integrability lemmas, and treats the zero-interest boundary separately. Related treatments of whole-life insurance and life annuities are available in the actuarial textbooks of Promislow [2] and Dickson, Hardy and Waters [3]. The mission's declarations are proposed proof obligations, not claims that every theorem has already been proved.

Contracts and notation

Let K:Ω→NK:\Omega\to\mathbb NK:Ω→N be the natural-valued curtate future lifetime of the insured life. In outcome ω\omegaω, death occurs during policy year K(ω)+1K(\omega)+1K(ω)+1. Let i>0i>0i>0 be a flat, deterministic annual effective interest rate and define

v=11+i,0<v<1.v=\frac{1}{1+i},\qquad 0<v<1.v=1+i1​,0<v<1.

The unit whole-life assurance, payable at the end of the year of death, has realised present value

ZA(ω)=vK(ω)+1.Z_A(\omega)=v^{K(\omega)+1}.ZA​(ω)=vK(ω)+1.

This is the assurance contract defined in [1, §3.2.1, equation (3.7)]. The unit whole-life annuity-due makes payments at dates 0,1,…,K(ω)0,1,\ldots,K(\omega)0,1,…,K(ω) and therefore has realised present value

ZD(ω)=∑k=0K(ω)vk.Z_D(\omega)=\sum_{k=0}^{K(\omega)}v^k.ZD​(ω)=k=0∑K(ω)​vk.

The annuity cashflow and the flat-interest specialisation are discussed in [1, §3.3.1, equations (3.11) and (3.13)]. The difference in timing is essential: the assurance payment occurs at K+1K+1K+1, one year after the last annuity-due payment at KKK.

Pointwise assurance–annuity equivalence

For i>0i>0i>0, the finite geometric sum gives

ZD(ω)=1−vK(ω)+11−v=1+ii(1−ZA(ω)).\begin{aligned} Z_D(\omega) &=\frac{1-v^{K(\omega)+1}}{1-v}\\ &=\frac{1+i}{i}\bigl(1-Z_A(\omega)\bigr). \end{aligned}ZD​(ω)​=1−v1−vK(ω)+1​=i1+i​(1−ZA​(ω)).​

Equivalently, writing d=i/(1+i)=1−vd=i/(1+i)=1-vd=i/(1+i)=1−v for the annual effective rate of discount,

ZA(ω)+dZD(ω)=1.Z_A(\omega)+dZ_D(\omega)=1.ZA​(ω)+dZD​(ω)=1.

These are pathwise statements. They hold for every realised natural-valued lifetime and require no assumptions about a mortality law or independence between annual survival events. They formalise the finite-series relationship in [1, equation (3.13)], rather than relying on an approximation or a selected life table.

Expected present values and variance

Now let PPP be a probability measure on Ω\OmegaΩ and suppose that KKK is measurable. The assumption i>0i>0i>0 implies 0<v<10<v<10<v<1, and the realised values obey

0<ZA(ω)≤1,0≤ZD(ω)≤1+ii.0<Z_A(\omega)\le 1, \qquad 0\le Z_D(\omega)\le\frac{1+i}{i}.0<ZA​(ω)≤1,0≤ZD​(ω)≤i1+i​.

These deterministic bounds establish integrability, including the required second moments, even where KKK has unbounded support across outcomes. Taking expectations of the pointwise identity yields

EP[ZD]=1+ii(1−EP[ZA]).\mathbb E_P[Z_D] =\frac{1+i}{i}\left(1-\mathbb E_P[Z_A]\right).EP​[ZD​]=i1+i​(1−EP​[ZA​]).

If Ax=EP[ZA]A_x=\mathbb E_P[Z_A]Ax​=EP​[ZA​] and a¨x=EP[ZD]\ddot a_x=\mathbb E_P[Z_D]a¨x​=EP​[ZD​] denote the corresponding actuarial values for a life aged xxx, then

a¨x=1+ii(1−Ax).\ddot a_x=\frac{1+i}{i}(1-A_x).a¨x​=i1+i​(1−Ax​).

Translation by a constant leaves variance unchanged, and scaling multiplies variance by the square of the factor. Thus

Var⁡P(ZD)=(1+ii)2Var⁡P(ZA).\operatorname{Var}_P(Z_D) =\left(\frac{1+i}{i}\right)^2 \operatorname{Var}_P(Z_A).VarP​(ZD​)=(i1+i​)2VarP​(ZA​).

The EPV and variance identities are stated in [1, equation (3.14)]. In particular, the variance factor is squared. No independence assumption is imposed: the assurance and annuity values are functions of the same lifetime, and the variance identity follows from their exact affine relationship.

Interest-rate boundary and scope

At zero interest, v=1v=1v=1, the whole-life annuity-due has realised value

ZD(ω)=∑k=0K(ω)1=K(ω)+1.Z_D(\omega)=\sum_{k=0}^{K(\omega)}1=K(\omega)+1.ZD​(ω)=k=0∑K(ω)​1=K(ω)+1.

This is a separate pointwise theorem. The expression (1+i)/i(1+i)/i(1+i)/i is undefined at i=0i=0i=0, and an arbitrary distribution of KKK need not give a finite undiscounted expected payment count or a finite variance. An expectation theorem at zero interest would require a suitable first-moment assumption on KKK, while a finite variance requires a second moment.

The simple assurance–annuity equivalence also relies on a flat deterministic interest basis. Under a non-flat yield curve the discounted cashflow series has varying discount factors and the same fixed geometric multiplier does not generally exist. The source expressly makes this limitation in [1, §3.3.1].

Formalisation and proof structure

The mission adds one definition, the whole-life assurance realised present value, together with eleven supporting theorems and one capstone. The supporting graph establishes discount-factor positivity, the finite geometric sum, assurance positivity, the pointwise and unit identities, a boundedness lemma, integrability of both contracts, and their expected-value and variance relationships. A separate theorem handles zero interest. The capstone combines the key pathwise identity, expected-value relation, variance scaling and unit identity.

The only imported published actuarial definition is the existing whole-life annuity-due present-value definition from the earlier mission. The assurance definition is introduced here. The proposed proofs should use the appropriate finite-sum and probability-measure results from the pinned Mathlib, and no unproved theorem from another actuarial mission should be treated as an available proof dependency. These formal dependencies are distinct from the published textbook references below.

References

[1] Open Actuarial Textbooks Project, Life Contingencies: The Mathematics, Statistics, and Economics of Life Insurance, Chapter 3, Basic Life Contingent Benefits. Principal results: §3.3.1, equations (3.13)–(3.14), on the flat-interest annuity identity, EPV and variance. Assurance definition: §3.2.1, equation (3.7). Whole-life annuities: §3.3.1, equations (3.11)–(3.12).

[2] Promislow, S. David (2010), Fundamentals of Actuarial Mathematics, Wiley. Publisher book record, particularly Chapters 4, Life Annuities, and 5, Life Insurance. This provides wider actuarial background rather than an attribution of equations (3.13)–(3.14) to Promislow.

[3] Dickson, David C. M., Hardy, Mary R. and Waters, Howard R. (2019), Actuarial Mathematics for Life Contingent Risks, third edition, Cambridge University Press, particularly Chapters 4, Insurance Benefits, 5, Annuities, and 12, Yield Curves and Non-Diversifiable Risk. These chapters provide context for contract valuation and the distinction between flat and varying interest rates.

14 thms1 active userReviewed
🏆Completed
Actuarial Science·Captain: WillR

Actuarial Mathematics VI: Guaranteed Life AnnuitiesTextbook

Motivation and actuarial context

A whole-life annuity provides payments contingent on the annuitant remaining alive. A guaranteed life annuity adds a minimum number of payments, irrespective of early death. This alters the insurer's cashflows, since payments during the guarantee period are certain and subsequent payments depend on survival. It is an important contract structure for retirement income and provides a natural bridge between annuities certain, whole-life annuities and deferred life annuities. The payment definitions and expected present values are given in the Open Actuarial Textbooks Project's Life Contingencies, Chapter 3, §3.3.4, equations (3.19) and (3.20) [1]. Guaranteed payments are also covered within the broader treatments of life annuities in [2] and [3].

The objective of this mission is to formalise both annuities payable in advance (due) and annuities payable in arrears (immediate), including their exact cashflow decompositions, expected values and variances. It develops the mathematical justification for infinite survival-weighted sums when the distribution of lifetime is not bounded above. These are formal theorem targets to be proved, rather than results already established merely by publishing the statements.

Contract definition and payment timing

Let K:Ω→NK:\Omega\to\mathbb NK:Ω→N be curtate future lifetime, where K(ω)K(\omega)K(ω) is the number of complete future years lived in outcome ω\omegaω. Let n∈Nn\in\mathbb Nn∈N be the number of guaranteed annual payments and let v∈Rv\in\mathbb Rv∈R be a constant per-period discount factor. Each payment has unit amount, and an empty sum has value zero.

For an annuity-due, payments occur at times 0,1,…0,1,\ldots0,1,…. The first nnn payments at times 0,…,n−10,\ldots,n-10,…,n−1 are certain. Additional payments occur at times n,…,K(ω)n,\ldots,K(\omega)n,…,K(ω), if any.

For an annuity-immediate, payments occur at times 1,2,…1,2,\ldots1,2,…. The first nnn payments at times 1,…,n1,\ldots,n1,…,n are certain. Additional payments occur at times n+1,…,K(ω)n+1,\ldots,K(\omega)n+1,…,K(ω), if any. The separate timing conventions are essential to the guaranteed-period boundary cases.

Realised present-value identities

The guaranteed annuity-due has realised present value

ZG,due(ω)=∑0≤k<max⁡{K(ω)+1,n}vk=∑0≤k<nvk⏟Cdue+∑n≤k≤K(ω)vk⏟Ddue(ω).\begin{aligned} Z_{G,\mathrm{due}}(\omega) &=\sum_{0\le k<\max\{K(\omega)+1,n\}}v^k\\ &=\underbrace{\sum_{0\le k<n}v^k}_{C_{\mathrm{due}}} +\underbrace{\sum_{n\le k\le K(\omega)}v^k}_{D_{\mathrm{due}}(\omega)}. \end{aligned}ZG,due​(ω)​=0≤k<max{K(ω)+1,n}∑​vk=Cdue​0≤k<n∑​vk​​+Ddue​(ω)n≤k≤K(ω)∑​vk​​.​

For an annuity-immediate, the corresponding identity is

ZG,imm(ω)=∑0≤k<max⁡{K(ω),n}vk+1=∑0≤k<nvk+1⏟Cimm+∑n≤k<K(ω)vk+1⏟Dimm(ω).\begin{aligned} Z_{G,\mathrm{imm}}(\omega) &=\sum_{0\le k<\max\{K(\omega),n\}}v^{k+1}\\ &=\underbrace{\sum_{0\le k<n}v^{k+1}}_{C_{\mathrm{imm}}} +\underbrace{\sum_{n\le k<K(\omega)}v^{k+1}}_{D_{\mathrm{imm}}(\omega)}. \end{aligned}ZG,imm​(ω)​=0≤k<max{K(ω),n}∑​vk+1=Cimm​0≤k<n∑​vk+1​​+Dimm​(ω)n≤k<K(ω)∑​vk+1​​.​

Here CCC is the deterministic annuity-certain prefix and DDD is the survival-dependent deferred continuation. The equations reproduce the underlying payment timing of [1, equations (3.19)–(3.20)]. They also connect to the deferred-annuity formulas in [1, equations (3.17)–(3.18)]. Additional pointwise theorems express each guaranteed value as its corresponding whole-life value plus the extra payments required when death occurs during the guarantee.

Expected values and variance

Let PPP be a probability measure and assume that KKK is measurable. For the analytical theorems, impose 0≤v<10\le v<10≤v<1. Write Pr⁡(K≥k)=P({ω:K(ω)≥k})\Pr(K\ge k)=P(\{\omega:K(\omega)\ge k\})Pr(K≥k)=P({ω:K(ω)≥k}). The expected present values are

EP[ZG,due]=∑0≤k<nvk+∑k=n∞vkPr⁡(K≥k)\mathbb E_P[Z_{G,\mathrm{due}}] =\sum_{0\le k<n}v^k +\sum_{k=n}^{\infty}v^k\Pr(K\ge k)EP​[ZG,due​]=0≤k<n∑​vk+k=n∑∞​vkPr(K≥k)

and

EP[ZG,imm]=∑0≤k<nvk+1+∑k=n∞vk+1Pr⁡(K≥k+1).\mathbb E_P[Z_{G,\mathrm{imm}}] =\sum_{0\le k<n}v^{k+1} +\sum_{k=n}^{\infty}v^{k+1}\Pr(K\ge k+1).EP​[ZG,imm​]=0≤k<n∑​vk+1+k=n∑∞​vk+1Pr(K≥k+1).

The fixed prefix and survival-weighted tail are those in the guaranteed-annuity textbook formulas [1]. A formal proof must establish measurability and integrability and justify taking expectation through the infinite sum. The geometric bound supplied by 0≤v<10\le v<10≤v<1 makes these conclusions possible for a natural-valued lifetime distribution with unbounded support. No maximum attainable lifetime is assumed.

Since CdueC_{\mathrm{due}}Cdue​ and CimmC_{\mathrm{imm}}Cimm​ are deterministic, adding them changes the expected values but does not change the variances:

Var⁡P(ZG,due)=Var⁡P(Ddue),Var⁡P(ZG,imm)=Var⁡P(Dimm).\begin{aligned} \operatorname{Var}_P(Z_{G,\mathrm{due}}) &=\operatorname{Var}_P(D_{\mathrm{due}}),\\ \operatorname{Var}_P(Z_{G,\mathrm{imm}}) &=\operatorname{Var}_P(D_{\mathrm{imm}}). \end{aligned}VarP​(ZG,due​)VarP​(ZG,imm​)​=VarP​(Ddue​),=VarP​(Dimm​).​

These variance equalities are derived theorems, based on translation invariance of variance, rather than separate numbered statements in §3.3.4. The general survival-cashflow moment framework in [1, §3.1.1, equations (3.3), (3.5)–(3.6)] supplies background. No independence assumption between annual survival events is introduced.

Boundary cases and formal proof structure

When n=0n=0n=0, both guaranteed annuities reduce to their corresponding whole-life annuities. When K(ω)=nK(\omega)=nK(ω)=n, the due annuity can still pay at time nnn, while the immediate deferred continuation is empty and the nnn guaranteed immediate payments remain. When K(ω)=0K(\omega)=0K(ω)=0, the due contract has its time-zero payment, and an immediate contract with n>0n>0n>0 still pays the nnn certain instalments.

The finite realised-value identities hold algebraically for every real vvv, including zero, one and negative values. The stated integrability, infinite expected-value and variance theorems deliberately use 0≤v<10\le v<10≤v<1. In particular, an arbitrary undiscounted lifetime distribution need not have a finite expected payment count.

The mission introduces four definitions, fourteen supporting theorems and one capstone. The intended proof path establishes cashflow decompositions and zero-guarantee identities, develops geometric bounds and measurable survival events, proves the expected-value and variance relations, and then assembles the capstone from the supporting results.

The formal dependency graph reuses six published Prove2Me declarations: the curtate-survival event and its measurability theorem, together with whole-life and deferred present-value definitions for due and immediate annuities. These are technical dependencies, distinct from the bibliographic sources below. An unproved theorem from an earlier mission is not treated as an available proof dependency.

References

[1] Open Actuarial Textbooks Project, Life Contingencies: The Mathematics, Statistics, and Economics of Life Insurance, Chapter 3, Basic Life Contingent Benefits. Principal source: §3.3.4, equations (3.19)–(3.20). Related foundations: §3.3.1 (3.11)–(3.12), §3.3.3 (3.17)–(3.18), and §3.1.1 (3.3), (3.5)–(3.6). The explanatory sentence after (3.20) calls the contract deferred, although the section heading and displayed expressions describe a guaranteed annuity.

[2] Promislow, S. David (2010), “Life Annuities”, Chapter 4 of Fundamentals of Actuarial Mathematics, Wiley, DOI: 10.1002/9781119971528.ch4. The chapter's published summary includes guaranteed payments.

[3] Dickson, David C. M., Hardy, Mary R. and Waters, Howard R. (2019), Actuarial Mathematics for Life Contingent Risks, third edition, Cambridge University Press, Chapter 5, Annuities. General context for life-annuity valuation.

27 thms1 active userReviewed
🏆Completed
Actuarial Science·Captain: WillR

Actuarial Mathematics V: Whole-Life and Deferred Life AnnuitiesTextbook

Motivation

Whole-life and deferred life annuities extend survival-contingent payments beyond a fixed policy term. A whole-life annuity may pay on each eligible anniversary until death, while a deferred annuity begins after a specified waiting period. Both are standard components of pension and life-contingency valuation.

Actuarial Mathematics I established how to value finite cashflows. Missions III and IV provide curtate survival events and temporary annuity schedules. This mission develops the infinite-horizon valuation step: it justifies the lifetime payment series and its expected present value, including the conditions under which expectation can be exchanged with the discounted survival series.

The mortality and discount model

Let (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) be a probability space and let K:Ω→NK:\Omega\to\mathbb NK:Ω→N be a measurable curtate future lifetime. Define the survival event at time kkk by

Sk={ω:K(ω)≥k}.S_k=\{\omega:K(\omega)\ge k\}.Sk​={ω:K(ω)≥k}.

For expected present value statements, assume a deterministic annual discount factor vvv satisfying

0≤v<1.0\le v<1.0≤v<1.

This condition provides a geometric bound on the payments and justifies exchanging expectation with the discounted survival series. No particular life table or independence between survival dates is assumed, and KKK need not have a finite upper bound.

Whole-life annuities

With unit payments in advance, a life with realised curtate lifetime K(ω)K(\omega)K(ω) receives a payment at time zero and at each subsequent beginning-of-year date through time K(ω)K(\omega)K(ω). Its present value can be written

ZWL,due(ω)=∑k=0K(ω)vk=∑k=0∞vk1{K(ω)≥k}.Z_{\mathrm{WL,due}}(\omega)=\sum_{k=0}^{K(\omega)}v^k =\sum_{k=0}^{\infty}v^k\mathbf1_{\{K(\omega)\ge k\}}.ZWL,due​(ω)=k=0∑K(ω)​vk=k=0∑∞​vk1{K(ω)≥k}​.

Its expected present value, given by equation (3.11), is

EP[ZWL,due]=∑k=0∞vkP(Sk).\mathbb E_P[Z_{\mathrm{WL,due}}] =\sum_{k=0}^{\infty}v^kP(S_k).EP​[ZWL,due​]=k=0∑∞​vkP(Sk​).

A whole-life annuity in arrears pays at times 1,…,K(ω)1,\ldots,K(\omega)1,…,K(ω), with no payment at time zero:

ZWL,immediate(ω)=∑k=0∞vk+11{K(ω)≥k+1}.Z_{\mathrm{WL,immediate}}(\omega) =\sum_{k=0}^{\infty}v^{k+1}\mathbf1_{\{K(\omega)\ge k+1\}}.ZWL,immediate​(ω)=k=0∑∞​vk+11{K(ω)≥k+1}​.

Equation (3.12) gives its expected present value:

EP[ZWL,immediate]=∑k=0∞vk+1P(Sk+1).\mathbb E_P[Z_{\mathrm{WL,immediate}}] =\sum_{k=0}^{\infty}v^{k+1}P(S_{k+1}).EP​[ZWL,immediate​]=k=0∑∞​vk+1P(Sk+1​).

The payment in advance at time zero is certain, and the remaining payments match the arrears stream. Thus their pointwise and expected values satisfy

ZWL,immediate=ZWL,due−1.Z_{\mathrm{WL,immediate}}=Z_{\mathrm{WL,due}}-1.ZWL,immediate​=ZWL,due​−1.

Deferred life annuities

For a deferral period n∈Nn\in\mathbb Nn∈N, a deferred annuity in advance has its first possible payment at time nnn, with no payments before then. Equation (3.17) gives its indicator representation:

Zdeferred,due=∑k=n∞vk1{K≥k},Z_{\mathrm{deferred,due}} =\sum_{k=n}^{\infty}v^k\mathbf1_{\{K\ge k\}},Zdeferred,due​=k=n∑∞​vk1{K≥k}​,

and its expected present value is

EP[Zdeferred,due]=∑k=n∞vkP(Sk).\mathbb E_P[Z_{\mathrm{deferred,due}}] =\sum_{k=n}^{\infty}v^kP(S_k).EP​[Zdeferred,due​]=k=n∑∞​vkP(Sk​).

A deferred annuity in arrears starts at time n+1n+1n+1 and requires survival to that date. Equation (3.18) gives

Zdeferred,immediate=∑k=n∞vk+11{K≥k+1},Z_{\mathrm{deferred,immediate}} =\sum_{k=n}^{\infty}v^{k+1}\mathbf1_{\{K\ge k+1\}},Zdeferred,immediate​=k=n∑∞​vk+11{K≥k+1}​,

with expected present value

EP[Zdeferred,immediate]=∑k=n∞vk+1P(Sk+1).\mathbb E_P[Z_{\mathrm{deferred,immediate}}] =\sum_{k=n}^{\infty}v^{k+1}P(S_{k+1}).EP​[Zdeferred,immediate​]=k=n∑∞​vk+1P(Sk+1​).

The timing conditions matter. If K=nK=nK=n, there is a due payment at time nnn, but no immediate payment at time n+1n+1n+1. When n=0n=0n=0, each deferred annuity is its corresponding whole-life annuity.

Whole-life values minus temporary annuities

The discounted cashflows in equations (3.17) and (3.18) are the corresponding whole-life streams with the first nnn potential payment dates removed. Pointwise, this gives

Zdeferred,due=ZWL,due−∑k=0n−1vk1Sk,Z_{\mathrm{deferred,due}} =Z_{\mathrm{WL,due}} -\sum_{k=0}^{n-1}v^k\mathbf1_{S_k},Zdeferred,due​=ZWL,due​−k=0∑n−1​vk1Sk​​,

and

Zdeferred,immediate=ZWL,immediate−∑k=0n−1vk+11Sk+1.Z_{\mathrm{deferred,immediate}} =Z_{\mathrm{WL,immediate}} -\sum_{k=0}^{n-1}v^{k+1}\mathbf1_{S_{k+1}}.Zdeferred,immediate​=ZWL,immediate​−k=0∑n−1​vk+11Sk+1​​.

Taking expectations gives the source's deferred-annuity valuation differences: each deferred annuity's expected present value is the corresponding whole-life expected present value less that of the temporary annuity.

The finite prefix sums reproduce the temporary-annuity schedules from Mission IV without importing its unpublished declarations. Mission IV remains a Draft, so its new theorems are not available as published imports. The two published curtate survival results from Mission III can be used.

Formalisation and analytical scope

The four new definitions use a finite payment sum for each realised natural-valued lifetime. Each realised cashflow therefore has finite support, even when the possible lifetimes are unbounded. The milestones connect these finite realised sums with infinite survival-indicator series, prove the deferred and initial-payment decompositions, establish integrability under the geometric discount condition, and derive four infinite expected-value formulas.

The capstone combines these formulas and decompositions for the same probability measure, curtate lifetime, discount factor and deferral period. The measure need not arise from a particular mortality model.

The condition 0≤v<10\le v<10≤v<1 applies to the expected present value claims. Pointwise present value identities hold for any real vvv, since each realised natural-valued lifetime is finite and so produces only finitely many payments. At v=1v=1v=1, an arbitrary lifetime distribution can have infinite expectation, so finite expected values cannot be assumed. The condition used here is sufficient; it is not claimed to be the sharpest possible condition under the source's financial discount assumptions.

Source and dependencies

The primary source is Life Contingencies: The Mathematics, Statistics, and Economics of Life Insurance, Chapter 3 §3.3.1 equations (3.11)–(3.12) and §3.3.3 equations (3.17)–(3.18). The temporary prefixes are the payment schedules from §3.3.2 equations (3.15)–(3.16), and the general expectation-of-cashflows step is equation (3.3).

  • https://openacttextdev.github.io/LifeCon/C-SimpleBenefit.html
  • https://openacttextdev.github.io/LifeCon/C-ModelingLifeTimes.html

This mission covers whole-life and deferred annuities. Guaranteed-period benefits, flat-interest assurance–annuity equivalence and continuous-time intensity-based valuations are separate later projects.

22 thms1 active userReviewed
🏆Completed
Actuarial Science·Captain: WillR

Actuarial Mathematics IV: Temporary Life Annuities and Their MomentsTextbook

Motivation

A life annuity pays a series of amounts while its recipient survives. A term assurance pays at most once during the policy term, whereas a temporary life annuity may pay several times. The indicators for its payments can therefore overlap, so a correct second-moment calculation must retain the dependence between them.

This mission formalises temporary life annuities payable in advance and in arrears, using the finite contingent-cashflow framework established in Actuarial Mathematics I. It reuses the curtate survival-event definition from Actuarial Mathematics III.

Survival events and dependence

Let (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) be a probability space, and let K:Ω→NK:\Omega\to\mathbb NK:Ω→N be the measurable curtate future lifetime, counting completed years. The event that the life survives to time kkk is

Sk={ω:K(ω)≥k}.S_k=\{\omega:K(\omega)\ge k\}.Sk​={ω:K(ω)≥k}.

These events are nested. For all i,j∈Ni,j\in\mathbb Ni,j∈N,

Si∩Sj=Smax⁡(i,j).S_i\cap S_j=S_{\max(i,j)}.Si​∩Sj​=Smax(i,j)​.

Consequently their indicators satisfy

1Si(ω)1Sj(ω)=1Smax⁡(i,j)(ω).\mathbf1_{S_i}(\omega)\mathbf1_{S_j}(\omega)=\mathbf1_{S_{\max(i,j)}}(\omega).1Si​​(ω)1Sj​​(ω)=1Smax(i,j)​​(ω).

This matters for second moments: survival to one payment date and survival to another are not mutually exclusive. Their intersection is survival to the later date. No independence assumption is made.

Temporary life annuity payable in advance

A unit temporary life annuity payable in advance makes up to nnn payments, at times k=0,…,n−1k=0,\dots,n-1k=0,…,n−1. The payment at time kkk is made if K≥kK\ge kK≥k. With deterministic annual discount factor vvv, its random present value is

Zdue=∑k=0n−1vk1Sk.Z_{\mathrm{due}}=\sum_{k=0}^{n-1}v^k\mathbf1_{S_k}.Zdue​=k=0∑n−1​vk1Sk​​.

The expected present value is

EP[Zdue]=∑k=0n−1vkP(Sk).\mathbb E_P[Z_{\mathrm{due}}]=\sum_{k=0}^{n-1}v^kP(S_k).EP​[Zdue​]=k=0∑n−1​vkP(Sk​).

These are the temporary-annuity-in-advance identities in Chapter 3, equation (3.15). The first payment, at time zero, is certain whenever n≥1n\ge1n≥1.

Temporary life annuity payable in arrears

A unit temporary life annuity payable in arrears has potential payments at times k+1k+1k+1, for k=0,…,n−1k=0,\dots,n-1k=0,…,n−1. A payment is made only if K≥k+1K\ge k+1K≥k+1:

Zimmediate=∑k=0n−1vk+11Sk+1.Z_{\mathrm{immediate}}=\sum_{k=0}^{n-1}v^{k+1}\mathbf1_{S_{k+1}}.Zimmediate​=k=0∑n−1​vk+11Sk+1​​.

Its expected present value is

EP[Zimmediate]=∑k=0n−1vk+1P(Sk+1).\mathbb E_P[Z_{\mathrm{immediate}}]=\sum_{k=0}^{n-1}v^{k+1}P(S_{k+1}).EP​[Zimmediate​]=k=0∑n−1​vk+1P(Sk+1​).

These are the corresponding payment-in-arrears identities in equation (3.16). In particular, a life with K=0K=0K=0 can receive the first payment of the annuity in advance, but no payment from the annuity in arrears.

Second moments and variance

The general moment calculations in Section 3.1.1 apply to the payment schedules in equations (3.15) and (3.16). Intersections of survival events reduce to the requirement to survive to the later date.

For payments in advance, the finite double-sum second moment is

EP[Zdue2]=∑i=0n−1∑j=0n−1vi+jP(Smax⁡(i,j)).\mathbb E_P[Z_{\mathrm{due}}^2]= \sum_{i=0}^{n-1}\sum_{j=0}^{n-1}v^{i+j}P(S_{\max(i,j)}).EP​[Zdue2​]=i=0∑n−1​j=0∑n−1​vi+jP(Smax(i,j)​).

For payments in arrears, it is

EP[Zimmediate2]=∑i=0n−1∑j=0n−1vi+j+2P(Smax⁡(i+1,j+1)).\mathbb E_P[Z_{\mathrm{immediate}}^2]= \sum_{i=0}^{n-1}\sum_{j=0}^{n-1} v^{i+j+2}P(S_{\max(i+1,j+1)}).EP​[Zimmediate2​]=i=0∑n−1​j=0∑n−1​vi+j+2P(Smax(i+1,j+1)​).

These are ordered double sums. Every ordered pair of payment dates contributes, including the diagonal terms and both orders of each off-diagonal pair. The corresponding variances are

Var⁡P(Zdue)=EP[Zdue2]−(EP[Zdue])2,\operatorname{Var}_P(Z_{\mathrm{due}})= \mathbb E_P[Z_{\mathrm{due}}^2]-\bigl(\mathbb E_P[Z_{\mathrm{due}}]\bigr)^2,VarP​(Zdue​)=EP​[Zdue2​]−(EP​[Zdue​])2, Var⁡P(Zimmediate)=EP[Zimmediate2]−(EP[Zimmediate])2.\operatorname{Var}_P(Z_{\mathrm{immediate}})= \mathbb E_P[Z_{\mathrm{immediate}}^2]-\bigl(\mathbb E_P[Z_{\mathrm{immediate}}]\bigr)^2.VarP​(Zimmediate​)=EP​[Zimmediate2​]−(EP​[Zimmediate​])2.

The double-sum second-moment results are formal specialisations of the general moment equations (3.5)–(3.6). They are not additional numbered results in Section 3.3.2, which gives the expectation and present-value identities in equations (3.15) and (3.16).

Formalisation goal

The main theorem packages the expected values, second moments and variances of both annuities under the same PPP, KKK, vvv and nnn. Its supporting milestones establish the nesting of survival events and the products of their indicators, the finite payment schedules, and the successive valuation identities.

Both definitions are instances of the generic finite present-value construction from Actuarial Mathematics I. The curtate survival event is imported from Actuarial Mathematics III. Together, these provide reusable foundations for later missions on deferred and guaranteed life annuities.

The finite sums cover n=0n=0n=0, when both annuities have zero present value, and n=1n=1n=1, when the advance annuity includes the certain payment at time zero and the arrears annuity pays only if the life has completed at least one year. Algebraically, the identities allow any real vvv. In actuarial applications, vvv is normally positive. This mission asserts neither convergence of an infinite whole-life annuity nor statistical independence of survival payments.

Source references

The primary source is Life Contingencies: The Mathematics, Statistics, and Economics of Life Insurance, Open Actuarial Textbooks Project, Chapter 3 §3.1.1 equations (3.5)–(3.6) and §3.3.2 equations (3.15)–(3.16).

  • https://openacttextdev.github.io/LifeCon/C-SimpleBenefit.html
  • https://openacttextdev.github.io/LifeCon/C-ModelingLifeTimes.html
  • https://prove2.me/missions/Actuarial_Mathematics_I%3A_Present_Values_of_Contingent_Cashflows

This is a draft mission and has not yet been published. It formalises finite-term annual payments. Continuous payment timing, deferred whole-life payments, guaranteed-period annuities and infinite valuation are planned separately.

21 thms1 active userReviewed
🏆Completed
Actuarial Science·Captain: WillR

Actuarial Mathematics III: Pure Endowment and Endowment AssuranceTextbook

Motivation

An endowment assurance pays a fixed benefit either when the policyholder dies during the policy term or when the policy reaches its maturity date. It therefore brings death-contingent and survival-contingent payments together in one valuation framework.

Actuarial Mathematics I established general identities for valuing finite contingent cashflows. Mission II formalised unit term assurance and the mutually exclusive events of death in different policy years. This mission extends those foundations to pure endowments and endowment assurances, covering payment dates, expected present values, second moments and variances.

Exact lifetime and curtate lifetime

Let (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) be a probability space. The exact future lifetime TTT takes nonnegative real values, while the curtate future lifetime KKK records completed years. Their relationship is

K(ω)≤T(ω)<K(ω)+1.K(\omega)\le T(\omega)<K(\omega)+1.K(ω)≤T(ω)<K(ω)+1.

For a term n∈Nn\in\mathbb Nn∈N, the textbook's pure-endowment payment in equation (3.9) depends on strict survival:

En>={ω:T(ω)>n}.E_n^{>}=\{\omega:T(\omega)>n\}.En>​={ω:T(ω)>n}.

The endowment-assurance formula in equation (3.10), by contrast, uses a maturity payment when K+1>nK+1>nK+1>n, equivalently when K≥nK\ge nK≥n. Define

En≥={ω:K(ω)≥n}.E_n^{\ge}=\{\omega:K(\omega)\ge n\}.En≥​={ω:K(ω)≥n}.

These events differ if death occurs exactly at time nnn. Given the relationship between exact and curtate lifetime,

En≥=En>∪{ω:T(ω)=n}.E_n^{\ge}=E_n^{>}\cup\{\omega:T(\omega)=n\}.En≥​=En>​∪{ω:T(ω)=n}.

Thus equation (3.9) uses exact lifetime and excludes death at T=nT=nT=n, whereas equation (3.10) uses curtate lifetime and includes it, since then K=⌊T⌋=nK=\lfloor T\rfloor=nK=⌊T⌋=n. This endpoint identity clarifies the textbook's conventions; it is not itself a numbered textbook result. No assumption is made that death at a policy anniversary has probability zero.

Pure-endowment benefit

Under the strict exact-lifetime convention, a unit pure endowment payable at time nnn has random present value

Zpure=vn1{T>n}.Z_{\mathrm{pure}}=v^n\mathbf1_{\{T>n\}}.Zpure​=vn1{T>n}​.

Equation (3.9) gives its expected value and variance:

EP[Zpure]=vnP(T>n),\mathbb E_P[Z_{\mathrm{pure}}]=v^nP(T>n),EP​[Zpure​]=vnP(T>n), Var⁡P(Zpure)=v2nP(T>n)(1−P(T>n)).\operatorname{Var}_P(Z_{\mathrm{pure}}) =v^{2n}P(T>n)\bigl(1-P(T>n)\bigr).VarP​(Zpure​)=v2nP(T>n)(1−P(T>n)).

Here vvv is a deterministic annual discount factor. The Lean algebra permits any real vvv, including the conventional case of a positive discount factor.

Endowment-assurance benefit

The endowment assurance pays a unit benefit at the end of the policy year of death if death occurs within the first nnn years. Otherwise, it pays at time nnn. As in equation (3.10), its present value is defined by

Zendow(ω)=vmin⁡(K(ω)+1,n).Z_{\mathrm{endow}}(\omega)=v^{\min(K(\omega)+1,n)}.Zendow​(ω)=vmin(K(ω)+1,n).

The theorem expresses this value as the sum of the unit term assurance from Mission II and the curtate maturity payment:

Zendow=∑k=0n−1vk+11{K=k}+vn1{K≥n}.Z_{\mathrm{endow}} =\sum_{k=0}^{n-1}v^{k+1}\mathbf1_{\{K=k\}} +v^n\mathbf1_{\{K\ge n\}}.Zendow​=k=0∑n−1​vk+11{K=k}​+vn1{K≥n}​.

The death benefit and maturity benefit are mutually exclusive. This gives the expected value and second moment:

EP[Zendow]=∑k=0n−1vk+1P(K=k)+vnP(K≥n),\mathbb E_P[Z_{\mathrm{endow}}] =\sum_{k=0}^{n-1}v^{k+1}P(K=k)+v^nP(K\ge n),EP​[Zendow​]=k=0∑n−1​vk+1P(K=k)+vnP(K≥n), EP[Zendow2]=∑k=0n−1v2(k+1)P(K=k)+v2nP(K≥n).\mathbb E_P[Z_{\mathrm{endow}}^2] =\sum_{k=0}^{n-1}v^{2(k+1)}P(K=k)+v^{2n}P(K\ge n).EP​[Zendow2​]=k=0∑n−1​v2(k+1)P(K=k)+v2nP(K≥n).

The variance is then

Var⁡P(Zendow)=EP[Zendow2]−(EP[Zendow])2.\operatorname{Var}_P(Z_{\mathrm{endow}}) =\mathbb E_P[Z_{\mathrm{endow}}^2] -\bigl(\mathbb E_P[Z_{\mathrm{endow}}]\bigr)^2.VarP​(Zendow​)=EP​[Zendow2​]−(EP​[Zendow​])2.

Formalisation goals and milestones

The formalisation proves measurability of the strict and curtate survival events, the exact boundary-event bridge, disjointness of death during the term from survival to maturity, and the pure-endowment expectation and variance. It also proves the endowment decomposition, expectation, second moment and variance. The formal capstone brings these results together under one probability measure, using the same exact and curtate lifetimes, term and discount factor. It states the boundary bridge explicitly and includes the pure-endowment mean and variance, along with the endowment present value, mean, second moment and variance.

The formalisation reuses Mission II's definition of term-assurance present value rather than reconstructing it. The main namespace remains ActuarialValuation, so later life-annuity missions can use the survival-event lemmas.

The edge cases require care. When n=0n=0n=0, the endowment assurance pays immediately. The strict pure endowment, however, still depends on whether T>0T>0T>0. Death at exactly T=nT=nT=n is represented separately and is never excluded by an unstated continuity assumption. The finite real-valued Lean identities permit negative or zero discount factors as a mathematical generalisation, although ordinary actuarial applications use positive discount factors.

Source and scope

The primary source is the Open Actuarial Textbooks Project, Life Contingencies: The Mathematics, Statistics, and Economics of Life Insurance, Chapter 2 §2.4.3, Chapter 3 §3.2.3 equation (3.9) and §3.2.4 equation (3.10).

  • https://openacttextdev.github.io/LifeCon/C-ModelingLifeTimes.html
  • https://openacttextdev.github.io/LifeCon/C-SimpleBenefit.html
  • https://prove2.me/missions/Actuarial_Mathematics_I%3A_Present_Values_of_Contingent_Cashflows

Mission II, Actuarial Mathematics II: Term Assurance Present Values and Moments, is under moderator review at drafting time. Its relevant published definitions and theorem IDs are referenced directly.

This mission formalises unit benefits over a finite term with deterministic annual discounting. It establishes a finite-horizon result, not an infinite-horizon theorem. It does not cover immediate death benefits, arbitrary benefit scales, lifetime-dependent interest, infinite whole-life present values or the full continuous-time theory of mortality.

28 thms1 active userReviewed
🏆Completed
Actuarial Science·Captain: WillR

Actuarial Mathematics II: Term Assurance Present Values and MomentsTextbook

Motivation

An nnn-year term assurance pays a benefit if the insured person dies in one of the first nnn policy years. It can pay only once. This matters when calculating the second moment: claims in different years cannot both occur, so the cross-products between them are zero.

Actuarial Mathematics I established finite expected present values, second moments and variances for general collections of contingent payments. This mission applies those results to one life and a fixed-term death benefit. It proves the familiar term-assurance formulas from reusable death-year events, rather than treating them as isolated actuarial notation.

Mathematical setting

Let (Ω,F,P)(\Omega,\mathcal F,P)(Ω,F,P) be a probability space and let K:Ω→NK:\Omega\to\mathbb NK:Ω→N be a measurable curtate future lifetime: the number of complete future years lived before death. For k∈Nk\in\mathbb Nk∈N, define the event of death during policy year k+1k+1k+1 by

Dk={ω∈Ω:K(ω)=k}.D_k=\{\omega\in\Omega:K(\omega)=k\}.Dk​={ω∈Ω:K(ω)=k}.

Each event DkD_kDk​ is measurable. The events are pairwise disjoint: if i≠ji\ne ji=j, then Di∩Dj=∅D_i\cap D_j=\varnothingDi​∩Dj​=∅.

Fix a policy term n∈Nn\in\mathbb Nn∈N and a constant annual discount factor vvv. A unit benefit is payable at time k+1k+1k+1 if death occurs during year k+1k+1k+1, for 0≤k<n0\leq k<n0≤k<n. Its random present value is

Zn(ω)=∑k=0n−1vk+11Dk(ω).Z_n(\omega)=\sum_{k=0}^{n-1}v^{k+1}\mathbf1_{D_k}(\omega).Zn​(ω)=k=0∑n−1​vk+11Dk​​(ω).

When n=0n=0n=0, the sum is zero. The implementation uses the previously published `ActuarialValuation.presentValue` definition with the schedule of death-year events, reusing the general valuation machinery. The theorem statements allow any real vvv, so the finite algebra also holds beyond the economic setting 0<v≤10<v\leq10<v≤1. The positive discount factors customary in the source are a special case.

Main theorem

The capstone proves these three identities together.

Expected present value:

EP[Zn]=∑k=0n−1vk+1P(Dk).\mathbb E_P[Z_n]=\sum_{k=0}^{n-1}v^{k+1}P(D_k).EP​[Zn​]=k=0∑n−1​vk+1P(Dk​).

Second moment:

EP[Zn2]=∑k=0n−1v2(k+1)P(Dk).\mathbb E_P[Z_n^2]=\sum_{k=0}^{n-1}v^{2(k+1)}P(D_k).EP​[Zn2​]=k=0∑n−1​v2(k+1)P(Dk​).

Variance:

Var⁡P(Zn)=∑k=0n−1v2(k+1)P(Dk)−(∑k=0n−1vk+1P(Dk))2.\operatorname{Var}_P(Z_n)= \sum_{k=0}^{n-1}v^{2(k+1)}P(D_k) -\left(\sum_{k=0}^{n-1}v^{k+1}P(D_k)\right)^2.VarP​(Zn​)=k=0∑n−1​v2(k+1)P(Dk​)−(k=0∑n−1​vk+1P(Dk​))2.

The second-moment simplification comes from the mutual exclusivity of distinct death-year events, not from independence. In the general double sum from Actuarial Mathematics I, every off-diagonal intersection of death-year events is empty, leaving a single sum.

Formalisation milestones

The milestones proceed from measurability of each death-year event to disjointness across years, vanishing products of distinct death-year indicators, the finite present-value representation, the expected value, the second moment and the variance. The proposal gives each mathematical statement and Lean target type separately. The capstone combines the three moment identities for the same KKK, vvv, nnn and PPP.

The project uses the existing `ActuarialValuation` namespace and imports published Mission I results where they apply. All dates are annual, and benefits are payable at the end of the year of death. Multiple lives, benefits payable immediately on death, stochastic discounts, select-life models and whole-of-life infinite sums are outside the scope of this capstone.

Why these results matter

A complete proof provides a reusable one-life mortality event model and a verified finite-term insurance valuation formula. The model can support a later mission on pure endowments and endowment assurances, where survival-to-term events complement death-in-term events, and another on temporary annuities, where survival events are nested rather than disjoint.

The results also make it straightforward to compare the traditional actuarial single-sum variance formula with the general dependent-cashflow theorem proved in Mission I.

Source and scope

The main mathematical source is Life Contingencies: The Mathematics, Statistics, and Economics of Life Insurance, Chapter 2 §2.4.3 for curtate future lifetime, Chapter 3 §3.1.1 equation (3.4) for disjoint-event moments, and §3.2.2 equation (3.8) for term-assurance present value, mean and variance.

  • https://openacttextdev.github.io/LifeCon/C-ModelingLifeTimes.html
  • https://openacttextdev.github.io/LifeCon/C-SimpleBenefit.html
  • https://actuaries.org.uk/media/yfnkmkbq/cm1_syllabus-2026-_final-proof.pdf (CM1 2026, life-contingency valuation objectives)
  • Actuarial Mathematics I: Present Values of Contingent Cashflows

These established actuarial formulas are not new mathematical conjectures. The contribution is a precise formal link in Lean from a curtate-lifetime model to the general contingent-payment valuation layer.

Formalisation challenges

The death-year set must be shown measurable from the measurability of KKK. The disjointness arguments must also cover degenerate cases such as n=0n=0n=0. The generic second-moment theorem uses an ordered double sum. The proof must remove only terms justified by Di∩Dj=∅D_i\cap D_j=\varnothingDi​∩Dj​=∅, retain the diagonal terms and use the correct end-of-year exponent k+1k+1k+1.

All formal declarations are written for Prove2Me's pinned Mathlib revision `0df444a360eaa60ab8c11dca51a86af692955474`. No local Lean compiler is used. Any private preflight compilation, if needed, is performed through Prove2Me's remote system.

15 thms1 active userReviewed
🏆Completed
Actuarial Science·Captain: WillR

Actuarial Mathematics I: Present Values of Contingent CashflowsTextbook

Motivation

Life insurers and pension schemes promise cashflows whose payment depends on future events. A term assurance pays if the insured dies within a stated period. A pension pays when a member survives to an instalment date. A contingent survivor pension may continue after the member dies. These liabilities differ in the events triggering payment, but share one mathematical operation: discount the amounts payable and aggregate them to obtain a random present value. Expected present value is used in premium setting and liability valuation, while the second moment and variance quantify how much the discounted liability can vary.

The open textbook Life Contingencies: The Mathematics, Statistics, and Economics of Life Insurance, Chapter 3, §3.1, introduces uncertain discounted cashflows using indicators, and derives their expected values in equation (3.3). Its treatment also distinguishes independent indicators from indicators connected through death or survival. This mission establishes a finite-horizon generalisation of those identities that handles arbitrary dependencies among payment-triggering events.

Setting

Fix a measurable sample space (Ω,F)(\Omega,\mathcal F)(Ω,F) with a probability measure PPP. A finite set III indexes distinct payment obligations. Each obligation i∈Ii\in Ii∈I has a non-negative integer payment date ti∈Nt_i\in\mathbb Nti​∈N, a deterministic cashflow amount ci∈Rc_i\in\mathbb Rci​∈R, and a measurable event Ai∈FA_i\in\mathcal FAi​∈F that triggers payment. The deterministic discount function d:N→Rd:\mathbb N\to\mathbb Rd:N→R assigns a multiplier to each date. Write 1Ai(ω)\mathbf 1_{A_i}(\omega)1Ai​​(ω) for the real-valued event indicator, equal to one on AiA_iAi​ and zero otherwise.

The random present value is

Z(ω)=∑i∈Id(ti)ci1Ai(ω).Z(\omega)=\sum_{i\in I}d(t_i)c_i\mathbf 1_{A_i}(\omega).Z(ω)=i∈I∑​d(ti​)ci​1Ai​​(ω).

The same date can support multiple obligations with distinct contingencies, such as member and survivor payments, pension tranches and expenses. The index distinguishes obligations even when their payment times coincide. Amounts may be positive, zero or negative and triggering events can be mutually exclusive, nested, independent or arbitrarily dependent. Finite schedules also allow no obligations. Each present value is bounded and has finite first and second moments because the schedule is finite, amounts are deterministic real numbers, and indicators are bounded.

Formalisation targets

The capstone theorem proves the expected present value, second moment and variance identities for the same random variable ZZZ. The expected present value is

EP[Z]=∑i∈Id(ti)ciP(Ai).\mathbb E_P[Z]=\sum_{i\in I}d(t_i)c_iP(A_i).EP​[Z]=i∈I∑​d(ti​)ci​P(Ai​).

The second moment retains all dependence terms, including pairs of different obligations payable on the same date:

EP[Z2]=∑i∈I∑j∈Id(ti)ci d(tj)cj P(Ai∩Aj).\mathbb E_P[Z^2]=\sum_{i\in I}\sum_{j\in I} d(t_i)c_i\,d(t_j)c_j\,P(A_i\cap A_j).EP​[Z2]=i∈I∑​j∈I∑​d(ti​)ci​d(tj​)cj​P(Ai​∩Aj​).

Consequently,

Var⁡P(Z)=∑i∈I∑j∈Id(ti)ci d(tj)cj (P(Ai∩Aj)−P(Ai)P(Aj)).\operatorname{Var}_P(Z)=\sum_{i\in I}\sum_{j\in I} d(t_i)c_i\,d(t_j)c_j\, \left(P(A_i\cap A_j)-P(A_i)P(A_j)\right).VarP​(Z)=i∈I∑​j∈I∑​d(ti​)ci​d(tj​)cj​(P(Ai​∩Aj​)−P(Ai​)P(Aj​)).

The finite identity for expected present value specialises the textbook's equation (3.3). The general joint-event second-moment identity extends its §3.1.1 discussion to arbitrary dependence. The goal combines all three formulas in a single result, with supporting milestone theorems for integrability, square-integrability, one-event expectation, the finite-schedule expectation formula, pairwise event interactions, the second moment and the variance.

Significance

A single reusable statement should allow a future mission to specify the trigger events and payment schedule of a policy and immediately obtain its discounted mean and variance. A life assurance can use disjoint death-year events, and an annuity can use nested survival-to-payment events. A guaranteed pension, deferred benefit, survivor pension or multiple-decrement model can use more general indicators. Later missions can also specialise the variance expression when events are known to be independent or mutually exclusive.

Examples of why the dependence assumptions matter. Write wi=d(ti)ciw_i=d(t_i)c_iwi​=d(ti​)ci​ for each discounted obligation amount:

  • Mutually exclusive death-year benefits: If Ai∩Aj=∅A_i\cap A_j=\varnothingAi​∩Aj​=∅ for every distinct pair i≠ji\ne ji=j, the general second moment simplifies to EP[Z2]=∑i∈Iwi2P(Ai)\mathbb E_P[Z^2]=\sum_{i\in I}w_i^2P(A_i)EP​[Z2]=∑i∈I​wi2​P(Ai​). This is the event structure behind term-assurance death-year payments.
  • Nested survival payments: For an annuity whose AiA_iAi​ denotes survival to time tit_iti​, whenever ti≤tjt_i\leq t_jti​≤tj​ we have Aj⊆AiA_j\subseteq A_iAj​⊆Ai​, and hence P(Ai∩Aj)=P(Aj)P(A_i\cap A_j)=P(A_j)P(Ai​∩Aj​)=P(Aj​). The later-survival probability therefore appears in the cross-term.
  • Different benefits at the same date: Two obligations indexed 111 and 222 may both have payment time 555, while depending on different events. Their second moment includes the cross-term 2w1w2P(A1∩A2)2w_1w_2P(A_1\cap A_2)2w1​w2​P(A1​∩A2​), even though t1=t2t_1=t_2t1​=t2​.

These specialisations use the same capstone rather than different definitions of actuarial present value.

The mathematical identities are established results of elementary probability and financial mathematics. The formalisation contribution is a stable actuarial cashflow interface connecting the relevant Lean measure-theoretic and probability results. It does not assert that the classical equations are newly discovered, or that general insurance reserving, stochastic interest rates or continuous-time survival models have already been formalised.

Difficulty

The event indicator is a bounded random variable, but its mathematical expectation is represented in Lean by integration against a measure. The development must reconcile the real-valued integrals with event probabilities represented as extended non-negative reals. Moreover, expanding the square of a finite random cashflow sum requires pairwise intersections without adding an independence assumption. The usual simplification that removes cross-terms is invalid for nested survival events or arbitrary dependent payment events.

The target also uses the real-valued variance from Mathlib. Its general API permits variables outside L2L^2L2, so a faithful proof must establish square-integrability for the finite event-based present value rather than use any default value for an undefined or infinite variance.

Formalisation scope

The initial development is discrete-time and finite-horizon, with distinct payment obligations indexed by a finite set. Each obligation has a nonnegative integer payment time. Different obligations may have the same payment time. Discount multipliers and payments are deterministic real values; no positivity assumption is needed for the algebraic identities. Each trigger is a measurable event and the underlying measure is a probability measure. Empty index sets and zero or negative payments are included. The joint-event formula remains valid when the same outcome triggers more than one payment.

Use Mathlib's existing MeasureTheory.Measure, MeasurableSet, integration and ProbabilityTheory.variance rather than redefining them. A lightweight namespace ActuarialValuation should define the random present value and retain clear time and cashflow parameter names. Supporting results should be small and import only genuine mathematical dependencies. The formalisation uses a generic obligation index type and a payment-time function into the natural numbers. The event family and amounts are indexed by obligations rather than by time.

There is no finite-to-infinite inference in the target; infinite sums require separate convergence results. There are no mortality rates, hazard functions, Markov transition kernels or stochastic discount factors in this mission. Those are targets for later missions, building on the valuation layer.

Selected references

  • Life Contingencies: The Mathematics, Statistics, and Economics of Life Insurance, Chapter 3, §3.1, equations (3.1)–(3.3) and §3.1.1, https://openacttextdev.github.io/LifeCon/C-SimpleBenefit.html.
  • Lean community, Mathlib 4: ProbabilityTheory.variance, https://leanprover-community.github.io/mathlib4_docs/Mathlib/Probability/Moments/Variance.html.
  • Prove2Me, Captain tour, https://prove2.me/tour/mission-captain.
9 thms1 active userReviewed
🏆Completed
Optimization·Captain: visuddhi

Information Limits of Multistage Inventory Control: BoundsResearch Paper

Motivation

An inventory policy specifies how much stock to hold before demand arrives. Its financial value is the expected sum of holding and shortage costs. Learning a useful policy and estimating its value are different statistical tasks. This proposal starts the formalization of the principal bounds in Qin, Simchi-Levi and Zhu, Information Limits of Multistage Inventory Control, using the September 29, 2026 arXiv version as a fixed source.

Setting

There are TTT periods, independent bounded demands, positive holding and shortage costs, zero ordering costs, zero lead time, and zero terminal salvage. An action yyy must satisfy y≥max⁡(x,0)y\ge\max(x,0)y≥max(x,0). The one-period cost is h(y−d)++p(d−y)+h(y-d)^++p(d-y)^+h(y−d)++p(d−y)+. Backlog has next state y−dy-dy−d; lost sales has next state (y−d)+(y-d)^+(y−d)+ and observes only min⁡(d,y)\min(d,y)min(d,y). An error tolerance always refers to total expected cost, not average cost per period. A scalar observation is counted once even if an algorithm reuses it in several periods.

The first fully specified statistical target is the stationary valuation lower bound. Holding and shortage costs are both one, the initial inventory is one, and IID demands equal zero with probability ρ\rhoρ and one otherwise. The optimal value is defined by the actual finite-horizon Bellman infimum over feasible real actions. It is not defined to equal the formula being proved. An arbitrary randomized estimator is a Markov kernel from the finite binary archive to the real line; the same kernel is used under both laws. This includes deterministic estimators as point-mass kernels.

Formalization targets

The first target is Theorem 3.7, including its confidence dependence. Put ρ±=1−1/(2T)±128ϵ/T2\rho_\pm=1-1/(2T)\pm128\epsilon/T^2ρ±​=1−1/(2T)±128ϵ/T2. For T≥8T\ge8T≥8, 0<ϵ≤T/10240<\epsilon\le T/10240<ϵ≤T/1024, and 0<η<1/20<\eta<1/20<η<1/2, simultaneous ϵ\epsilonϵ-accuracy on the two instances with probability at least 1−η1-\eta1−η requires

M≥T3360448ϵ2(1−2η)log⁡1−ηη.M\ge\frac{T^3}{360448\epsilon^2}(1-2\eta)\log\frac{1-\eta}{\eta}.M≥360448ϵ2T3​(1−2η)logη1−η​.

Its milestones establish zero-base-stock optimality, the exact value polynomial, its derivative and quadratic sensitivity, value separation, the KL bound, and the testing reduction. The derivative has a complete local Lean proof; the other statistical proof obligations remain open. The numerical constant is retained to match the source exactly.

The complete requested program also retains the adaptive full-observation policy lower bound (Theorem 3.1), the censored lower bound and integer-count correction (Theorem 3.3 and Proposition 3.5), the stationary policy upper bound (Proposition 4.5 and Corollary 4.7), the Product ERM benchmark, and the censored upper and matching minimax rate (Section 5.4). Their full statistical encodings have not yet been added to this initial draft. They must not be inferred from the first target or from the elementary supporting lemmas. The local source map records their assumptions and dependencies.

Significance

The valuation family has a common known optimal policy, yet estimating its cost requires a cubic number of scalar observations in the horizon at fixed accuracy and confidence. This gives a concrete distinction between identifying an action and measuring its consequences. The first target preserves both the inherited-stock condition and the full confidence factor; replacing inherited stock by an empty start would change the claim.

Five additional supporting statements isolate qualified recensoring, one-period truncation, cap closure, ERM regret transfer, and optimal-value stability. They are shared by later bounds. These five results and the value-polynomial derivative have passed local Lean checking in the pinned environment; their axiom audits show only propext, Classical.choice, and Quot.sound, with no sorryAx. This is local evidence, not server verification. A correct proof of the one-period truncation identity alone does not establish dynamic optimality, statistical coverage, or a minimax rate. Likewise a deterministic ERM inequality does not prove uniform convergence.

Difficulty

The information lower bounds quantify over data-dependent randomized procedures. Encoding only a fixed allocation or a deterministic output would lose part of the intended theorem. The full policy lower bound additionally permits adaptive sampling and randomized deployment, so it needs a different transcript model from the IID stationary valuation module. Censored upper bounds require conditional independence given the entire boundary array; ordinary predictability is insufficient. The 1/r1/r1/r factor counts all prescribed logs, including discarded observations.

Upper bounds depend on the horizon-normalized convergence result from Xie, Ma and Xin, now included in the companion draft VC Theory for Inventory Policies: Xie–Ma–Xin Bounds. The source cited here as Corollary 4 is Corollary 4.10 in that paper's v3; Theorem 4.9 is its inventory fat-shattering ingredient. The companion also retains stationary and (s,S) upper and lower bound families and Product ERM. Its Lemma 4.12 cyclic partition has a complete local Lean proof. Statistical convergence, two-sided and periodwise-cost extensions, high-probability product transfer, and the censoring reductions remain open proof obligations. Neither this draft nor its companion assumes those results have already been formally proved.

Formalization scope

The environment is Lean 4.33.1 with Mathlib revision 0df444a360eaa60ab8c11dca51a86af692955474. Draft theorem statements contain sorry because they are proof targets. Definition files contain no unproved assertions. Locally checked solution files must be distinguished from platform-verified proofs; a draft upload performs no server verification. Independent read-backs accompany the items so their quantifiers, domains, and total-function conventions can be reviewed directly.

The Bellman definition uses real infima. Proving nonemptiness and lower boundedness of the feasible objective set belongs to its optimality proof. Probability interpretations of finite sample weights apply only when ρ∈[0,1]\rho\in[0,1]ρ∈[0,1]; the hard-instance parameter bounds enforce an interior interval. The zero-sample case remains available to the testing theorem. No hypothesis assumes the desired lower bound, optimal-value formula, or derivative bound.

This is an editable initial draft, with the stationary valuation module and common algebraic foundations. It is not a certificate that all bounds in the paper have been formally proved, nor a launch-ready encoding of the complete bounds program.

Selected references

  • Hanzhang Qin, David Simchi-Levi and Ruihao Zhu, Information Limits of Multistage Inventory Control: Learning, Valuation, and Censoring, arXiv:2609.37380v1, 2026. https://arxiv.org/abs/2609.37380v1
  • Yaqi Xie, Will Ma and Linwei Xin, VC Theory for Inventory Policies, arXiv:2404.11509v3, 2026. https://arxiv.org/abs/2404.11509v3
14 thms1 active userReviewed
🏆Completed
Linear algebraRandom Matrix Theory·Captain: tc

An Introduction to Matrix Concentration Inequalities Ch 8: Lieb’s ConcavityTextbook

Prove Lieb’s concavity theorem (Theorem 8.1.1, also stated as Theorem 3.4.1): for fixed Hermitian H, the function A ↦ tr exp(H + log A) is concave on positive-definite matrices. This is the deterministic foundation of Chapter 3’s probabilistic argument.

Milestones follow the book’s route through generalized Klein, relative-entropy nonnegativity, variational trace formulas, operator Jensen, matrix perspectives, and joint convexity of relative entropy. Logarithm and trace-exponential monotonicity are included as reusable comparisons. The domain allows noncommuting positive-definite matrices without trace normalization.

Source: Tropp, January 2015 version, Chapter 8. Lean statements compile; proofs remain open.

Shared definitions: Chapter 3; submit that draft first.

Series: Ch. 3 | Ch. 4 | Ch. 5 | Ch. 6 | Ch. 7 | Ch. 8.

12 thms1 active userReviewed
🏆Completed
Linear algebraRandom Matrix Theory·Captain: tc

An Introduction to Matrix Concentration Inequalities Ch 4: Gaussian and Rademacher SeriesTextbook

Control the spectral norm of a matrix series with independent standard Gaussian or Rademacher coefficients. The goal is Theorem 4.1.1, including its variance identity, expected-norm estimate, and tail bound for rectangular complex matrices.

Milestones are the Gaussian and Rademacher matrix mgf/cgf estimates (Lemmas 4.6.2–3) and the Hermitian series bound (Theorem 4.6.1). The formulation keeps the source’s constants, both coefficient laws, and the zero-variance case. The shared Chapter 3 tools connect these transform estimates to concentration.

Source: Tropp, January 2015 version, Chapter 4. Lean statements compile; proofs remain open.

Shared definitions: Chapter 3; submit that draft first.

Series: Ch. 3 | Ch. 4 | Ch. 5 | Ch. 6 | Ch. 7 | Ch. 8.

10 thms1 active userReviewed
🏆Completed
Linear algebraRandom Matrix Theory·Captain: tc

An Introduction to Matrix Concentration Inequalities Ch 7: Intrinsic DimensionTextbook

Replace ambient matrix dimension by intrinsic dimension, the ratio of trace to spectral norm. The goal is intrinsic Matrix Bernstein (Theorem 7.3.1). Intrinsic Matrix Chernoff (Theorem 7.2.1) is a second major target within the mission.

Supporting milestones include the generalized Laplace bound, intrinsic-dimension trace estimate, block-diagonal identities, Hermitian Bernstein, and the expected-norm corollary. The statements retain the source’s constants, threshold restrictions, and matrix-valued mean or variance bounds. Nonzero proxies keep intrinsic dimension well-defined; the expectation constant is universal.

Source: Tropp, January 2015 version, Chapter 7. Lean statements compile; proofs remain open.

Shared definitions: Chapter 3; submit that draft first.

Series: Ch. 3 | Ch. 4 | Ch. 5 | Ch. 6 | Ch. 7 | Ch. 8.

17 thms1 active userReviewed
🏆Completed
Linear algebraRandom Matrix Theory·Captain: tc

An Introduction to Matrix Concentration Inequalities Ch 6: Matrix BernsteinTextbook

Control the spectral norm of a sum of independent, centered, bounded rectangular random matrices. The goal is Matrix Bernstein (Theorem 6.1.1), including the variance identity and both expected-norm and tail estimates.

Milestones cover Hermitian dilation, variance additivity, the bounded-summand mgf/cgf estimate (Lemma 6.6.2), and Hermitian Bernstein (Theorem 6.6.1). Chapter 3 supplies the general Laplace-transform machinery. The formulation uses the Euclidean operator norm, preserves the one-sided eigenvalue assumption in the Hermitian result, and includes deterministic zero sums.

Source: Tropp, January 2015 version, Chapter 6. Lean statements compile; proofs remain open.

Shared definitions: Chapter 3; submit that draft first.

Series: Ch. 3 | Ch. 4 | Ch. 5 | Ch. 6 | Ch. 7 | Ch. 8.

14 thms1 active userReviewed
🏆Completed
Linear algebraRandom Matrix Theory·Captain: tc

An Introduction to Matrix Concentration Inequalities Ch 5: Matrix ChernoffTextbook

Bound the extreme eigenvalues of a sum of independent positive-semidefinite random matrices. The goal is the complete Matrix Chernoff theorem (Theorem 5.1.1): both expectation estimates, both tails, and the identities for the mean’s extreme eigenvalues.

The supporting milestone is the matrix mgf/cgf estimate (Lemma 5.4.1); Chapter 3 supplies the master bounds. The Lean statement retains the different lower- and upper-tail deviation ranges, permits zero mean eigenvalues, and handles a zero summand bound explicitly.

Source: Tropp, January 2015 version, Chapter 5. Lean statements compile; proofs remain open.

Shared definitions: Chapter 3; submit that draft first.

Series: Ch. 3 | Ch. 4 | Ch. 5 | Ch. 6 | Ch. 7 | Ch. 8.

8 thms1 active userReviewed
🏆Completed
Linear algebraRandom Matrix Theory·Captain: tc

An Introduction to Matrix Concentration Inequalities Ch 3: Matrix Laplace TransformTextbook

Develop the reusable matrix Laplace-transform method behind Tropp’s concentration inequalities. The goal is Theorem 3.6.1: upper and lower tail and expectation bounds for sums of independent Hermitian random matrices, expressed through their matrix cumulant-generating functions.

Milestones cover the eigenvalue tail and expectation bounds (Propositions 3.2.1–2), probabilistic Lieb inequality (Corollary 3.4.2), and trace-cgf subadditivity (Lemma 3.5.1). This mission also supplies the series’ shared spectral, probability, and dilation definitions. Lieb’s underlying concavity theorem is the Chapter 8 goal.

The Lean statements give bounds for each admissible transform parameter, with explicit integrability hypotheses; optimization recovers the source’s infimum/supremum forms.

Source: Tropp, January 2015 version, Chapter 3. Lean statements compile; proofs remain open.

Series: Ch. 3 | Ch. 4 | Ch. 5 | Ch. 6 | Ch. 7 | Ch. 8.

8 thms1 active userReviewed
🏆Completed
Number Theory·Captain: Xiang Huang

Explicit normal numbers: Champernowne and Copeland–ErdősResearch Paper

Motivation

A real number is normal in base bbb when every block of kkk base-bbb digits occurs in its expansion with limiting frequency b−kb^{-k}b−k, as it would in a sequence of independent uniformly random digits. Borel introduced the notion in 1909 and proved that almost every real number is normal in every base, by an argument that produces no example. This mission collects the two classical papers that do produce examples: Champernowne's construction of 0.123456789101112…0.123456789101112\ldots0.123456789101112… and the theorem of Copeland and Erdős, which shows that the concatenation of any sufficiently dense increasing sequence of integers, the primes included, is normal.

Timeline.

  • 1909. Borel defines normality and proves that Lebesgue-almost every real number is normal in every base (Borel 1909).
  • 1933. Champernowne gives the first explicit normal numbers, among them the concatenation of the positive integers, and conjectures that the concatenation of the primes is normal as well (Champernowne 1933, Theorems I–IV).
  • 1946. Copeland and Erdős prove normality in base bbb of 0.a1a2a3…0.a_1a_2a_3\ldots0.a1​a2​a3​… for every increasing sequence of positive integers with more than NθN^\thetaNθ terms up to NNN, for every θ<1\theta<1θ<1 and all large NNN; the primes are a special case (Copeland–Erdős 1946).

Setting

A digit sequence is a function s:N→Ns:\mathbb N\to\mathbb Ns:N→N; s0s_0s0​ is the first digit after the point. A word is a finite list w=(w0,…,wk−1)w=(w_0,\dots,w_{k-1})w=(w0​,…,wk−1​) of naturals. For N∈NN\in\mathbb NN∈N, the occurrence count count(s,w,N)\mathrm{count}(s,w,N)count(s,w,N) is the number of positions i<Ni<Ni<N with si+j=wjs_{i+j}=w_jsi+j​=wj​ for every j<kj<kj<k; overlapping occurrences each count.

The sequence sss is normal in base bbb (IsNormalSeq b s) if, for every word www with all entries <b<b<b,

lim⁡N→∞count(s,w,N)N=b−∣w∣.\lim_{N\to\infty}\frac{\mathrm{count}(s,w,N)}{N}=b^{-|w|}.N→∞lim​Ncount(s,w,N)​=b−∣w∣.

The nnn-th base-bbb digit of a real xxx after the point is digitb(x,n)=⌊x b n+1⌋ mod b\mathrm{digit}_b(x,n)=\lfloor x\,b^{\,n+1}\rfloor \bmod bdigitb​(x,n)=⌊xbn+1⌋modb, and xxx is normal in base bbb (IsNormalReal b x) if n↦digitb(x,n)n\mapsto \mathrm{digit}_b(x,n)n↦digitb​(x,n) is normal in base bbb. The integer part of xxx plays no role; for a rational with two expansions the floor selects the one not ending in repeated (b−1)(b-1)(b−1)'s.

Formalization targets

Goal: the Copeland–Erdős theorem

If a1<a2<⋯a_1<a_2<\cdotsa1​<a2​<⋯ is an increasing sequence of positive integers such that, for every θ<1\theta<1θ<1, the number of ai≤Na_i\le Nai​≤N exceeds NθN^\thetaNθ for all large NNN, then the digit sequence obtained by writing the base-bbb expansions of a1,a2,…a_1,a_2,\ldotsa1​,a2​,… one after another is normal in base bbb. A machine-checked proof is on the platform.

Milestones

  1. Copeland–Erdős counting lemma (p. 858): few strings of length nnn contain a fixed word a number of times far from the expected count. Proved.
  2. Champernowne's Theorems I, II, IV: the block constructions are normal. Proved.
  3. Champernowne's Theorem III: the concatenation of the positive integers is normal in every base. Proved.
  4. The primes: the Copeland–Erdős constant 0.235711131719…0.235711131719\ldots0.235711131719… is normal in every base. Proved.
  5. Borel's theorem: Lebesgue-almost every real number is normal in every base. Classical, but not yet formalized here; this milestone is open.

Significance

These are the standard examples of explicitly given normal numbers, and the Copeland–Erdős block argument is the model for most later constructions. The mission also fixes a definition of normality for real numbers together with the transfer from digit sequences to reals, which other work on normal numbers can import.

Formalization scope

All declarations live in the namespace Normal and use the definition bundle Normal_Core: count, IsNormalSeq, digit, IsNormalReal; ofDigits b s =∑nsnb−(n+1)=\sum_n s_n b^{-(n+1)}=∑n​sn​b−(n+1); the concatenation operators flatten, digitsBE, concatDigits; the Champernowne and Copeland–Erdős constants.

Conventions: digits are read after the point with the floor convention above; frequencies are limits of real quotients; words of every length k≥0k\ge 0k≥0 with entries <b<b<b are quantified; results for real numbers are stated for bases b≥2b\ge 2b≥2 by hypothesis.

The proofs are imported from the repository xiangyazi24/normal and verified by the platform. Their auxiliary lemmas are published on the platform as dependencies of the milestones and are not listed as items of this mission.

The open question whether π\piπ is normal is a separate mission and is not approached by the methods here, which rely on the number being given as an explicit concatenation of blocks.

Selected references

  • É. Borel, Les probabilités dénombrables et leurs applications arithmétiques, Rend. Circ. Mat. Palermo 27 (1909), 247–271. https://doi.org/10.1007/BF03019651
  • D. G. Champernowne, The construction of decimals normal in the scale of ten, J. London Math. Soc. 8 (1933), 254–260. https://doi.org/10.1112/jlms/s1-8.4.254
  • A. H. Copeland and P. Erdős, Note on normal numbers, Bull. Amer. Math. Soc. 52 (1946), 857–860. https://doi.org/10.1090/S0002-9904-1946-08657-7
7 thms1 active userReviewed
🏆Completed
CombinatoricsQuantum InformationTheoretical Computer Science·Captain: sattath

A Quantum Lovász Local Lemma (Ambainis, Kempe, Sattath)Research Paper

Status: complete. This mission records a finished formalization rather than an open call for work. Every statement below, including the goal, was uploaded together with a proof that the platform has verified, so there is nothing left to prove.

Motivation

The Lovász Local Lemma (LLL) is a basic tool of the probabilistic method. It shows that a collection of rare "bad" events can all be avoided simultaneously, even when the events are not independent, provided each event depends on only a few others. Its best-known application is to satisfiability: a kkk-CNF formula in which every variable appears in few clauses has a satisfying assignment.

Quantum satisfiability (kkk-QSAT) is the quantum analogue of kkk-SAT. Clauses are replaced by projectors acting on kkk qubits, and the question is whether some nonzero state is annihilated by all of them, equivalently whether the corresponding local Hamiltonian is frustration-free. Bravyi showed that kkk-QSAT is QMA1\mathsf{QMA}_1QMA1​-complete for k≥4k \ge 4k≥4, so sufficient conditions for satisfiability are of interest in quantum complexity theory and in many-body physics. Ambainis, Kempe and Sattath (arXiv:0911.1696, J. ACM 2012) proved a quantum version of the LLL in which probability is replaced by relative dimension, and derived a sufficient condition for kkk-QSAT instances to be satisfiable.

Timeline

  • 1975. Erdős and Lovász introduce the local lemma, in the symmetric form, to colour hypergraphs (Infinite and Finite Sets, 1975).
  • 1977. Spencer publishes the general (asymmetric) form, credited to Lovász, and applies it to Ramsey numbers (Discrete Math. 20, 1977).
  • 1985. Shearer determines the optimal dependency condition, in terms of the independence polynomial of the dependency graph (Combinatorica 5, 1985).
  • 2009 to 2010. Moser gives a constructive proof for kkk-SAT (arXiv:0810.4812, STOC 2009); Moser and Tardos make the general lemma constructive (arXiv:0903.0544, J. ACM 2010).
  • 2011. Kolipaka and Szegedy show that the Moser and Tardos algorithm works throughout Shearer's region, giving an algorithmic proof of Shearer's bound (Moser and Tardos meet Lovász, STOC 2011, 235 to 244).
  • 2009 to 2012. Ambainis, Kempe and Sattath prove the quantum local lemma and its kkk-QSAT corollaries (arXiv:0911.1696, J. ACM 59(5):24, 2012).
  • 2013. Arad and Sattath (arXiv:1310.7766) and, independently, Schwarz, Cubitt and Verstraete (arXiv:1311.6474) give constructive versions for commuting projectors.
  • 2016. Sattath, Morampudi, Laumann and Moessner extend Shearer's criterion to the quantum setting and conjecture that it is tight (arXiv:1509.07766, PNAS 2016).
  • 2017. He, Li, Liu, Wang and Xia show that the abstract and variable versions of the local lemma differ: Shearer's bound, tight for the abstract version, is not tight for the variable version (the setting of kkk-SAT, where events are determined by independent variables) for instance when the base graph of the event-variable graph has an induced cycle of length at least 4, while there is no gap when it is a tree (arXiv:1709.05143, FOCS 2017).
  • 2017. Gilyén and Sattath give an efficient quantum algorithm for the non-commuting case under a spectral gap condition (arXiv:1611.08571, FOCS 2017).
  • 2018 to 2019. He, Li, Sun and Zhang prove this conjecture: Shearer's bound is tight for the quantum local lemma, so in this respect the quantum lemma behaves like the abstract version rather than the variable one; they also show that the tight regions of the quantum lemma and of its commuting variant differ in general (arXiv:1804.07055, STOC 2019).

Setting

Let VVV be a nonzero finite-dimensional vector space. For a subspace X⊆VX \subseteq VX⊆V, the relative dimension is

R(X)=dim⁡Xdim⁡V.R(X) = \frac{\dim X}{\dim V}.R(X)=dimVdimX​.

It plays the role of probability: subspaces replace events, intersection replaces conjunction, and R(X∣Y)=dim⁡(X∩Y)/dim⁡YR(X \mid Y) = \dim(X \cap Y)/\dim YR(X∣Y)=dim(X∩Y)/dimY replaces conditional probability.

Subspaces X1,…,XnX_1, \dots, X_nX1​,…,Xn​ have dependency sets Γ(1),…,Γ(n)⊆{1,…,n}\Gamma(1), \dots, \Gamma(n) \subseteq \{1, \dots, n\}Γ(1),…,Γ(n)⊆{1,…,n} when, for every iii and every set SSS of indices with i∉Si \notin Si∈/S and S∩Γ(i)=∅S \cap \Gamma(i) = \emptysetS∩Γ(i)=∅,

R(Xi∩⋂j∈SXj)=R(Xi) R(⋂j∈SXj).R\Big(X_i \cap \bigcap_{j \in S} X_j\Big) = R(X_i)\, R\Big(\bigcap_{j \in S} X_j\Big).R(Xi​∩j∈S⋂​Xj​)=R(Xi​)R(j∈S⋂​Xj​).

In words, XiX_iXi​ is independent, for relative dimension, of every intersection of subspaces outside its dependency set.

A kkk-QSAT instance on nnn qubits is a family of projectors Π1,…,Πm\Pi_1, \dots, \Pi_mΠ1​,…,Πm​, each acting on a set of kkk qubits and extended by the identity on the others. It is satisfiable if a nonzero state lies in the kernel of every Πi\Pi_iΠi​.

The formalization proves the local lemma once, for an abstract valuation: a real function RRR on a bounded lattice that is nonnegative, monotone and modular, R(x)+R(y)=R(x∨y)+R(x∧y)R(x) + R(y) = R(x \vee y) + R(x \wedge y)R(x)+R(y)=R(x∨y)+R(x∧y), with R(⊤)=1R(\top) = 1R(⊤)=1 and R(⊥)=0R(\bot) = 0R(⊥)=0. Relative dimension on subspaces and the uniform probability on subsets of a finite set are the two instances used.

Formalization targets

Goal: the quantum local lemma (Theorem 14)

Let X1,…,XnX_1, \dots, X_nX1​,…,Xn​ be subspaces with dependency sets Γ(i)\Gamma(i)Γ(i), and let 0≤yi<10 \le y_i < 10≤yi​<1 satisfy R(Xi)≥1−yi∏j∈Γ(i)(1−yj)R(X_i) \ge 1 - y_i \prod_{j \in \Gamma(i)} (1 - y_j)R(Xi​)≥1−yi​∏j∈Γ(i)​(1−yj​) for every iii. Then

R(⋂i=1nXi) ≥ ∏i=1n(1−yi).R\Big(\bigcap_{i=1}^{n} X_i\Big) \ \ge\ \prod_{i=1}^{n} (1 - y_i).R(i=1⋂n​Xi​) ≥ i=1∏n​(1−yi​).

Other formalized results

All of these are proved on Prove2Me and can be found by name (tag quantum-lll):

  1. The same statement for any valuation on a bounded lattice (Theorem 14, abstract form): QLLL.Valuation.lll.
  2. The symmetric quantum local lemma: if R(Xi)≥1−pR(X_i) \ge 1 - pR(Xi​)≥1−p, each XiX_iXi​ has at most ddd dependencies and p⋅e⋅(d+1)≤1p \cdot e \cdot (d + 1) \le 1p⋅e⋅(d+1)≤1, then R(⋂iXi)>0R(\bigcap_i X_i) > 0R(⋂i​Xi​)>0 (Theorem 4): QLLL.quantum_lll_symmetric.
  3. The classical Erdős and Lovász local lemma, asymmetric and symmetric (Theorems 13 and 1), for the uniform probability on a finite set: QLLL.SAT.classical_lll, QLLL.SAT.classical_lll_symmetric.
  4. kkk-SAT: a kkk-CNF formula in which every variable appears in at most 2k/(ek)2^k/(e k)2k/(ek) clauses is satisfiable (Corollary 2): QLLL.SAT.sat_of_degree_le.
  5. kkk-QSAT: an instance of rank-≤r\le r≤r constraints in which every qubit appears in at most 2k/(erk)2^k/(e r k)2k/(erk) constraints is satisfiable (Corollary 16): QLLL.PiQSAT.inf_ker_extendOp_ne_bot on Mathlib's tensor product, and QLLL.QSAT.satisfiable_of_degree_le for orthogonal projectors.
  6. Two results beyond the paper: infinite kkk-SAT (QLLL.SAT.exists_assignment_forall), and the local lemma for infinite index sets under a continuity hypothesis (QLLL.lll_iInf).

Significance

The quantum local lemma gives a sufficient condition for kkk-QSAT satisfiability that depends only on the local structure of the instance: the rank of the projectors and the number of projectors per qubit. It shows that the classical criterion survives the passage from events to subspaces, even though subspaces do not form a distributive lattice. Later work on constructive and tight versions, listed in the timeline, builds on this statement.

All results of this mission are proved and machine-checked. The Lean development was written as a complete formalization of the paper, and every statement here was uploaded together with a proof verified by the platform. What the mission adds is a reusable, Mathlib-based library: the local lemma for abstract valuations, its classical and quantum instances, kkk-QSAT stated on Mathlib's tensor product of qubits, and linear algebra on intersections of tensor products of subspaces that Mathlib does not yet contain. Mathlib currently has no form of the Lovász Local Lemma.

Difficulty

The classical proof uses complements of events and the identity Pr⁡(A)+Pr⁡(Ac)=1\Pr(A) + \Pr(A^c) = 1Pr(A)+Pr(Ac)=1, together with the distributive law for events. Subspaces satisfy neither in general: the lattice of subspaces is modular but not distributive, and the orthogonal complement does not distribute over intersections. The argument has to be rebuilt from the properties of relative dimension that do hold. For kkk-QSAT, the further difficulty is to show that constraints acting on disjoint sets of qubits are independent for relative dimension, which requires computing intersections and dimensions of tensor products of subspaces.

Formalization scope

Conventions committed to in the Lean statements:

  1. The local lemma is stated for nnn indexed subspaces (or lattice elements) and real weights 0≤yi<10 \le y_i < 10≤yi​<1. An index is never in its own dependency set's complement: independence is required from intersections over sets SSS that avoid both Γ(i)\Gamma(i)Γ(i) and iii itself.
  2. Independence is stated in product form, R(X∩Y)=R(X)R(Y)R(X \cap Y) = R(X) R(Y)R(X∩Y)=R(X)R(Y), which agrees with the conditional form of the paper whenever the conditional relative dimension is defined.
  3. The quantum lemma holds over any field and requires VVV to be nonzero and finite-dimensional.
  4. The classical lemmas are stated for good events (complements of bad events) under the uniform probability on a finite nonempty set.
  5. Qubits: the main kkk-QSAT statement uses Mathlib's tensor product ⨂jC2\bigotimes_{j} \mathbb{C}^2⨂j​C2 and allows arbitrary local operators of rank at most rrr, since only the dimension of their kernels enters. A second form, on functions from bit strings to C\mathbb{C}C, requires the constraints to be orthogonal projectors (idempotent and self-adjoint). Self-adjointness cannot yet be stated on Mathlib's nnn-fold tensor product, which has no inner product in the pinned Mathlib version.
  6. Degree conditions are integers: "at most 2k/(erk)2^k/(e r k)2k/(erk) projectors per qubit" is written as at most D′+1D' + 1D′+1 with r2k⋅e⋅(kD′+1)≤1\frac{r}{2^k} \cdot e \cdot (k D' + 1) \le 12kr​⋅e⋅(kD′+1)≤1, which the paper's hypothesis implies.

An infinite version of kkk-QSAT is deliberately not included. Nonzero subspaces can have all finite intersections nonzero and zero total intersection, so the infinite statement has to be phrased with compatible families of density matrices, and the current Lean formulation does not yet restrict the constraints to positive operators.

The blueprint of the formalization, linking every paper statement to its Lean declaration, is at sattath.github.io/Quantum-Lovasz-Local-Lemma/blueprint. Natural extensions, outside the scope of this mission: the orthogonal-projector form of Corollary 16 on Mathlib's tensor product once inner products on nnn-fold tensor products are available, Shearer-type conditions, and a measure-theoretic classical local lemma on general probability spaces.

A note from the contributor

This is my first contribution to Prove2Me, so the definitions, statements, proofs and descriptions may fall short of what an experienced contributor would produce. Some choices may be unidiomatic, some lemmas may duplicate Mathlib, and the split into entries could be better. Every proof is checked by Lean, so the theorems are correct as stated; the question is whether they are stated in the most useful way.

Selected references

  • P. Erdős and L. Lovász, Problems and results on 3-chromatic hypergraphs and some related questions, Infinite and Finite Sets, Colloq. Math. Soc. János Bolyai 10, 1975, 609 to 627.
  • J. Spencer, Asymptotic lower bounds for Ramsey functions, Discrete Math. 20, 1977, 69 to 76.
  • J. B. Shearer, On a problem of Spencer, Combinatorica 5, 1985, 241 to 245.
  • R. A. Moser, A constructive proof of the Lovász local lemma, STOC 2009. arXiv:0810.4812
  • R. A. Moser and G. Tardos, A constructive proof of the general Lovász local lemma, J. ACM 57(2), 2010. arXiv:0903.0544
  • A. Ambainis, J. Kempe and O. Sattath, A quantum Lovász local lemma, J. ACM 59(5):24, 2012. arXiv:0911.1696
  • I. Arad and O. Sattath, A constructive quantum Lovász local lemma for commuting projectors, 2013. arXiv:1310.7766
  • M. Schwarz, T. S. Cubitt and F. Verstraete, An information-theoretic proof of the constructive commutative quantum Lovász local lemma, 2013. arXiv:1311.6474
  • O. Sattath, S. C. Morampudi, C. R. Laumann and R. Moessner, When a local Hamiltonian must be frustration-free, PNAS 113(23), 2016. arXiv:1509.07766
  • A. Gilyén and O. Sattath, On preparing ground states of gapped Hamiltonians: an efficient quantum Lovász local lemma, FOCS 2017. arXiv:1611.08571
  • K. He, Q. Li, X. Sun and J. Zhang, Quantum Lovász local lemma: Shearer's bound is tight, STOC 2019. arXiv:1804.07055
1 thm1 active userReviewed
🏆Completed
Linear algebraMachine Learning·Captain: Minghui

Fine-Tuning Can Distort Pretrained Features: Perfect-Feature LP-FT SeparationResearch Paper

Why initialization matters for transfer learning

Transfer learning starts with a representation learned on an earlier task and adapts it to a new one. Two common choices are linear probing, which changes only the final linear predictor, and fine-tuning, which changes the representation as well. These procedures optimize related training objectives, but their behavior away from the training data can differ. Kumar and coauthors study this distinction through two-layer linear networks, alongside experiments with nonlinear networks. This mission formalizes their perfect-feature LP-FT result, rather than the empirical claims or the general imperfect-feature comparison. See Section 3.4, Proposition 3.7, PDF p. 10.

LP-FT first learns a head by linear probing and then uses that head to initialize full fine-tuning. The perfect-feature setting isolates the effect of head initialization: the representation already contains exactly the features needed to predict the labels, but the head initially need not use them correctly. The mathematical question is whether joint training preserves or loses the representation's ability to predict outside the observed training subspace.

Linear predictors, training data, and OOD loss

An input is a vector x∈Rdx\in\mathbb R^dx∈Rd. A feature extractor is a matrix B∈Rk×dB\in\mathbb R^{k\times d}B∈Rk×d, and a head is a vector v∈Rkv\in\mathbb R^kv∈Rk. Together they predict v⊤Bxv^\top Bxv⊤Bx, with effective weight vector B⊤vB^\top vB⊤v. The fixed matrix X∈Rn×dX\in\mathbb R^{n\times d}X∈Rn×d contains the nnn training inputs as rows. Their span is S=rowspace⁡(X)S=\operatorname{rowspace}(X)S=rowspace(X), with dimension mmm.

The ground truth has orthonormal-row features B⋆B_\starB⋆​ and a nonzero head v⋆v_\starv⋆​. Write w⋆=B⋆⊤v⋆w_\star=B_\star^\top v_\starw⋆​=B⋆⊤​v⋆​ and Y=Xw⋆Y=Xw_\starY=Xw⋆​. Perfect pretrained features mean B0=UB⋆B_0=UB_\starB0​=UB⋆​ for an orthogonal matrix UUU. The corresponding aligned head is u=Uv⋆u=Uv_\staru=Uv⋆​. The dimensions satisfy 1≤k≤m1\le k\le m1≤k≤m and m+k<dm+k<dm+k<d.

The two geometric assumptions require the orthogonal projections from R0=rowspace⁡(B0)R_0=\operatorname{rowspace}(B_0)R0​=rowspace(B0​) into SSS and into S⊥S^\perpS⊥ to be injective. In this dimension regime these are exactly the positive largest-principal-angle cosine conditions used by the paper. They demand more than two subspaces having some nonorthogonal directions. The Lean definition spells out injectivity of v↦ΠTB0⊤vv\mapsto\Pi_T B_0^\top vv↦ΠT​B0⊤​v for each T∈{S,S⊥}T\in\{S,S^\perp\}T∈{S,S⊥}. See Definition 3.2 and Appendix A.1, PDF pp. 7 and 22-23.

An out-of-distribution law μ\muμ is any probability measure on Rd\mathbb R^dRd with a finite second moment and positive-definite uncentered second-moment matrix Σ=Eμ[xx⊤]\Sigma=\mathbb E_\mu[xx^\top]Σ=Eμ​[xx⊤]. Its mean need not be zero. Define

LOOD(v,B)=Ex∼μ[(v⊤Bx−w⋆⊤x)2].L_{\rm OOD}(v,B)=\mathbb E_{x\sim\mu} [(v^\top Bx-w_\star^\top x)^2].LOOD​(v,B)=Ex∼μ​[(v⊤Bx−w⋆⊤​x)2].

Both training methods use the unnormalized loss L^(v,B)=∥XB⊤v−Y∥22\widehat L(v,B)=\|XB^\top v-Y\|_2^2L(v,B)=∥XB⊤v−Y∥22​. Fine-tuning follows its gradient flow in both parameters; linear probing keeps B=B0B=B_0B=B0​. Time is real and nonnegative. These are the paper's equations (3.2)-(3.3), PDF p. 6.

Formalization targets

The goal is Proposition 3.7 in an explicit nonzero-signal regime. For σ>0\sigma>0σ>0, initialize an FT head with independent Gaussian coordinates, v0∼N(0,σ2Ik)v_0\sim\mathcal N(0,\sigma^2I_k)v0​∼N(0,σ2Ik​). Establish

Pr⁡ ⁣[∀t≥0,LOOD(vFT(t),BFT(t))>0]=1.\Pr\!\left[\forall t\ge0,\quad L_{\rm OOD}(v_{\rm FT}(t),B_{\rm FT}(t))>0\right]=1.Pr[∀t≥0,LOOD​(vFT​(t),BFT​(t))>0]=1.

Linear probing, from any initial head, must converge to uuu. Fine-tuning initialized at its limit must satisfy

vLP(t)⟶u,∀t≥0,LOOD(vLP-FT(t),BLP-FT(t))=0.v_{\rm LP}(t)\longrightarrow u,\qquad \forall t\ge0,\quad L_{\rm OOD}(v_{\rm LP\text{-}FT}(t),B_{\rm LP\text{-}FT}(t))=0.vLP​(t)⟶u,∀t≥0,LOOD​(vLP-FT​(t),BLP-FT​(t))=0.

The probability-one event applies to all times simultaneously. The goal also asserts existence of the relevant global flows; a conditional claim about a possibly nonexistent trajectory would not suffice. The statement does not assert a numerical error lower bound or a positive time-infimum.

Seven milestones supply the supporting results: global flow existence and FT uniqueness; unchanged features orthogonal to the training span; the balancedness invariant; the second-moment identity for OOD risk; almost-sure Gaussian head misalignment; exact LP recovery; and stationarity after LP initialization. The principal source is Appendices A.2 and A.7, PDF pp. 23-31 and 45-47.

What the result establishes

The result distinguishes two initializations of the same joint-training procedure. In this idealized setting, a head obtained by linear probing gives zero OOD loss throughout subsequent fine-tuning, while a Gaussian head almost surely has positive OOD loss at every finite time. The conclusion concerns population squared prediction error, not classification accuracy or a finite test-set estimate.

The paper establishes the mathematical claim; this mission asks for a Lean proof of the stated model and result. The scope is deliberately limited to perfect pretrained features. It does not claim an LP-FT upper bound for imperfect features, which the authors identify as a further challenge in Section 3.4, PDF p. 10. A completed development would also provide reusable components for finite dimensional gradient flows, factorized linear models, and population risk.

Why the proof needs the training dynamics

The training loss alone does not select a unique effective predictor in an overparameterized problem. Knowing that a predictor fits the observed examples therefore does not determine its OOD loss. Formalization must track the head and feature extractor together, and it must distinguish parameter stationarity from a claim that a derivative happens to vanish at one time. The Gaussian conclusion also requires one event controlling an uncountable set of times; separate probability-one statements for individual times would be weaker.

Formalization scope and conventions

Vectors use Mathlib's finite dimensional real Euclidean spaces. Matrices are represented as continuous linear maps, with Euclidean adjoints and operator norms. The feature update is written explicitly as the Frobenius-gradient equation; it is not a gradient with respect to the operator norm. Differentiability is imposed within [0,∞)[0,\infty)[0,∞), including the right derivative at zero.

The dimensions, nonzero target, positive Gaussian scale, finite second moments, and projection injectivity are explicit. The nonzero target restricts the formalization to the regime of the Gaussian alignment argument in Lemma A.12; k≤mk\le mk≤m makes the identifiability condition used in Proposition A.20 precise. The random-head law is the scaled standard Gaussian measure. No randomness of the fixed training matrix or independence from an additional data draw is assumed.

The model contains no assumed convergence, invariant, or desired risk bound. Each of those is a theorem obligation. The well-posedness milestone makes explicit an analytic prerequisite of the source's flow notation. The risk milestone uses the identity in (A.29)-(A.32), avoiding the reversed inequality printed in (A.28). The quantitative constant in Theorem 3.3 is outside this mission. Source-aligned proofs and the supporting analysis infrastructure are welcome; changing the learning rule or assuming a milestone inside the model would change the task.

Selected references

  • Ananya Kumar, Aditi Raghunathan, Robbie Jones, Tengyu Ma, and Percy Liang, Fine-Tuning can Distort Pretrained Features and Underperform Out-of-Distribution, ICLR 2022, arXiv:2202.10054v1. Main target: Section 3.4, Proposition 3.7, PDF p. 10, equations (3.10)-(3.11); proof: Appendix A.7, PDF pp. 45-47, Proposition A.20 and (A.208)-(A.218). Supporting invariants: Appendix A.2, PDF p. 24, Lemmas A.3-A.4, equations (A.15)-(A.20). Gaussian alignment: Appendix A.3, PDF pp. 34-35, Lemmas A.11-A.12.
9 thms1 active userReviewed
🏆Completed
Machine Learning·Captain: Minghui

Neural Tangent Kernel: The Infinite-Width Initialization LimitResearch Paper

Why an initialization kernel matters

A neural network is nonlinear in its parameters, but a small change in those parameters changes its predictions through a Jacobian. The neural tangent kernel is the Gram kernel of that Jacobian: it records which changes in predictions can be produced by common parameter updates. An initialization limit identifies a deterministic object behind this random kernel. It supplies a mathematical starting point for studying wide networks through kernel methods, before addressing the additional question of how the kernel changes during training. Jacot, Gabriel, and Hongler establish this initialization limit in Section 4.1, Theorem 1, PDF p. 5.

The requested result is already a theorem of the paper. The open work here is its formal proof in Lean, including the probability model and the order of limits. The mission is classified as OpenProblem at the request of its proposer; that label does not assert that the underlying mathematical result remains an unsolved research question.

The source appeared in 2018 and was published at NeurIPS 2018; this formalization fixes arXiv version 4, dated February 10, 2020, so that page references and conventions remain stable. Its Appendix A explicitly distinguishes the sequential limit proved there from a possible stronger simultaneous-width limit.

Networks, randomness, and the two kernels

Fix positive integers ddd and qqq, the input and output dimensions, a hidden-layer count h≥0h\ge0h≥0, a bias scale β>0\beta>0β>0, and a Lipschitz function σ:R→R\sigma:\mathbb R\to\mathbb Rσ:R→R. Write L=h+1L=h+1L=h+1 for the number of affine layers, with n0=dn_0=dn0​=d, nL=qn_L=qnL​=q, and positive hidden widths n1,…,nhn_1,\ldots,n_hn1​,…,nh​. The parameters are all entries of the weight matrices and bias vectors. Every parameter is sampled independently from N(0,1)\mathcal N(0,1)N(0,1).

For an input xxx, let a(0)(x)=xa^{(0)}(x)=xa(0)(x)=x and define

zj(ℓ+1)(x)=1nℓ∑iWji(ℓ)ai(ℓ)(x)+βbj(ℓ).z^{(\ell+1)}_j(x)=\frac1{\sqrt{n_\ell}} \sum_i W^{(\ell)}_{ji}a^{(\ell)}_i(x)+\beta b^{(\ell)}_j.zj(ℓ+1)​(x)=nℓ​​1​i∑​Wji(ℓ)​ai(ℓ)​(x)+βbj(ℓ)​.

At each hidden layer, a(ℓ)=σ(z(ℓ))a^{(\ell)}=\sigma(z^{(\ell)})a(ℓ)=σ(z(ℓ)) coordinatewise. The output is fθ(x)=z(L)(x)f_\theta(x)=z^{(L)}(x)fθ​(x)=z(L)(x), with no final activation. These are the conventions of Section 2, PDF pp. 2–3. Matrix storage order in Lean uses destination then source; the displayed operation is unchanged.

For output coordinates k,k′k,k'k,k′, set

Θkk′(L)(θ;x,y)=∑p∂θpfθ,k(x) ∂θpfθ,k′(y).\Theta^{(L)}_{kk'}(\theta;x,y)=\sum_p \partial_{\theta_p}f_{\theta,k}(x)\, \partial_{\theta_p}f_{\theta,k'}(y).Θkk′(L)​(θ;x,y)=p∑​∂θp​​fθ,k​(x)∂θp​​fθ,k′​(y).

The sum includes every weight and every bias, as in Section 4, PDF p. 5.

The covariance kernel starts with

Σ(1)(x,y)=⟨x,y⟩d+β2.\Sigma^{(1)}(x,y)=\frac{\langle x,y\rangle}{d}+\beta^2.Σ(1)(x,y)=d⟨x,y⟩​+β2.

Given a centered Gaussian pair (U,V)(U,V)(U,V) with covariance matrix obtained by evaluating Σ(ℓ)\Sigma^{(\ell)}Σ(ℓ) on (x,y)(x,y)(x,y), define

Σ(ℓ+1)(x,y)=E[σ(U)σ(V)]+β2,Σ˙(ℓ+1)(x,y)=E[σ′(U)σ′(V)].\Sigma^{(\ell+1)}(x,y)=\mathbb E[\sigma(U)\sigma(V)]+\beta^2, \qquad \dot\Sigma^{(\ell+1)}(x,y)=\mathbb E[\sigma'(U)\sigma'(V)].Σ(ℓ+1)(x,y)=E[σ(U)σ(V)]+β2,Σ˙(ℓ+1)(x,y)=E[σ′(U)σ′(V)].

The deterministic limiting NTK is

Θ∞(1)=Σ(1),Θ∞(ℓ+1)(x,y)=Θ∞(ℓ)(x,y)Σ˙(ℓ+1)(x,y)+Σ(ℓ+1)(x,y).\Theta_\infty^{(1)}=\Sigma^{(1)},\qquad \Theta_\infty^{(\ell+1)}(x,y)=\Theta_\infty^{(\ell)}(x,y) \dot\Sigma^{(\ell+1)}(x,y)+\Sigma^{(\ell+1)}(x,y).Θ∞(1)​=Σ(1),Θ∞(ℓ+1)​(x,y)=Θ∞(ℓ)​(x,y)Σ˙(ℓ+1)(x,y)+Σ(ℓ+1)(x,y).

These recurrences appear in Section 4.1, Proposition 1 and Theorem 1, PDF p. 5; their displays are unnumbered.

Formalization targets

The goal is Theorem 1, on every fixed finite family X=(x1,…,xN)X=(x_1,\ldots,x_N)X=(x1​,…,xN​) of inputs and for every ε>0\varepsilon>0ε>0:

Pr⁡ ⁣(∃i,j,k,k′:∣Θkk′(L)(θ;xi,xj)−Θ∞(L)(xi,xj)δkk′∣>ε)⟶0.\Pr\!\left(\exists i,j,k,k': \left|\Theta^{(L)}_{kk'}(\theta;x_i,x_j) -\Theta_\infty^{(L)}(x_i,x_j)\delta_{kk'}\right|>\varepsilon\right) \longrightarrow0.Pr(∃i,j,k,k′:​Θkk′(L)​(θ;xi​,xj​)−Θ∞(L)​(xi​,xj​)δkk′​​>ε)⟶0.

Here δkk′\delta_{kk'}δkk′​ is one when the output coordinates coincide and zero otherwise. The limit takes n1→∞n_1\to\inftyn1​→∞ first, then n2→∞n_2\to\inftyn2​→∞, through nh→∞n_h\to\inftynh​→∞, precisely as specified in Appendix A, PDF p. 11, and Appendix A.1, PDF pp. 12–13.

Two supporting milestones expose the required mathematical content. First, the recursively defined Σ(L)\Sigma^{(L)}Σ(L) has positive semidefinite Gram matrices on every finite input family and satisfies Σ(L)(x,x)≥β2\Sigma^{(L)}(x,x)\ge\beta^2Σ(L)(x,x)≥β2. This is a paper-derived well-definedness obligation for the covariance in Proposition 1. Second, Proposition 1 asserts joint convergence in distribution of (fθ,k(xi))i,k(f_{\theta,k}(x_i))_{i,k}(fθ,k​(xi​))i,k​ to the centered Gaussian vector with covariance Σ(L)(xi,xj)δkk′\Sigma^{(L)}(x_i,x_j)\delta_{kk'}Σ(L)(xi​,xj​)δkk′​. This expresses the paper's independent output Gaussian processes through all their finite-dimensional distributions.

What completing the mission would establish

The result connects an explicitly parameterized random finite network to a deterministic kernel computed from its activation and depth. All output correlations, bias contributions, and layer normalizations remain visible in that connection. It would provide a checked foundation on which a separate training-stability development could build.

The formal contribution is the passage from finite random Jacobians to the limiting kernel. It does not assume that the empirical NTK already equals its limit. Nor does the goal claim convergence of a training trajectory, positive definiteness on a sphere, an early-stopping guarantee, or a generalization bound; those are separate results and questions in the source.

Where the mathematical work lies

The parameter space changes with the widths. Outputs, hidden activations, and their parameter derivatives are dependent random quantities, so the limit of their products requires more than a scalar law of large numbers. The weak Gaussian limit alone also does not justify substituting an arbitrary discontinuous derivative into expectations. The Lipschitz-only hypothesis is part of the target and must be retained, including for nonsmooth activations. Remark 3, PDF p. 5 identifies almost-everywhere differentiation as the relevant convention.

Formalization scope and conventions

Lean represents parameter coordinates by a finite dependent index carrying a layer, destination neuron, and optional source neuron; the missing source denotes a bias. Initialization is the finite product of Mathlib's standard Gaussian measures. Network outputs are obtained by the displayed recursion, and NTK entries use actual Fréchet derivatives in coordinate directions. Mathlib's derivative is zero where differentiation fails; the proof must establish that the exceptional parameters are null under the stated initialization law.

Centered Gaussian laws use Mathlib's multivariateGaussian, including singular covariance. The covariance-validity milestone must justify its covariance interpretation. No invertibility, distinct-input, smooth-activation, or positive-definite-kernel assumption is added. Positive actual hidden widths are indexed as wi+1w_i+1wi​+1 for wi∈Nw_i\in\mathbb Nwi​∈N, a cofinal reindexing. Depth one, constant activations, repeated or zero inputs, and empty finite families are included. The empty family is harmless because the same theorem quantifies over every nonempty family as well.

The sequential filter puts the last hidden width outermost. For two hidden widths, a probability tolerance is met by first choosing a threshold for n2n_2n2​, then a threshold for n1n_1n1​ that may depend on n2n_2n2​. There is no uniform limit over the entire input space and no simultaneous-width assertion. The development uses Lean 4.30.0 and supported Mathlib revision c5ea00351c28e24afc9f0f84379aa41082b1188f. The model and statements are locally checked; the three theorem proofs remain open. Contributions to Gaussian covariance consistency, finite-dimensional distribution limits, almost-everywhere network differentiation, and the NTK limit are in scope.

Selected references

  • Arthur Jacot, Franck Gabriel, and Clément Hongler, Neural Tangent Kernel: Convergence and Generalization in Neural Networks, Advances in Neural Information Processing Systems 31, 2018. arXiv:1806.07572v4. Primary anchors: Section 2, PDF pp. 2–3; Section 4.1, PDF p. 5, Proposition 1, Theorem 1, Remarks 2–3; Appendix A and A.1, PDF pp. 11–13. Relevant displays have no equation numbers.
4 thms1 active userReviewed
🏆Completed
Machine LearningOptimization·Captain: Minghui

Optimization Methods for Large-Scale Machine Learning: Stochastic Gradient ConvergenceResearch Paper

Why stochastic-gradient convergence matters

Training a machine-learning model often means choosing a vector of parameters to minimize an average loss. Evaluating the full gradient can require processing an entire dataset. A stochastic-gradient method instead updates the parameters using a random direction obtained from a smaller amount of information. Its computational appeal raises a mathematical question: which assumptions on those directions and the stepsizes guarantee progress, and what kind of convergence follows?

This mission formalizes the core convergence theory in Section 4 of Bottou, Curtis, and Nocedal, Optimization Methods for Large-Scale Machine Learning. The results distinguish strongly convex objectives, where expected objective error can be controlled, from general smooth objectives, where the guarantee concerns gradients. They also distinguish constant stepsizes, which leave a noise-dependent error bound, from diminishing stepsizes.

Historical timeline

  • 1951: Robbins and Monro introduced stochastic approximation for finding a root using noisy observations. Their work is the historical foundation for the stepsize conditions used here; the original root-finding theorem is not a separate target of this mission. Original paper.
  • 2016: Bottou, Curtis, and Nocedal released the first version of their survey, organizing stochastic-gradient theory around smoothness and moment assumptions. arXiv record.
  • 2018: The revised survey appeared in SIAM Review. This mission fixes arXiv version 3 for stable theorem numbering and PDF page citations. Published article.

The mathematics targeted here is already proved in the literature; the task is its Lean formalization, not a claim that these convergence results are unresolved research conjectures.

Objective, algorithm, and probability model

Let F:Rd→RF:\mathbb R^d\to\mathbb RF:Rd→R be differentiable with an LLL-Lipschitz gradient, where L>0L>0L>0. On a probability space (Ω,A,P)(\Omega,\mathcal A,\mathbb P)(Ω,A,P), let Hk\mathcal H_kHk​ contain the history before step kkk. Starting from a deterministic vector w0w_0w0​, the algorithm uses positive deterministic stepsizes αk\alpha_kαk​ and random directions gkg_kgk​ to update

wk+1=wk−αkgk.w_{k+1}=w_k-\alpha_k g_k.wk+1​=wk​−αk​gk​.

The state wkw_kwk​ is measurable with respect to Hk\mathcal H_kHk​; the direction gkg_kgk​ is measurable with respect to Hk+1\mathcal H_{k+1}Hk+1​ and has a finite second moment. Conditional assertions hold almost surely. This uses the adapted-process formulation expressly permitted in footnote 4, PDF p. 22, rather than requiring independent sample seeds. The local index k=0k=0k=0 corresponds to the paper's k=1k=1k=1. Algorithm 4.1 and footnote 4.

Write Ek\mathbb E_kEk​ for conditioning on Hk\mathcal H_kHk​. The moment conditions use constants μG≥μ>0\mu_G\ge\mu>0μG​≥μ>0 and M,MV≥0M,M_V\ge0M,MV​≥0:

⟨∇F(wk),Ekgk⟩≥μ∥∇F(wk)∥2,∥Ekgk∥≤μG∥∇F(wk)∥,\langle\nabla F(w_k),\mathbb E_k g_k\rangle\ge\mu\|\nabla F(w_k)\|^2, \qquad \|\mathbb E_k g_k\|\le\mu_G\|\nabla F(w_k)\|,⟨∇F(wk​),Ek​gk​⟩≥μ∥∇F(wk​)∥2,∥Ek​gk​∥≤μG​∥∇F(wk​)∥, Ek∥gk∥2−∥Ekgk∥2≤M+MV∥∇F(wk)∥2.\mathbb E_k\|g_k\|^2-\|\mathbb E_k g_k\|^2 \le M+M_V\|\nabla F(w_k)\|^2.Ek​∥gk​∥2−∥Ek​gk​∥2≤M+MV​∥∇F(wk​)∥2.

Define MG=MV+μG2M_G=M_V+\mu_G^2MG​=MV​+μG2​. The iterates lie almost surely in an open region on which F≥Finf⁡F\ge F_{\inf}F≥Finf​ for a real lower bound Finf⁡F_{\inf}Finf​. These are Assumptions 4.1 and 4.3, PDF pp. 23–24, equations (4.6)–(4.9). Source.

Formalization targets

The goal is Theorem 4.10, Section 4.3, PDF p. 33, equations (4.30a)–(4.30b). Suppose

∑k=0∞αk=∞,∑k=0∞αk2<∞.\sum_{k=0}^\infty\alpha_k=\infty,\qquad \sum_{k=0}^\infty\alpha_k^2<\infty.k=0∑∞​αk​=∞,k=0∑∞​αk2​<∞.

For AK=∑k=0K−1αkA_K=\sum_{k=0}^{K-1}\alpha_kAK​=∑k=0K−1​αk​, establish both

∃S∈R:E ⁣[∑k=0K−1αk∥∇F(wk)∥2]⟶S,\exists S\in\mathbb R:\quad \mathbb E\!\left[\sum_{k=0}^{K-1}\alpha_k\|\nabla F(w_k)\|^2\right]\longrightarrow S,∃S∈R:E[k=0∑K−1​αk​∥∇F(wk​)∥2]⟶S, 1AKE ⁣[∑k=0K−1αk∥∇F(wk)∥2]⟶0.\frac{1}{A_K}\mathbb E\!\left[\sum_{k=0}^{K-1}\alpha_k\|\nabla F(w_k)\|^2\right] \longrightarrow0.AK​1​E[k=0∑K−1​αk​∥∇F(wk​)∥2]⟶0.

There is no convexity assumption and no restriction that the initial stepsizes already satisfy a small-step bound. Theorem 4.10.

Four milestones capture the surrounding theory. Lemma 4.4 gives the two successive conditional expected-descent inequalities (4.10a)–(4.10b), PDF pp. 24–25. It is a common input to the convergence results. Theorem 4.6 gives a geometric upper bound for strongly convex objectives with a constant stepsize. Theorem 4.7 gives the corresponding O(1/k)O(1/k)O(1/k) bound for αk=β/(γ+k+1)\alpha_k=\beta/(\gamma+k+1)αk​=β/(γ+k+1). These are parallel strongly convex targets, not prerequisites for the nonconvex goal. Theorem 4.8 gives finite-horizon sum and average squared-gradient bounds for general objectives with a constant stepsize. Section 4.

For example, if c>0c>0c>0 is the strong-convexity constant, d≥1d\ge1d≥1, and 0<a≤μ/(LMG)0<a\le\mu/(LM_G)0<a≤μ/(LMG​), Theorem 4.6 states, with B=aLM/(2cμ)B=aLM/(2c\mu)B=aLM/(2cμ) and F∗=inf⁡xF(x)F_*=\inf_xF(x)F∗​=infx​F(x),

E[F(wk)−F∗]≤B+(1−acμ)k(F(w0)−F∗−B).\mathbb E[F(w_k)-F_*]\le B+(1-ac\mu)^k(F(w_0)-F_*-B).E[F(wk​)−F∗​]≤B+(1−acμ)k(F(w0​)−F∗​−B).

The upper bound tends to BBB; this does not assert that the actual expected error tends to BBB. Every milestone retains the paper's constants and all displayed conclusions. Equations (4.13)–(4.14), PDF p. 26.

What a completed formalization provides

The result explains precisely how noise and stepsize interact. The general-objective goal guarantees that the stepsize-weighted expected squared gradients average to zero even when M>0M>0M>0. The strongly convex milestones quantify objective error and the effect of initialization. These results concern the stated quantities; they do not assert convergence of iterates, global optimality for a nonconvex objective, or almost-sure convergence. Sections 4.2–4.3.

A completed development would provide reusable Lean results for smooth objective functions, conditional moment bounds, stochastic updates, and expected convergence. The proposed statements are open proof obligations. Compilation establishes that the definitions and statements are well formed, not that their convergence claims have already been proved.

Mathematical and formal difficulties

Finite conditional expectations must be connected to unconditional integrals without relying on total-function defaults. The infinite-horizon result also requires careful handling of a finite initial segment: square summability gives eventually small steps, not a bound at every step. Strong convexity must justify the objective-gap estimates and the properties of the optimum. Treating a descent recurrence as a hypothesis would omit the analytic content that this mission is intended to formalize.

Formalization scope

The model uses real finite-dimensional Euclidean space, Mathlib gradients, filtrations, Bochner conditional expectations, and ordinary real integrals. The probability space is arbitrary; no finite-support or standard-Borel restriction is imposed. Directions have explicit finite second moments, making the finite-expectation convention in the paper visible. Square integrability of iterates and integrability of losses are consequences to establish, not extra model fields.

Strong convexity uses Mathlib's StrongConvexOn, equivalent here to Assumption 4.5's first-order inequality. The optimum is defined as the infimum of the range of FFF, with its finiteness to be derived in the strongly convex branch. That branch requires d≥1d\ge1d≥1: the paper's deduction c≤Lc\le Lc≤L implicitly uses a nontrivial space. The nonconvex statements allow d=0d=0d=0. Zero noise is allowed. Finite-horizon averages require K>0K>0K>0; the value assigned at K=0K=0K=0 does not affect an asymptotic limit.

Contributions to the conditional-descent infrastructure and any of the four milestones are welcome. Variance reduction, Newton-type methods, and the remainder of the survey are outside this initial mission.

Selected references

  • Léon Bottou, Frank E. Curtis, and Jorge Nocedal. Optimization Methods for Large-Scale Machine Learning. SIAM Review 60(2), 223–311, 2018. arXiv:1606.04838v3; DOI. All page numbers above refer to the 95-page arXiv v3 PDF.
  • Herbert Robbins and Sutton Monro. A Stochastic Approximation Method. Annals of Mathematical Statistics 22(3), 400–407, 1951. DOI. Historical background only.
6 thms1 active userReviewed
🏆Completed
Numerical Analysis·Captain: shivm

Randomized Kaczmarz: Exponential Convergence in ExpectationResearch Paper

Problem

Solve a consistent system Ax=bAx=bAx=b, with A∈Cm×nA\in\mathbb{C}^{m\times n}A∈Cm×n of full rank and m≥n≥1m\ge n\ge 1m≥n≥1. Kaczmarz's method (1937) projects the current iterate onto the solution hyperplane of one equation at a time. The cyclic version converges, but its rate depends on the order of the rows and has no clean bound in terms of a condition number.

Strohmer and Vershynin (2009) pick row iii at random with probability ∥ai∥22/∥A∥F2\|a_i\|_2^2/\|A\|_F^2∥ai​∥22​/∥A∥F2​ and prove

E ∥xk−x∥22≤(1−κ(A)−2)k ∥x0−x∥22,κ(A)=∥A∥Fσmin⁡(A).\mathbb{E}\,\|x_k-x\|_2^2 \le \bigl(1-\kappa(A)^{-2}\bigr)^k\,\|x_0-x\|_2^2,\qquad \kappa(A)=\frac{\|A\|_F}{\sigma_{\min}(A)}.E∥xk​−x∥22​≤(1−κ(A)−2)k∥x0​−x∥22​,κ(A)=σmin​(A)∥A∥F​​.

The rate does not depend on the number of equations mmm.

Setting

  • Rows. ai∈Cna_i\in\mathbb{C}^nai​∈Cn is the conjugate of row iii, so equation iii reads ⟨ai,x⟩=bi\langle a_i,x\rangle=b_i⟨ai​,x⟩=bi​.
  • Condition number. σmin⁡(A)=inf⁡∥z∥2=1∥Az∥2\sigma_{\min}(A)=\inf_{\|z\|_2=1}\|Az\|_2σmin​(A)=inf∥z∥2​=1​∥Az∥2​ and κ(A)=∥A∥F/σmin⁡(A)\kappa(A)=\|A\|_F/\sigma_{\min}(A)κ(A)=∥A∥F​/σmin​(A) (Demmel). It satisfies n≤κ(A)≤n ∥A∥2/σmin⁡(A)\sqrt n\le\kappa(A)\le\sqrt n\,\|A\|_2/\sigma_{\min}(A)n​≤κ(A)≤n​∥A∥2​/σmin​(A).
  • Algorithm 1. From any x0x_0x0​, draw row rrr independently with probability pr=∥ar∥22/∥A∥F2p_r=\|a_r\|_2^2/\|A\|_F^2pr​=∥ar​∥22​/∥A∥F2​ and set
xk+1=xk+br−⟨ar,xk⟩∥ar∥22 ar.x_{k+1}=x_k+\frac{b_r-\langle a_r,x_k\rangle}{\|a_r\|_2^2}\,a_r .xk+1​=xk​+∥ar​∥22​br​−⟨ar​,xk​⟩​ar​.
  • Expectation. E∥xk−x∥22\mathbb{E}\|x_k-x\|_2^2E∥xk​−x∥22​ is a finite sum over the mkm^kmk possible row sequences.

Targets

  • Theorem 2 (goal): the bound above, for every x0x_0x0​ and kkk.
  • Theorem 3: some x0≠xx_0\ne xx0​=x has E∥xk−x∥22≥(1−2k/κ(A)2)∥x0−x∥22\mathbb{E}\|x_k-x\|_2^2\ge(1-2k/\kappa(A)^2)\|x_0-x\|_2^2E∥xk​−x∥22​≥(1−2k/κ(A)2)∥x0​−x∥22​ for all k≥1k\ge1k≥1, so κ(A)−2\kappa(A)^{-2}κ(A)−2 is sharp up to a constant. Caveat: the source's proof only reaches the unsquared bound E∥xk−x∥2≥…\mathbb{E}\|x_k-x\|_2\ge\dotsE∥xk​−x∥2​≥… and then cites Jensen, which goes the wrong way. Its estimates give the squared bound with 444 in place of 222. Both forms are milestones.
  • Sharpness (§3.2): Theorem 2 is an equality when κ(A)=n\kappa(A)=\sqrt nκ(A)=n​.
  • Iteration count (§2.1): k≥2log⁡ε/log⁡(1−κ(A)−2)k\ge 2\log\varepsilon/\log(1-\kappa(A)^{-2})k≥2logε/log(1−κ(A)−2) steps give E∥xk−x∥22≤ε2∥x0−x∥22\mathbb{E}\|x_k-x\|_2^2\le\varepsilon^2\|x_0-x\|_2^2E∥xk​−x∥22​≤ε2∥x0​−x∥22​.

Proof idea

A single projection can barely reduce the error, when the error is almost orthogonal to the chosen row. On average it always does. If Z=aj/∥aj∥2Z=a_j/\|a_j\|_2Z=aj​/∥aj​∥2​ is drawn with probability pjp_jpj​, then

E ∣⟨z,Z⟩∣2=∥Az∥22∥A∥F2≥κ(A)−2∥z∥22.\mathbb{E}\,|\langle z,Z\rangle|^2=\frac{\|Az\|_2^2}{\|A\|_F^2}\ge\kappa(A)^{-2}\|z\|_2^2 .E∣⟨z,Z⟩∣2=∥A∥F2​∥Az∥22​​≥κ(A)−2∥z∥22​.

Pythagoras for one projection then gives E∥xk+1−x∥22≤(1−κ(A)−2) ∥xk−x∥22\mathbb{E}\|x_{k+1}-x\|_2^2\le(1-\kappa(A)^{-2})\,\|x_k-x\|_2^2E∥xk+1​−x∥22​≤(1−κ(A)−2)∥xk​−x∥22​; induct on kkk.

Formalization

  • Vectors live in EuclideanSpace ℂ (Fin n) and matrices in Matrix (Fin m) (Fin n) ℂ. Mathlib's inner product is conjugate-linear in its first argument, which is why aia_iai​ is a conjugated row.
  • Full rank is stated as injectivity of z↦Azz\mapsto Azz↦Az.
  • The expectation expErrSq is an explicit finite sum, so no measure theory is needed. The tower identity is a milestone.
  • A zero row makes the step the identity (Lean's division by zero) and has probability 000, so it is harmless.
  • Mathlib has no Kaczmarz iteration, scaled condition number or σmin⁡\sigma_{\min}σmin​ lower bound; the mission builds them.

History

  • 1937: Kaczmarz introduces the cyclic method and proves convergence, with no rate.
  • 1970: Gordon, Bender and Herman rediscover it as ART for tomography.
  • 2009: Strohmer and Vershynin give the first rate in terms of a condition number.
  • 2010 onward: extensions to noisy systems, block methods, SGD and sketch-and-project (Needell; Needell–Tropp; Needell–Srebro–Ward; Gower–Richtárik).

References

  • S. Kaczmarz, Angenäherte Auflösung von Systemen linearer Gleichungen, Bull. Int. Acad. Polon. Sci. Lett. A 35 (1937), 355–357.
  • T. Strohmer and R. Vershynin, A randomized Kaczmarz algorithm with exponential convergence, J. Fourier Anal. Appl. 15 (2009), 262–278. arXiv:math/0702226
  • J. Demmel, The probability that a numerical analysis problem is difficult, Math. Comp. 50 (1988), 449–480. DOI
  • D. Needell, Randomized Kaczmarz solver for noisy linear systems, BIT Numer. Math. 50 (2010), 395–403. arXiv:0902.0958
  • D. Needell, N. Srebro and R. Ward, Stochastic gradient descent, weighted sampling, and the randomized Kaczmarz algorithm, Math. Program. 155 (2016), 549–573. arXiv:1310.5715
  • R. M. Gower and P. Richtárik, Randomized iterative methods for linear systems, SIAM J. Matrix Anal. Appl. 36 (2015), 1660–1690. arXiv:1506.03296
12 thms1 active userReviewed
🏆Completed
Active InferenceBehaviorDynamical Systems+4·Captain: ActiveInference

Free Energy Principle I: the variational free-energy boundResearch Paper

Motivation

The free energy principle (FEP) proposes that a self-organizing system — a brain, an organism, an agent — persists by minimizing one quantity: the variational free energy of its sensory states under an internal generative model. Introduced by Karl Friston as a principle of brain function [Friston 2006] and stated in its unified form [Friston 2010], the principle makes a precise mathematical claim at its core: whatever internal state estimate the system holds, the free energy of incoming data is never below the data's surprisal (negative log marginal likelihood), and the excess is exactly the Kullback–Leibler divergence between the system's recognition density and the Bayesian posterior implied by the model. Active inference extends the same functional from perception to action and planning [Friston et al. 2017], and the same bound is known in machine learning as the evidence lower bound (ELBO) of variational inference [Parr et al. 2022].

Timeline of the mathematical content this mission formalizes:

  • 2006 — Friston, A free energy principle for the brain (J. Physiol. Paris 100): the bound stated for perception as variational inference on a generative model.
  • 2010 — Friston, The free-energy principle: a unified brain theory? (Nat. Rev. Neurosci. 11, 127–138): free energy as an upper bound on surprisal, presented as the core of a unified account.
  • 2017 — Friston, FitzGerald, Rigoli, Schwartenbeck, Pezzulo, Active inference: a process theory (Neural Comput. 29(1), 1–49): the same functional drives policy selection through expected free energy.
  • 2022 — Parr, Pezzulo, Friston, Active Inference (MIT Press): textbook treatment; the posterior-form identity F=DKL(Q ∥ P(s∣o))−log⁡P(o)F = D_{\mathrm{KL}}(Q\,\|\,P(s|o)) - \log P(o)F=DKL​(Q∥P(s∣o))−logP(o) as the central equation.
  • 2026 — fep_formal (Active Inference Institute): a machine-checked Lean 4 catalogue of 155 Free Energy Principle topics, compiled with zero proof holes against a pinned Mathlib. This mission transcribes the catalogue's core-free-energy chain — topic fep-002 and the foundation module active_inference — onto the platform, turning the first link of the FEP development into solvable community infrastructure.

Setting

Everything is finite, and laws are normalized real mass functions.

A finite law on a finite type α\alphaα is a function p:α→Rp : \alpha \to \mathbb{R}p:α→R with p(x)≥0p(x) \ge 0p(x)≥0 for every xxx and ∑xp(x)=1\sum_x p(x) = 1∑x​p(x)=1. A finite kernel from α\alphaα to β\betaβ assigns to each x∈αx \in \alphax∈α a normalized row over β\betaβ. The mission's definitions Def_fep_finite_laws and Def_fep_finite_information package these carriers with entropy, cross-entropy, and the KL divergence

DKL(p ∥ q)  =  ∑xq(x)⋅klFun ⁣(p(x)q(x)),klFun(x)=xlog⁡x+1−x,D_{\mathrm{KL}}(p\,\|\,q) \;=\; \sum_{x} q(x)\cdot \mathrm{klFun}\!\left(\frac{p(x)}{q(x)}\right), \qquad \mathrm{klFun}(x) = x\log x + 1 - x,DKL​(p∥q)=x∑​q(x)⋅klFun(q(x)p(x)​),klFun(x)=xlogx+1−x,

a totalized real-valued divergence that is finite even at zero-mass atoms (the convention 0⋅log⁡0=00 \cdot \log 0 = 00⋅log0=0 via Real.negMulLog) and nonnegative on normalized laws.

A finite generative model for active inference (definition Def_fep_generative_model) over finite types Policy,State,Outcome\mathsf{Policy}, \mathsf{State}, \mathsf{Outcome}Policy,State,Outcome consists of: an initial state law P(s)P(s)P(s); a policy-conditioned transition kernel; a state-to-outcome likelihood kernel; a preference law over outcomes; and a policy prior. Under a policy π\piπ the model predicts the state law P(s∣π)P(s \mid \pi)P(s∣π) and the outcome law P(o∣π)P(o \mid \pi)P(o∣π). A recognition density is any finite law QQQ over states — the system's internal estimate. At an outcome ooo with positive predicted mass, the Bayesian posterior P(⋅∣o,π)P(\cdot \mid o, \pi)P(⋅∣o,π) is the exact finite Bayes rule. The outcome surprisal is −log⁡P(o∣π)-\log P(o \mid \pi)−logP(o∣π), and the posterior-form variational free energy of a recognition density QQQ is

F[Q,o,π]  =  DKL(Q ∥ P(⋅∣o,π))  −  log⁡P(o∣π).F[Q, o, \pi] \;=\; D_{\mathrm{KL}}\big(Q \,\|\, P(\cdot \mid o, \pi)\big) \;-\; \log P(o \mid \pi).F[Q,o,π]=DKL​(Q∥P(⋅∣o,π))−logP(o∣π).

Formalization targets

Goal: the variational free-energy bound

For every generative model, every policy π\piπ, every outcome ooo with P(o∣π)>0P(o\mid\pi) > 0P(o∣π)>0, and every recognition density QQQ:

−log⁡P(o∣π)  ≤  F[Q,o,π].-\log P(o \mid \pi) \;\le\; F[Q, o, \pi].−logP(o∣π)≤F[Q,o,π].

The recognition density QQQ is universally quantified — the bound holds for whatever state estimate the system happens to carry.

Exactness, uniqueness, and the ELBO form

Three companions pin down the equality case, ordered weakest to strongest alongside the milestone list:

  • Exactness — the Bayesian posterior attains the bound:
F[P(⋅∣o,π), o, π]=−log⁡P(o∣π).F\big[P(\cdot \mid o, \pi),\, o,\, \pi\big] = -\log P(o \mid \pi).F[P(⋅∣o,π),o,π]=−logP(o∣π).
  • Uniqueness — equality characterizes the posterior, with no full-support assumption:
F[Q,o,π]=−log⁡P(o∣π)  ⟺  Q=P(⋅∣o,π).F[Q, o, \pi] = -\log P(o \mid \pi) \iff Q = P(\cdot \mid o, \pi).F[Q,o,π]=−logP(o∣π)⟺Q=P(⋅∣o,π).
  • ELBO form — negating both sides:
−F[Q,o,π]  ≤  log⁡P(o∣π).-F[Q, o, \pi] \;\le\; \log P(o \mid \pi).−F[Q,o,π]≤logP(o∣π).

Measure-theoretic core

Independently of the finite model, in Mathlib's nonnegative extended reals R≥0∪{∞}\mathbb{R}_{\ge0} \cup \{\infty\}R≥0​∪{∞}, with qqq, ppp measures on any measurable space and s∈R≥0∪{∞}s \in \mathbb{R}_{\ge0} \cup \{\infty\}s∈R≥0​∪{∞}:

s  ≤  s+DKL(q ∥ p),s \;\le\; s + D_{\mathrm{KL}}(q \,\|\, p),s≤s+DKL​(q∥p),

the unconditional shape of the bound (topic fep-002 of the source catalogue), with the divergence taken as ∞\infty∞ when the log-likelihood ratio is not integrable.

Significance

The result itself. This inequality is the load-bearing step of the FEP: it converts "minimize free energy" into "move recognition toward the posterior," and it is the exact statement whose continuous, dynamic, and policy-selecting extensions (expected free energy, Markov blankets, non-equilibrium thermodynamics) form the rest of the FEP literature. Without it, the principle's variational step has no mathematical content.

Formalizing it. The mathematics here is classical — Gibbs' inequality — and the source development already proves every row with no proof holes. What the mission adds is faithful, reusable infrastructure: the definitions are published as platform nodes in the shared namespace FreeEnergyPrinciple, so later missions in this programme (expected free energy and policy selection, Markov blankets, Gaussian and continuous-time variants, already proved in the source repository) can import them instead of re-deriving the substrate. Status honesty: all eight items below are formalized and machine-checked locally against the platform environment; each is an open problem on the platform only in the sense that no proof has yet been submitted to it.

Difficulty

The bound itself is a one-line consequence of KL nonnegativity — the naive idea "prove it by simp on the KL sum" is essentially right, and the source proofs are correspondingly short. The actual difficulty is boundary precision, where plausible renderings go silently wrong:

  • The positivity premise P(o∣π)>0P(o \mid \pi) > 0P(o∣π)>0 is not decoration: the Bayesian posterior is defined only where the evidence has positive mass, and hiding that in a totalized division would change the statement.
  • The uniqueness characterization is not a formality: at zero-mass reference atoms the logarithmic cross-entropy identity degenerates, and the proof needs the normalization lemma DKL(p ∥ q)=0↔p=qD_{\mathrm{KL}}(p\,\|\,q) = 0 \leftrightarrow p = qDKL​(p∥q)=0↔p=q, which forces the recognition law's mass to zero wherever the posterior's is zero. A solver who proves the bound but states equality with a full-support hypothesis has proved something different from the source.
  • The measure-theoretic core is deliberately unconditional; adding finiteness side conditions to it would weaken the source's point that R≥0∪{∞}\mathbb{R}_{\ge0} \cup \{\infty\}R≥0​∪{∞} absorbs the degenerate cases.

A vacuous formalization — quantifying over a single distinguished recognition law, or taking "posterior" as an arbitrary variable — would trivialize the goal; the targets below rule this out by fixing the exact finite Bayes rule and universally quantifying QQQ.

Formalization scope

Committed conventions of this mission's Lean development:

  • All model carriers are finite types (Fintype); laws are R\mathbb{R}R-valued normalized mass functions; kernels are normalized rows. No measure-theoretic machinery below the finite substrate except for the measure-theoretic core milestone.
  • KL is the totalized real-valued finite divergence DKL(p ∥ q)=∑xq(x)⋅klFun(p(x)/q(x))D_{\mathrm{KL}}(p\,\|\,q) = \sum_x q(x)\cdot \mathrm{klFun}(p(x)/q(x))DKL​(p∥q)=∑x​q(x)⋅klFun(p(x)/q(x)); entropy uses Real.negMulLog, so 0⋅log⁡0=00 \cdot \log 0 = 00⋅log0=0 exactly, not by exception-handling.
  • The posterior is the exact finite Bayes rule FiniteKernel.posterior, taken at the explicit hypothesis 0<P(o∣π)0 < P(o \mid \pi)0<P(o∣π).
  • One mission-wide namespace FreeEnergyPrinciple; definitions live in the published definition files Def_fep_finite_laws, Def_fep_finite_information, Def_fep_generative_model, and every theorem item imports them. A Free Energy Principle II mission (expected free energy) is expected to reuse the same namespace and definitions.
  • The measure-theoretic core uses Mathlib's InformationTheory.klDiv in ℝ≥0∞ with no finiteness hypotheses.
  • Contributions welcome: alternative measure-theoretic renderings of the core bound, the Gaussian instantiation of the same identity, and ports of the source repository's subsequent rows (Bayesian model reduction, expected free energy) onto these definitions.

Selected references

  • K. Friston, A free energy principle for the brain, Journal of Physiology (Paris) 100 (2006) 70–87. https://doi.org/10.1016/j.jphysparis.2006.10.001
  • K. Friston, The free-energy principle: a unified brain theory?, Nature Reviews Neuroscience 11 (2010) 127–138. https://doi.org/10.1038/nrn2787
  • K. Friston, T. FitzGerald, F. Rigoli, P. Schwartenbeck, G. Pezzulo, Active inference: a process theory, Neural Computation 29 (2017) 1–49. https://doi.org/10.1162/neco_a_00912
  • T. Parr, G. Pezzulo, K. J. Friston, Active Inference: The Free Energy Principle in Mind, Brain, and Behavior, MIT Press (2022). https://mitpress.mit.edu/9780262045354/active-inference/
  • D. A. Friedman, fep_formal: Towards Lean 4 Formalization of the Free Energy Principle (v1.2.0), Active Inference Institute (2026), the formal source of truth for this mission. https://github.com/ActiveInferenceInstitute/fep_formal
  • D. A. Friedman, Towards Lean 4 Formalization of the Free Energy Principle: AI-Driven Theorem Sketching and Verification for Active Inference and Bayesian Mechanics, Active Inference Journal (2026). https://doi.org/10.5281/zenodo.19699233
8 thms1 active userReviewed
PreviousPage 28 of 29Next

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me