Alphabeta Math
AlgorithmAlgorithm: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Positive Lamperti drift-implicit scheme for the CIR process

Definition

Assume AC and the Brownian conventions of Locally Lipschitz Itô SDE on an open state domain on [0,T] with U=(0,∞). The input consists of κ,θ,σ>0 satisfying the Feller condition 2κθ≥σ2, a step h>0, a current transformed value zn≥0, and a finite Brownian increment ΔWn. Set a=4κθ−σ28,A=1+κh2,c=zn+σ2ΔWn. For valid parameters, a>0 and A>0. Compute zn+1=c+c2+4Aah2A,xn+1=zn+12. This is the positive-root solution of Azn+12−czn+1−ah=0, which is the drift-implicit Euler equation for the Lamperti variable Z=X in the CIR model dXt=κ(θ−Xt)dt+σXt dWt.

Return invalid-input for parameters outside the stated domain or a non-finite input. Otherwise return success with (zn+1,xn+1). In exact real arithmetic the discriminant is strictly positive and the displayed root is finite and positive for every zn≥0 and ΔWn∈R; the algorithm has no rejected root branch. A floating-point implementation that cannot verify a finite positive root returns solve-failure and does not advance the state. This is a specific implicit square-root update, not the ordinary Euler–Maruyama update for X.

Depends on

Used by

Dependency tree · two levels

7 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources