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.
Computational foundations: factorization, KL, and optimization
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Algebraic Closure, Embeddings, and Separability
- Algebraic Extensions, Extension Degree, and Finite Fields
- Binary Operations, Monoids, Groups and Subgroups
- Compactness in Metric Spaces
- Completeness, Completion, and Uniform Continuity
- Composition Series, the Jordan–Hölder Theorem and Solvable Groups
- Conditional Distributions and Regular Conditional Probability
- 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
- Cyclic Groups and Direct Products
- Darboux, L'Hôpital, and Taylor's Theorem
- Determinants of Matrices over a Commutative Ring
- Diagonalisation and the Minimal Polynomial
- Direct Matrix Factorisations: LU, Cholesky and QR
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Divisibility, Greatest Common Divisors and Bézout's Identity
- Domination and Likelihood Ratios
- 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
- Foundations of the Real Numbers for Analysis
- Group Actions, Orbits, Stabilisers and Cayley's Theorem
- Group Homomorphisms and the Isomorphism Theorems
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Matrix Differentiation and First-order Spectral Perturbation
- Matrix Norms, Condition Numbers and Numerical Stability
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Minimax Lower Bounds
- Mixed Partials, Taylor Formulae, and Extrema
- 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
- 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
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- 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
- Splitting Fields
- Statistical Experiments, Models and Identifiability
- Suprema and Infima
- Sylow's Theorems, p-Groups and Nilpotent Groups
- Symmetric Groups, Cycle Decomposition and the Sign Homomorphism
- 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 Fundamental Theorems of Calculus
- The Galois Correspondence
- The Integral Logarithm and the Equivalence of Its Characterisations
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral: Definition and Integrability
- The Spectral Theorem, Positive Operators and Singular Value Decomposition
- 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
- Vector Spaces, Linear Subspaces, Span and Direct Sums
2 · Summary
This page develops a supplied jointly measurable latent-variable density and its observed marginal, with pointwise conditional latent densities only on positive finite fibres. Separate pointwise likelihood sections do not provide that joint version; the given joint function requires no choice axiom. Tonelli proves the nonnegative marginal identity; Fubini exchanges signed log terms only under absolute integrability. It fixes the direction and AC convention for KL, proves nonnegativity and equality of laws, and derives the normalized-density variational identity. It defines gradient descent and damped Newton, proves the fixed-step strongly convex rate and the local Newton quadratic rate, and makes no global-minimization claim for nonconvex objectives. The least-squares example uses the published gradient/Hessian formula.
3 · Logical flowchart
4 · Definitions, theorems and proofs
Latent-variable joint and observed-data factorization
Definition
Let , , and be measurable spaces (sets equipped with sigma-algebras; Measurable spaces and measurable sets). Let and be sigma-finite reference measures on the observation and latent spaces; each has a countable measurable cover by sets of finite measure (Finite, sigma-finite, and semifinite measures). The finite product sigma-algebra is generated by measurable rectangles (The product sigma-algebra and its finite iterates). The product reference measure is the one supplied by For sigma-finite factors, the product measure exists, has the rectangle formula, is sigma-finite, and is unique.
A jointly measurable latent-variable density is a specified function measurable for and normalized on every parameter fibre: Here is the observed coordinate and the latent coordinate. The observed marginal density is The valid-fibre set is . Only on define the normalized latent-fibre density This definition requires a single jointly measurable density as an input. Likelihood densities supplies neither a sigma-algebra on nor joint parameter measurability from separately specified likelihood sections; the joint measurability above is an additional hypothesis. Because is already supplied as one joint function, this definition uses no choice axiom. It does not assert that AC can turn separately specified pointwise likelihood versions into a jointly measurable version. No quotient or pointwise conditional density is asserted on a zero or infinite marginal fibre.
Kullback–Leibler divergence is nonnegative
Statement
Assume AC and use the directional convention of Kullback–Leibler divergence. For probability measures on one measurable space, , and if and only if .
There is also the following normalized-density identity. Let be a sigma-finite measure space: it is a set with a sigma-algebra and measure (Measure spaces), and there is a countable measurable cover by sets of finite -measure (Finite, sigma-finite, and semifinite measures). Let be a finite-valued measurable function with , and put . Let be a finite-valued measurable probability density, so , and suppose -almost everywhere on . Assume where each term with is defined to be zero. Then In particular, the first integral is at most . This identity concerns normalized densities only; it does not assert posterior existence for an unspecified statistical model.
Facts & Assumptions
Given: AC and probability measures ; for the normalized-density clause, a sigma-finite measure space , finite-valued measurable , , , , almost everywhere on , and the stated absolute-integrability condition.
The Axiom of Choice: AC supplies the Radon–Nikodym representative used by the published KL definition. The marginalization and density computations below use no further choice.
Kullback–Leibler divergence: if , then . If and , then , with and a finite negative part; the definition sets the logarithm to zero on .
A sigma-finite signed measure that is absolutely continuous with respect to a sigma-finite positive measure has a unique almost-everywhere density: for finite positive , a measurable density satisfies for every measurable .
Jensen's integral inequality for a probability measure: on a probability space, if and are integrable and is convex, then .
The integral logarithm for and The integral logarithm is the published natural logarithm: for , and this integral logarithm is the natural logarithm.
The integral logarithm satisfies for and : for , .
A twice-differentiable function on an open interval is convex if and only if its second derivative is nonnegative: a twice differentiable function on an open interval with nonnegative second derivative is convex there.
If on and both are integrable then ; and : pointwise bounds on integrable functions on a nondegenerate interval pass to their Riemann integrals.
A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous real-valued function on a compact interval is Riemann integrable.
For : is integrable on if and only if it is integrable on and on , and then ; with the oriented form for arbitrary : for an integrable function and oriented endpoints in its interval of integrability, .
A nonnegative measurable function has integral exactly when it vanishes almost everywhere: a nonnegative measurable function has integral zero exactly when it vanishes almost everywhere.
Measure spaces and Finite, sigma-finite, and semifinite measures: a measure space is a set with a sigma-algebra and measure; sigma-finiteness means there is a countable measurable cover by sets of finite measure.
Probability measures and probability spaces: a probability measure has total mass one.
The measure with density relative to : for a nonnegative measurable density , the associated measure is .
Integrating against a density agrees with integrating the product: for nonnegative measurable , .
Monotonicity and nonnegative homogeneity of the nonnegative integral: multiplying a nonnegative measurable function by a positive finite scalar multiplies its integral by that scalar.
The Borel sigma-algebra on the extended real line: the extended-real Borel sigma-algebra is generated by rays and contains Borel intervals in .
Threshold characterisations of real-valued and extended-real-valued measurability: an extended-real function is Borel measurable if all strict upper threshold preimages are Borel.
Composition with a Borel measurable outer map preserves measurability: composition of a measurable map with a Borel measurable outer map is measurable.
Arithmetic and lattice operations preserve measurability whenever they are defined: pointwise products of extended-real measurable functions are measurable under its stated zero-times-infinity convention.
The positive and negative parts of a function: for a measurable real-valued function , and
Basic properties of the absolute value: and for real . Adding the bounds for and gives , hence .
If on then for every partition ; in particular every constant function is integrable, with : for a continuous constant function on , .
The Lebesgue integral is linear on : is a vector space and the integral is linear on it.
Proof
If , [F1] gives . If but , nonnegativity is immediate. It remains to consider with finite divergence; let .
Put and for . By [F5] and [F7], for , so [F8] makes convex on . Its continuity at zero is part of [F1]; taking limits in the convexity inequality as a positive endpoint tends to zero extends convexity to .
Define for and . For , set . By [F11], . On , , while on , ; [F9] and [F24] give . For , set . By [F11], . On , , and on , ; [F9] and [F24] give . The integrands and comparison constants are integrable on these compact intervals by [F10]. Equality holds at . Applying this inequality to and using [F6] gives , strictly unless . Hence and its only zero is .
For the normalized-density clause on the measure space [F13], put and . By [F17], ; hence [F15] and [F14] make and probability measures.
If , [F15] gives , hence because is finite and positive, using [F17]. By [F12], -almost everywhere on . The support hypothesis on then gives , so . Define by for finite and . For , ; for it is ; and for it is . These are Borel by [F18], so [F19] makes Borel. By [F20]–[F21], is measurable and equals on and zero on . For every measurable , [F16] gives because -almost everywhere on . Thus .
By [F2] with equal to the whole space, . The negative part of is finite by [F1], so finiteness of also makes its positive part finite. Thus and are integrable with respect to the probability measure . The Radon–Nikodym representative here is the one whose selection is covered by [A1].
On the -full-measure subset of where , we have and . Where , the KL logarithm is defined to be zero. By [F23], almost everywhere. The right-hand side has finite integral by the hypotheses and ; hence [F16] gives . By [F1], [F16], and [F22], applying [F16] to the positive and negative parts of gives Using and rearranging proves the identity.
Apply [F3] on to and . Steps 2.1 and 1.2 check its integrability and convexity hypotheses, and by step 2.1. Therefore
The representative is finite-valued and measurable by [F1], and is measurable there; the arithmetic measurability result [F21] therefore makes measurable. It is nonnegative by step 1.3. By step 2.1, , and because is a probability measure. Linearity [F25] now gives and Thus if , [F12] applies to the measurable nonnegative integrand and gives -almost everywhere. By step 1.3, -almost everywhere, and the Radon–Nikodym identity [F2] gives for every measurable . Conversely, if then almost everywhere and [F1] gives .
Step 2.2 identifies the normalized-density divergence as finite, and step 3.1 proves it is nonnegative. Therefore , as claimed.
Gradient descent
Definition
Let be open and let be continuously Fréchet differentiable. The gradient is the vector of partial derivatives in the Euclidean coordinates, with the convention of The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case; differentiability is the Fréchet condition of The real Frechet derivative on real and complex matrix spaces with the Frobenius norm.
Inputs: an initial point ; either a positive fixed-step
sequence or backtracking parameters and
; and an optional caller stopping predicate
, with
.
If no predicate is supplied, use . Output: when the
procedure stops, return the last valid iterate and the status
stationary, caller-stop, or domain-failure.
If no stopping status occurs, the sequence continues and there is no finite
return.
For example, an outer procedure's at-most--updates limit, for finite real
, is implemented by .
At iteration , where is the number of accepted updates so far and the current iterate is :
- Compute and set . If , return .
- If is true, return . Check this predicate at the current iterate after its gradient is computed and before any step is selected.
- In fixed-step mode, set . If , return without accepting that candidate.
- In backtracking mode, start with and repeatedly replace by until and .
- Set and continue at iteration .
The fixed-step update map is ; at a stationary point its value is , which is the returned iterate. A backtracking search that is reached at a nonstationary iterate is well-defined by Armijo backtracking terminates for strict descent directions ↗. The procedure asserts no convergence or global-minimization property for an arbitrary objective.
Damped Newton method
Definition
Let , let be open, and let be twice continuously Fréchet differentiable. Write and using The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case and The Hessian matrix and critical points of a scalar field. The Hessian is symmetric by The Hessian of a scalar field is symmetric.
Inputs: , a Newton-decrement tolerance , and
line-search parameters and . Output:
when the procedure stops, return the last valid iterate and one of the
statuses stationary, decrement, or
positive-definite solve unavailable.
If none of these stopping conditions occurs, the sequence continues and there
is no finite return.
At iteration with current iterate :
- Compute . If , return .
- If is not positive definite, return without a Newton update. Otherwise compute its Cholesky factorization , solve and , and set
- Before line search, if , return . This is the Newton-decrement stopping test.
- Start with and repeatedly replace by until and .
- Set and continue at iteration .
The Cholesky factor exists and is unique when the symmetric Hessian is positive definite by A matrix admits a Cholesky factorisation with positive diagonal exactly when it is Hermitian positive definite, and that factor is unique. Its positive diagonal makes both triangular solves unique. The backtracking branch terminates whenever it is reached, since and is positive definite, by Armijo backtracking terminates for strict descent directions ↗. This procedure makes no global-optimality claim.
The observed density is the latent marginal under Tonelli
Statement
Assume the hypotheses of Latent-variable joint and observed-data factorization. Then is jointly measurable in . For each fixed , it is an observed-data probability density: it is -measurable and Consequently for -almost every . On every valid fibre , is a measurable -density of total mass one. Finally, if is product measurable and for a fixed , Fubini permits exchanging the latent and observed integrals of . No exchange is claimed without this absolute integrability.
Facts & Assumptions
Given: The parameter and data spaces, sigma-finite measures , jointly measurable normalized , and, for the last clause, a product measurable complex-valued with .
Latent-variable joint and observed-data factorization: is jointly measurable, each fixed- joint density integrates to one, , and is defined only when .
Measure kernel and probability kernel: a uniformly sigma-finite kernel comes with a specified exhaustion for which each kernel mass on is finite.
Measurability of integration against a kernel: integrating a nonnegative product-measurable function against a finite or uniformly sigma-finite kernel gives a measurable function of the parameter.
Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: for nonnegative product-measurable , its section integrals are measurable and the iterated and product integrals agree.
Fubini's theorem for L^1 functions on a sigma-finite product: for an function, almost every section is integrable and the iterated integrals equal the product integral.
Monotonicity and nonnegative homogeneity of the nonnegative integral: pointwise order and multiplication by a positive finite scalar pass to nonnegative integrals.
Every complete ordered field is Archimedean: the positive integers are unbounded in .
The Borel sigma-algebra on the extended real line: the extended-real Borel structure contains and its Borel subsets.
Threshold characterisations of real-valued and extended-real-valued measurability: an extended-real function is measurable if all strict upper threshold preimages are measurable.
Composition with a Borel measurable outer map preserves measurability: composition of a measurable map with a Borel measurable outer map is measurable.
Arithmetic and lattice operations preserve measurability whenever they are defined: products of extended-real measurable functions are measurable under its stated zero-times-infinity convention.
The product sigma-algebra and its finite iterates: the finite product sigma-algebra is generated by measurable rectangles.
Finite, sigma-finite, and semifinite measures: sigma-finiteness provides a countable measurable exhaustion by sets of finite measure.
Proof
Fix and let be the collection of subsets whose section belongs to . Sections commute with complements and countable unions, so is a sigma-algebra. It contains each measurable rectangle , whose section is if and empty otherwise. By [F12], every product-measurable set has a measurable section. Applying this to preimages of Borel sets shows that is product-measurable. For complex , first compose with the continuous Borel coordinate maps ; the same section argument makes both and measurable, hence is complex-measurable.
By [F13], choose a measurable exhaustion with . On , the constant assignment is a measure kernel: each section is and each evaluation map is constant. The same exhaustion makes it uniformly sigma-finite by [F2].
For fixed , step 1.1 makes product-measurable, so Tonelli [F4] gives by [F1]. Thus is a probability density. Also is measurable. For every positive integer , , so [F6] gives . Since this holds for every , [F7] implies .
The function is nonnegative and product-measurable by [F1]. Under the finite-product identification from [F12], apply [F3] to the constant kernel from step 1.2. It follows that is measurable on .
For fixed , write and . Define the finite-valued measurable function and then By [F11] this is complex-valued product-measurable; it is defined to be zero on the null set where . It agrees with off that null set, and the assumed absolute integrability gives . Fubini [F5] applies to this representative and gives with its zero assignment on exceptional null sections. Since almost everywhere on the fixed- product space, these are the asserted exchanges for .
Let , measurable by step 2.2. For each positive integer , , so [F6] and step 2.1 give . Since this holds for every , [F7] forces . If , division by that scalar and the definition of give . The valid-fibre set is measurable by step 2.2 and [F8]. For measurability, define by for finite and . For , ; for it is ; and for it is . These sets are Borel by [F8], so [F9] makes Borel. By [F10], is measurable on . Pulling it back along the measurable coordinate projection from the finite product space, which is measurable by [F12], gives a product-measurable function; multiplying by preserves measurability by [F11]. This product restricts to on , so is measurable on the valid-fibre set.
Steps 2.2, 2.1, 3.2, and 3.1 prove the marginal measurability, normalization, valid-fibre density, and integrable-exchange clauses.
Armijo backtracking terminates for strict descent directions
Statement
For either backtracking procedure in Gradient descent and Damped Newton method, suppose the objective is differentiable at a point of an open domain and the current direction satisfies . If the line search starts at , uses a factor , and accepts when for a fixed , it accepts after finitely many reductions. For the Newton branch, assume the current Hessian is symmetric positive definite.
Facts & Assumptions
Given: An open , a Fréchet differentiable , , , and a direction with ; for the Newton branch, a symmetric positive-definite Hessian.
Gradient descent: its backtracking branch uses , starts at , multiplies rejected steps by , and checks the Armijo inequality.
Damped Newton method: its direction solves using Cholesky when is symmetric positive definite, and its line search uses the same geometric backtracking rule.
The real Frechet derivative on real and complex matrix spaces with the Frobenius norm: is real-linear; The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case defines the gradient by the partial derivatives in the standard basis.
A matrix admits a Cholesky factorisation with positive diagonal exactly when it is Hermitian positive definite, and that factor is unique: a symmetric positive-definite Hessian has an invertible Cholesky factor.
Bernoulli's inequality : for and .
Every complete ordered field is Archimedean: the natural numbers are cofinal in .
Proof
By linearity of and its values on the standard basis, . In the gradient branch, if , then by [F1]. In the Newton branch, write and . If , then by [F4] and , since is symmetric positive definite by [F2] and [F4].
Set . Fréchet differentiability gives as . Choose small enough that and this quotient is less than whenever . Then every such trial satisfies the Armijo test.
The trials are . Put . By [F5], , hence . By [F6], for any some is large enough that ; thus .
Step 1.2 supplies a positive interval of accepted trial sizes. The geometric sequence shown in step 1.3 eventually tests such a size, so the prescribed loop accepts after finitely many reductions in either algorithm.
Gradient descent rate under strong convexity and smoothness
Statement
Let be continuously differentiable and have an attained minimum . Say that is -smooth when for all , and -strongly convex when If and Gradient descent uses the fixed step , then the initial gap is unchanged at , and for every generated iterate with integer , For , the factor is zero only for the stated range; no convention is used.
Facts & Assumptions
Given: A continuously differentiable with attained minimum , a gradient Lipschitz constant , a strong convexity constant , and iterates from Gradient descent with step .
-smooth means the displayed gradient Lipschitz bound in the Statement.
-strong convexity means the displayed quadratic lower bound in the Statement.
Gradient descent in fixed-step mode updates whenever it does not stop at .
The real Frechet derivative on real and complex matrix spaces with the Frobenius norm: is real-linear. The Jacobian matrix of partial derivatives and the gradient in the scalar-valued case defines the gradient by coordinate partials. Since a linear map is determined by its values on the standard basis, .
The chain rule for total derivatives: : differentiating a composition with the line composes the total derivative with .
A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous real function on a compact interval is Riemann integrable.
Newton–Leibniz needs only continuity on , differentiability on , and a Riemann-integrable extension of the interior derivative: a continuous scalar function on a closed interval whose interior derivative has an integrable extension has endpoint increment equal to the integral of that derivative.
Proof
Fix and write and . Define on . By [F2]–[F3], on . The gradient is continuous by [A1], so is continuous and integrable by [F4]. Applying [F5] gives By [A1] and [F6], , whence . Integrating this bound gives
By [A2], for every , Taking and using nonnegativity of the square yields .
Apply steps 1.1 and 1.2 at and use [F1]. Then The factor is nonnegative because .
The case is equality. For , the result is step 2.1 whenever is generated. If is generated, then was generated and the algorithm made the th update; multiplying the bound at by and applying step 2.1 proves it at . Induction along generated iterates gives the claim for every generated . If the stopping rule fires earlier, no later iterate is asserted.
Newton's method has local quadratic convergence under a Lipschitz Hessian
Statement
Let , let be open, and let be . Use the Hessian convention of The Hessian matrix and critical points of a scalar field. Suppose is an interior critical point, is positive definite, and for some , the ball lies in and Fix any Newton-decrement tolerance and the Armijo parameters and in Damped Newton method. There are and such that every generated iterate from a start remains in this ball. At each generated nonstationary iterate for which the algorithm's decrement test satisfies and a Newton update is therefore attempted, the line search accepts the full step and If the decrement test stops the procedure, no next iterate or update bound is asserted at that point. Here is the decrement computed by Damped Newton method. This is a local statement; it supplies no global optimum or convergence claim for a nonconvex objective.
Facts & Assumptions
Given: The positive integer , tolerance , and as in the Statement. The operator norm is .
Damped Newton method: at a nonstationary point with positive-definite Hessian it computes and ; it stops before line search if , and otherwise accepts whenever the Armijo inequality holds.
The Hessian of a scalar field is symmetric: the Hessian of a real scalar field is symmetric.
Real spectral theorem: a self-adjoint endomorphism of a finite-dimensional real inner product space has an orthonormal eigenbasis: a symmetric real matrix has an orthonormal eigenbasis.
A matrix admits a Cholesky factorisation with positive diagonal exactly when it is Hermitian positive definite, and that factor is unique: a symmetric positive-definite Hessian has an invertible Cholesky factor.
The chain rule for total derivatives: : differentiating each gradient coordinate along a line composes its total derivative with the line direction.
A continuous function on is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous real function on a compact interval is Riemann integrable.
Newton–Leibniz needs only continuity on , differentiability on , and a Riemann-integrable extension of the interior derivative: a continuous scalar function on a closed interval whose interior derivative has a continuous integrable extension has derivative integral equal to its endpoint increment.
Multivariable Taylor formula with a Lagrange remainder along a line segment: for on a convex open set and a segment in it, the order-one Taylor formula has a second-order Hessian remainder at for some .
The Hessian matrix and critical points of a scalar field: is the matrix of second partial derivatives, and a critical point has .
If on and both are integrable then ; and : pointwise bounds on an integrable real function on pass to its integral.
Proof
By [F2]–[F3], has an orthonormal eigenbasis with positive eigenvalues. Let be its smallest eigenvalue. Choose with . For and any vector , Thus is positive definite there and [F4] makes each Newton solve well-defined.
Put , , and . Along the segment , where and , apply [F5] to each coordinate of the gradient map . Its derivative is the corresponding coordinate of ; the integrand is continuous and hence integrable by [F6]. Newton–Leibniz [F7] and give For every , , so each coordinate of is bounded in absolute value by . Apply [F11] to each coordinate integral; this gives and hence . Each coordinate of is bounded in absolute value by , using the operator-norm Lipschitz bound and [F10]. Applying [F11] to these coordinate integrals gives
Let be the Newton direction and . Since and by step 1.1 and the orthonormal eigenbasis in [F3], step 2.1 gives Also with , because .
Choose and, if , also choose ; decrease further so . For the segment from to lies in . If , step 3.1 gives , so the choice forces .
Whenever a nonzero Newton direction is sent to line search, apply [F8] with on the segment . For some , Write by step 1.1. Since and is -Lipschitz, by the choice of in step 4.1. If , the same inequality holds with its cubic term zero. Therefore the full step passes the Armijo test and [F1] accepts . This is conditional on the decrement test not stopping before line search.
At any generated iterate in , a nonstationary point has a positive-definite Hessian by step 1.1, so the unavailable-solve status cannot occur. If its decrement test stops the method, no update is attempted. Otherwise step 5.1 gives a unit step, and steps 3.1 and 5.1 give the quadratic bound and , so the next generated iterate remains in the ball. If an iterate is stationary, step 4.1 shows it is . Induction over generated iterates proves the local statement, with the rate asserted exactly for updates the algorithm attempts. No claim outside this neighborhood follows.
5 · Examples, counterexamples and false statements
None yet.