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.
Milstein stochastic taylor and iterated integrals — Examples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Areas of Elementary Plane Figures
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Variation and the Riemann–Stieltjes Integral
- Brownian Motion Construction and Continuity
- Brownian Motion, Markov Properties and Hitting Times
- Brownian Path Properties
- Central Limit Theorems
- Characteristic Functions Inversion and Continuity
- Compactness
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Lp Spaces and Test-Function Conventions
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Congruences, the Integers Modulo n and the Chinese Remainder Theorem
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Density Separability and Convolution in Lᵖ
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Discrete Time Martingales
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Eigenvalues, Eigenvectors and the Characteristic Polynomial
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Finite Probability and the Probabilistic Method
- Foundations of the Real Numbers for Analysis
- Fourier Transform Convolution and Approximate Identities
- Fubini and Change of Variables
- Function Space Topologies and the Exponential Law
- Fundamental Trigonometric Identities
- Gaussian Elimination, Elementary Matrices and Reduced Row Echelon Form
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Hausdorff via the Diagonal
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Improper and Parameter-Dependent Multiple Integrals
- Improper Integrals
- Independence Borel Cantelli and Zero One Laws
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Itos Formula and Brownian Martingales
- Lebesgue Measure on Euclidean Space
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Martingale Inequalities and Convergence
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Milstein stochastic taylor and iterated integrals
- Mixed Partials, Taylor Formulae, and Extrema
- Modes of Convergence Egorov and Lusin
- Modes of Convergence for Random Variables
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Order, Zorn's Lemma, and the Axiom of Choice
- Outer Measure and the Caratheodory Extension Theorem
- Partitions of Unity and Paracompactness
- Pointwise Extended-Real Function Products
- Polynomial Rings, the Division Algorithm and Roots
- Power Series and Real-Analytic Functions
- Primes, Euclid's Lemma and the Fundamental Theorem of Arithmetic
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Radon Measures and the Riesz Markov Kakutani Theorem
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Sine, Cosine, and the Definition of Pi
- Splitting Fields
- Subspaces, Products, and Quotients
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Determinant of a Linear Operator, Cofactors and Cramer's Rule
- The Exponential Function
- The Fundamental Theorem of Algebra
- The Fundamental Theorem of Finite Abelian Groups
- The Galois Correspondence
- The Inverse and Implicit Function Theorems
- The Ito Integral with Respect to Brownian Motion
- The Lebesgue and Riemann Integrals Compared
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Maximal Function and Lebesgue Differentiation
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral in Rᵐ and Jordan Content
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- The Topology of Euclidean Space
- The Total Derivative in ℝᵐ → ℝⁿ
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Urysohn's Lemma and the Tietze Extension Theorem
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Summary
These examples verify the Milstein update for geometric Brownian motion and a bounded scalar multiplicative-noise coefficient. A two-noise system shows that a noncommuting Milstein term contains Brownian area not determined by endpoint increments, so its sampling cost and approximation error require separate treatment.
3 · Logical flowchart
4 · Definitions, theorems and proofs
None yet.
5 · Examples, counterexamples and false statements
Geometric Brownian motion and the Milstein update
Example
For , consider the geometric Brownian SDE A solution is . On a grid step of length , the scalar Milstein update is This example verifies the exact-solution form and the update algebra; it makes no global rate claim under the bounded-coefficient hypotheses of the strong-order theorem.
Facts & Assumptions
Given: AC; a filtered probability space whose filtration satisfies the usual conditions; and a standard Brownian motion adapted to that filtration such that is independent of and has law for every (for example, the usual augmentation of the natural filtration of ), as required by Continuous Brownian Ito processes; real constants ; and a finite interval.
Milstein updates, iterated Brownian integrals, and commutative noise: the scalar update is .
Multidimensional Ito formula for Brownian-driven processes: for a smooth function of a Brownian It^o process, the drift includes one half of the Hessian applied to the instantaneous covariance.
The Axiom of Choice: AC is inherited from the Brownian and It^o interface [F2].
Verification
Given: The assumptions above.
Define . Its derivatives are , , and . It^o's formula [F2] therefore gives , with . Thus the displayed process solves the SDE, including .
For and , and . Substituting these coefficients into [F1] and factoring gives the displayed Milstein update. If , its correction vanishes and it reduces to the deterministic Euler step.
A bounded scalar multiplicative-noise Milstein step
Example
Consider the bounded scalar multiplicative-noise SDE with , and initialize the numerical method with . Fix and an integer with , and use the uniform grid for . At the state , its first Milstein step is Unlike additive noise, the diffusion derivative contributes a nonzero centered correction. The hypotheses of the strong-order theorem apply to this coefficient field.
Facts & Assumptions
Given: AC; a filtered probability space whose filtration satisfies the usual conditions; and a standard Brownian motion adapted to that filtration such that is independent of and has law for every (for example, the usual augmentation of the natural filtration of ), as required by Continuous Brownian Ito processes; the SDE initial value and matching numerical initial value ; and a fixed horizon with an integer , the uniform grid for , and .
Milstein updates, iterated Brownian integrals, and commutative noise: for scalar noise, the increment contains .
Standard normal and normal laws: if , then its first, second, third and fourth moments are .
Strong order one for scalar and commutative-noise Milstein schemes: for coefficients in under the stated Brownian hypotheses, the grid root-mean-square error is .
The Axiom of Choice: AC is inherited through the Brownian/strong-Milstein interface [L1].
Verification
Given: The assumptions above.
Here , , and . At , both and equal , so [F1] gives the stated update with correction coefficient . The function and its derivatives through order three are bounded and continuous, so it meets the regularity premise of [L1].
By [F2], the correction has conditional mean and variance . Its covariance with the linear noise term is . Hence the one-step increment variance is , and the derivative correction is a separate nonzero fluctuation.
Applying [L1] to the SDE with and yields , with independent of , on the supplied uniform grid. Taking square roots yields grid root-mean-square error on every fixed finite horizon. This is the theorem's bounded-coefficient multiplicative-noise case under the inherited AC convention [A1]; it supplies no weak-order-two statement for Heun.
A noncommuting two-noise equation requires an area term
Example
Let be independent standard Brownian coordinates and solve from the two-dimensional SDE Its diffusion fields are and . They are noncommuting: while . On the first step, the exact second coordinate and its Milstein Taylor increment are . Although , the individual area term is not determined by the two endpoint increments.
Facts & Assumptions
Given: AC; a filtered probability space whose filtration satisfies the usual conditions; and a standard two-dimensional Brownian motion adapted to that filtration such that is independent of and has its standard two-dimensional normal law with covariance for every (for example, the usual augmentation of the joint natural filtration of ), as required by Continuous Brownian Ito processes; a step length ; and the It^o integrals in the Definition.
Continuous Brownian Ito processes: Brownian coordinates are independent and increments after time zero are normal with their stated variances.
Standard normal and normal laws: Brownian increments have Gaussian densities, and independent coordinates have product law.
Conditional expectation given a sigma algebra: conditional expectation is characterized by integrals on events in the conditioning sigma algebra.
Basic algebra and order properties of conditional expectation: conditional expectation is linear, preserves expectation, and is -contractive.
Cauchy-Schwarz for random variables: for square-integrable .
Conditional expectation is the l2 orthogonal projection: for and , for every , in particular .
The Axiom of Choice: AC is inherited through [F1], [F3], and the conditional-expectation interface [F6].
Verification
Given: The assumptions above.
The Jacobian of sends to , so ; the Jacobian of the constant field is zero, so . Thus commutativity fails. Starting from , the first coordinate is and the second is . The general Milstein Taylor update [F2] therefore has second-coordinate increment on the first step.
By [L1], the endpoints determine , where and . Let be deterministic partitions with mesh , and put . The It^o isometry [F3] gives .
For , write and ; their joint density is , where is the density. Dividing by the marginal density and completing the square gives . At and the same formula follows from and , respectively. For , the pair and has density when ; completing the square gives , and if then gives the same result. Independence of the two Brownian coordinate processes [F1] makes the joint density of the product of these two pair densities. Dividing by shows that the conditional density of given factors, so . Therefore because the sum is a left Riemann sum for . By [F7], step 1.2 implies in ; conditional expectation is -contractive by [F6], so [F5] gives .
The isometry [F3] gives . Also are independent with second moments , so step 2.1 gives and . By [F8], ; expanding the square therefore gives . If were a measurable function of , the conditional-expectation identity [F5] would give almost surely, contradicting this positive residual. Thus the endpoint increments do not determine the required area sample, and any approximation has a separate error and cost.
Sources
- Desmond J. Higham, An Algorithmic Introduction to Numerical Simulation of Stochastic Differential Equations, SIAM Review 43 (2001), Sections 4 and 6
- Kloeden and Platen, Numerical Solution of Stochastic Differential Equations, Section 10.3, printed pp. 345-351
- Desmond J. Higham, An Algorithmic Introduction to Numerical Simulation of Stochastic Differential Equations, SIAM Review 43 (2001), Section 6
- Kloeden and Platen, Numerical Solution of Stochastic Differential Equations, Example 10.3.4, printed pp. 349-350