Alphabeta Math
Pipeline-generated
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

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

DefinitionDefinition: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Latent-variable joint and observed-data factorization

Definition

Let (Θ,T), (X,A), and (Z,C) 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 p:Θ×X×Z⟶[0,∞] measurable for T⊗A⊗C and normalized on every parameter fibre: ∫X×Zp(θ,x,z) (ν⊗μ)(d(x,z))=1(θ∈Θ). Here x is the observed coordinate and z the latent coordinate. The observed marginal density is m(θ,x):=∫Zp(θ,x,z) μ(dz). The valid-fibre set is V:={(θ,x):0<m(θ,x)<∞}. Only on V define the normalized latent-fibre density q(z∣θ,x):=p(θ,x,z)m(θ,x). 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 p 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.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Kullback–Leibler divergence is nonnegative

Statement

Assume AC and use the directional convention of Kullback–Leibler divergence. For probability measures P,Q on one measurable space, D(P∥Q)≥0, and D(P∥Q)=0 if and only if P=Q.

There is also the following normalized-density identity. Let (X,A,μ) 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 γ:X→[0,∞) be a finite-valued measurable function with Z:=∫γ dμ∈(0,∞), and put π=γ/Z. Let q:X→[0,∞) be a finite-valued measurable probability density, so ∫q dμ=1, and suppose q=0 μ-almost everywhere on {γ=0}. Assume ∫q(∣log⁡γ∣+∣log⁡q∣) dμ<∞, where each term with q=0 is defined to be zero. Then log⁡Z=∫q(log⁡γ−log⁡q) dμ+D(q μ∥π μ). In particular, the first integral is at most log⁡Z. This identity concerns normalized densities only; it does not assert posterior existence for an unspecified statistical model.

Facts & Assumptions

Given: AC and probability measures P,Q; for the normalized-density clause, a sigma-finite measure space (X,A,μ), finite-valued measurable γ,q≥0, 0<Z=∫γ dμ<∞, π=γ/Z, ∫q dμ=1, q=0 almost everywhere on {γ=0}, and the stated absolute-integrability condition.

[A1]

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.

[F1]

Kullback–Leibler divergence: if P≪̸Q, then D(P∥Q)=+∞. If P≪Q and r=dP/dQ, then D(P∥Q)=∫log⁡r dP=∫rlog⁡r dQ, with 0log⁡0=0 and a finite negative part; the definition sets the logarithm to zero on {r=0}.

[F2]

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 P≪Q, a measurable density r=dP/dQ satisfies P(E)=∫Er dQ for every measurable E.

[F3]

Jensen's integral inequality for a probability measure: on a probability space, if r and φ(r) are integrable and φ is convex, then φ(∫r)≤∫φ(r).

[F4]

The integral logarithm L(x):=∫1xdtt for x>0 and The integral logarithm L is the published natural logarithm: for t>0, log⁡t=∫1tdu/u and this integral logarithm is the natural logarithm.

[F8]

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.

[F9]
[F10]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous real-valued function on a compact interval is Riemann integrable.

[F12]

A nonnegative measurable function has integral 0 exactly when it vanishes almost everywhere: a nonnegative measurable function has integral zero exactly when it vanishes almost everywhere.

[F13]

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.

[F14]

Probability measures and probability spaces: a probability measure has total mass one.

[F15]

The measure with density f relative to μ: for a nonnegative measurable density f, the associated measure is (f dμ)(E)=∫Ef dμ.

[F16]

Integrating against a density agrees with integrating the product: for nonnegative measurable g,f, ∫g d(f dμ)=∫gf dμ.

[F17]

Monotonicity and nonnegative homogeneity of the nonnegative integral: multiplying a nonnegative measurable function by a positive finite scalar multiplies its integral by that scalar.

[F18]

The Borel sigma-algebra on the extended real line: the extended-real Borel sigma-algebra is generated by rays (a,+∞] and contains Borel intervals in [0,+∞].

[F19]

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.

[F20]

Composition with a Borel measurable outer map preserves measurability: composition of a measurable map with a Borel measurable outer map is measurable.

[F21]

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.

[F22]

The positive and negative parts of a function: for a measurable real-valued function h, h=h+−h− and ∣h∣=h++h−.

[F23]

Basic properties of the absolute value: −∣a∣≤a≤∣a∣ and ∣−a∣=∣a∣ for real a. Adding the bounds for a and b gives −(∣a∣+∣b∣)≤a+b≤∣a∣+∣b∣, hence ∣a+b∣≤∣a∣+∣b∣.

[F25]

The Lebesgue integral is linear on L1(μ): L1(Q) is a vector space and the integral is linear on it.

Proof

1.1F1given

If P≪̸Q, [F1] gives D(P∥Q)=+∞. If P≪Q but D(P∥Q)=+∞, nonnegativity is immediate. It remains to consider P≪Q with finite divergence; let r=dP/dQ.

1.2F1F5F7F8algebra

Put φ(0)=0 and φ(t)=tlog⁡t for t>0. By [F5] and [F7], φ′′(t)=1/t>0 for t>0, so [F8] makes φ convex on (0,∞). Its continuity at zero is part of [F1]; taking limits in the convexity inequality as a positive endpoint tends to zero extends convexity to [0,∞).

1.3F4F6F9F10F11F24algebra

Define g(t):=tlog⁡t−t+1 for t>0 and g(0):=1. For s>1, set c=(1+s)/2. By [F11], log⁡s=∫1cdu/u+∫csdu/u. On [1,c], 1/u≤1, while on [c,s], 1/u≤1/c<1; [F9] and [F24] give log⁡s<s−1. For 0<s<1, set c=(1+s)/2. By [F11], log⁡s=−∫s1du/u=−(∫scdu/u+∫c1du/u). On [s,c], 1/u≥1/c>1, and on [c,1], 1/u≥1; [F9] and [F24] give log⁡s<s−1. The integrands and comparison constants are integrable on these compact intervals by [F10]. Equality holds at s=1. Applying this inequality to s=1/t and using [F6] gives tlog⁡t≥t−1, strictly unless t=1. Hence g≥0 and its only zero is 1.

1.4F13F14F15F17givenalgebra

For the normalized-density clause on the measure space [F13], put P:=q μ and Q:=π μ. By [F17], ∫π dμ=Z−1∫γ dμ=1; hence [F15] and [F14] make P and Q probability measures.

1.5F12F15F16F17F18F19F20F21givenalgebra

If Q(E)=0, [F15] gives ∫Eπ dμ=0, hence ∫Eγ dμ=0 because Z is finite and positive, using [F17]. By [F12], γ=0 μ-almost everywhere on E. The support hypothesis on q then gives P(E)=0, so P≪Q. Define ρ:[0,∞]→[0,∞] by ρ(t)=1/t for finite t>0 and ρ(0)=ρ(+∞)=0. For a<0, {ρ>a}=[0,∞]; for a=0 it is (0,∞); and for a>0 it is (0,1/a). These are Borel by [F18], so [F19] makes ρ Borel. By [F20]–[F21], r:=q ρ(π) is measurable and equals q/π on {π>0} and zero on {π=0}. For every measurable E, [F16] gives ∫Er dQ=∫Erπ dμ=∫Eq dμ=P(E), because q=0 μ-almost everywhere on {π=0}. Thus r=dP/dQ.

2.1A1F1F2step 1.1

By [F2] with E equal to the whole space, ∫r dQ=P(Ω)=1. The negative part of rlog⁡r is finite by [F1], so finiteness of D(P∥Q) also makes its positive part finite. Thus r and rlog⁡r are integrable with respect to the probability measure Q. The Radon–Nikodym representative here is the one whose selection is covered by [A1].

2.2A1F1F16F22F23givenstep 1.5algebra

On the P-full-measure subset of {q>0} where γ>0, we have π=γ/Z>0 and ℓ:=log⁡r=log⁡q−log⁡γ+log⁡Z. Where q=0, the KL logarithm ℓ is defined to be zero. By [F23], q∣ℓ∣≤q∣log⁡q∣+q∣log⁡γ∣+q∣log⁡Z∣ almost everywhere. The right-hand side has finite integral by the hypotheses and ∫q=1; hence [F16] gives ∫∣ℓ∣ dP=∫q∣ℓ∣ dμ<∞. By [F1], [F16], and [F22], applying [F16] to the positive and negative parts of ℓ gives D(P∥Q)=∫log⁡r dP=∫q(log⁡q−log⁡γ+log⁡Z) dμ. Using ∫q dμ=1 and rearranging proves the identity.

3.1F1F3step 2.1step 1.2

Apply [F3] on (Ω,A,Q) to r and φ. Steps 2.1 and 1.2 check its integrability and convexity hypotheses, and ∫r dQ=1 by step 2.1. Therefore 0=φ(1)=φ ⁣(∫r dQ)≤∫φ(r) dQ=D(P∥Q).

3.2A1F1F2F12F21F25step 2.1step 1.3algebra

The representative r is finite-valued and measurable by [F1], and φ(r) is measurable there; the arithmetic measurability result [F21] therefore makes g(r)=φ(r)−r+1 measurable. It is nonnegative by step 1.3. By step 2.1, r,φ(r)∈L1(Q), and 1∈L1(Q) because Q is a probability measure. Linearity [F25] now gives g(r)∈L1(Q) and ∫g(r) dQ=∫φ(r) dQ−∫r dQ+∫1 dQ=D(P∥Q)−1+1=D(P∥Q). Thus if D(P∥Q)=0, [F12] applies to the measurable nonnegative integrand and gives g(r)=0 Q-almost everywhere. By step 1.3, r=1 Q-almost everywhere, and the Radon–Nikodym identity [F2] gives P(E)=Q(E) for every measurable E. Conversely, if P=Q then r=1 almost everywhere and [F1] gives D(P∥Q)=0.

4.1step 2.2step 3.1algebra∎

Step 2.2 identifies the normalized-density divergence as finite, and step 3.1 proves it is nonnegative. Therefore ∫q(log⁡γ−log⁡q) dμ≤log⁡Z, as claimed.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Gradient descent

Definition

Let U⊆Rd be open and let f:U→R be continuously Fréchet differentiable. The gradient ∇f(x) 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 x0∈U; either a positive fixed-step sequence (tk)k≥0 or backtracking parameters α∈(0,1) and β∈(0,1); and an optional caller stopping predicate S(k,x,g)∈{false,true}, with S:{0,1,2,…}×U×Rd→{false,true}. If no predicate is supplied, use S≡false. Output: when the procedure stops, return the last valid iterate xk 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-M-updates limit, for finite real M≥0, is implemented by S(k,x,g):=(k+1>M).

At iteration k, where k is the number of accepted updates so far and the current iterate is xk:

  1. Compute gk:=∇f(xk) and set pk:=−gk. If gk=0, return (xk,stationary).
  2. If S(k,xk,gk) is true, return (xk,caller-stop). Check this predicate at the current iterate after its gradient is computed and before any step is selected.
  3. In fixed-step mode, set t=tk. If xk+tpk∉U, return (xk,domain-failure) without accepting that candidate.
  4. In backtracking mode, start with t=1 and repeatedly replace t by βt until xk+tpk∈U and f(xk+tpk)≤f(xk)+αt ⟨gk,pk⟩.
  5. Set xk+1:=xk+tpk and continue at iteration k+1.

The fixed-step update map is x↦x−tk∇f(x); at a stationary point its value is x, 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.

AlgorithmAlgorithm: Literature-sourcedProof: Not applicablejudge pass (gpt-6-luna)Open item page →

Damped Newton method

Definition

Let d≥1, let U⊆Rd be open, and let f:U→R be twice continuously Fréchet differentiable. Write g(x)=∇f(x) and H(x)=∇2f(x) 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 C2 scalar field is symmetric.

Inputs: x0∈U, a Newton-decrement tolerance ε>0, and line-search parameters α∈(0,1/2) and β∈(0,1). Output: when the procedure stops, return the last valid iterate xk 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 k with current iterate xk:

  1. Compute gk:=g(xk). If gk=0, return (xk,stationary).
  2. If Hk:=H(xk) is not positive definite, return (xk,positive-definite solve unavailable) without a Newton update. Otherwise compute its Cholesky factorization Hk=LkLkT, solve Lkw=−gk and LkTpk=w, and set λk2:=−⟨gk,pk⟩=gkTHk−1gk>0.
  3. Before line search, if λk2/2≤ε, return (xk,decrement). This is the Newton-decrement stopping test.
  4. Start with t=1 and repeatedly replace t by βt until xk+tpk∈U and f(xk+tpk)≤f(xk)+αt ⟨gk,pk⟩.
  5. Set xk+1:=xk+tpk and continue at iteration k+1.

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 gk≠0 and Hk is positive definite, by Armijo backtracking terminates for strict descent directions ↗. This procedure makes no global-optimality claim.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

The observed density is the latent marginal under Tonelli

Statement

Assume the hypotheses of Latent-variable joint and observed-data factorization. Then m(θ,x)=∫p(θ,x,z) μ(dz) is jointly measurable in (θ,x). For each fixed θ, it is an observed-data probability density: it is A-measurable and ∫Xm(θ,x) ν(dx)=1. Consequently m(θ,x)<∞ for ν-almost every x. On every valid fibre 0<m(θ,x)<∞, q(z∣θ,x)=p(θ,x,z)/m(θ,x) is a measurable μ-density of total mass one. Finally, if h:Θ×X×Z→C is product measurable and ∫∣h(θ,x,z)∣p(θ,x,z) d(ν⊗μ)<∞ for a fixed θ, Fubini permits exchanging the latent and observed integrals of hp. No exchange is claimed without this absolute integrability.

Facts & Assumptions

Given: The parameter and data spaces, sigma-finite measures ν,μ, jointly measurable normalized p, and, for the last clause, a product measurable complex-valued h with ∫∣h∣p<∞.

[F1]

Latent-variable joint and observed-data factorization: p is jointly measurable, each fixed-θ joint density integrates to one, m(θ,x)=∫p(θ,x,z) μ(dz), and q=p/m is defined only when 0<m<∞.

[F2]

Measure kernel and probability kernel: a uniformly sigma-finite kernel comes with a specified exhaustion (Zn) for which each kernel mass on Zn is finite.

[F3]

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.

[F4]

Tonelli's theorem for nonnegative measurable functions on a sigma-finite product: for nonnegative product-measurable p, its section integrals are measurable and the iterated and product integrals agree.

[F5]

Fubini's theorem for L^1 functions on a sigma-finite product: for an L1(ν⊗μ) function, almost every section is integrable and the iterated integrals equal the product integral.

[F6]

Monotonicity and nonnegative homogeneity of the nonnegative integral: pointwise order and multiplication by a positive finite scalar pass to nonnegative integrals.

[F7]

Every complete ordered field is Archimedean: the positive integers are unbounded in R.

[F8]

The Borel sigma-algebra on the extended real line: the extended-real Borel structure contains [0,∞] and its Borel subsets.

[F9]

Threshold characterisations of real-valued and extended-real-valued measurability: an extended-real function is measurable if all strict upper threshold preimages are measurable.

[F10]

Composition with a Borel measurable outer map preserves measurability: composition of a measurable map with a Borel measurable outer map is measurable.

[F11]

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.

[F12]

The product sigma-algebra and its finite iterates: the finite product sigma-algebra is generated by measurable rectangles.

[F13]

Finite, sigma-finite, and semifinite measures: sigma-finiteness provides a countable measurable exhaustion by sets of finite measure.

Proof

1.1F10F12given

Fix θ and let Dθ be the collection of subsets E⊆Θ×X×Z whose section Eθ:={(x,z):(θ,x,z)∈E} belongs to A⊗C. Sections commute with complements and countable unions, so Dθ is a sigma-algebra. It contains each measurable rectangle T0×A0×C0, whose section is A0×C0 if θ∈T0 and empty otherwise. By [F12], every product-measurable set has a measurable section. Applying this to preimages of Borel sets shows that pθ(x,z):=p(θ,x,z) is product-measurable. For complex h, first compose with the continuous Borel coordinate maps Re⁡,Im⁡:C→R; the same section argument makes both Re⁡hθ and Im⁡hθ measurable, hence hθ is complex-measurable.

1.2F2F13givenchoose

By [F13], choose a measurable exhaustion Zn↑Z with μ(Zn)<∞. On S:=Θ×X, the constant assignment K(s,B):=μ(B) is a measure kernel: each section is μ and each evaluation map is constant. The same exhaustion makes it uniformly sigma-finite by [F2].

2.1F1F4F6F7givenstep 1.1

For fixed θ, step 1.1 makes pθ product-measurable, so Tonelli [F4] gives ∫Xm(θ,x) ν(dx)=∫X×Zpθ(x,z) d(ν⊗μ)=1 by [F1]. Thus m(θ,⋅) is a probability density. Also Eθ:={(x,z):pθ(x,z)=∞} is measurable. For every positive integer n, n1Eθ≤pθ, so [F6] gives n(ν⊗μ)(Eθ)≤1. Since this holds for every n, [F7] implies (ν⊗μ)(Eθ)=0.

2.2F1F3F12step 1.2

The function p is nonnegative and product-measurable by [F1]. Under the finite-product identification S×Z=(Θ×X)×Z from [F12], apply [F3] to the constant kernel K from step 1.2. It follows that s↦∫p(s,z) μ(dz)=m(s) is measurable on S.

3.1F5F11givenstep 1.1step 2.1

For fixed θ, write uθ=Re⁡hθ and vθ=Im⁡hθ. Define the finite-valued measurable function p~θ:=pθ1{pθ<∞} and then Hθ:=uθp~θ+ivθp~θ. By [F11] this is complex-valued product-measurable; it is defined to be zero on the null set where pθ=∞. It agrees with hθpθ off that null set, and the assumed absolute integrability gives ∫∣Hθ∣ d(ν⊗μ)<∞. Fubini [F5] applies to this L1 representative and gives ∫X×ZHθ d(ν⊗μ)=∫X(∫ZHθ(x,z) μ(dz))ν(dx)=∫Z(∫XHθ(x,z) ν(dx))μ(dz), with its zero assignment on exceptional null sections. Since Hθ=hp almost everywhere on the fixed-θ product space, these are the asserted exchanges for hp.

3.2F1F6F7F8F9F10F11F12step 2.2step 2.1algebra

Let E:={x:m(θ,x)=∞}, measurable by step 2.2. For each positive integer n, n1E≤m(θ,⋅), so [F6] and step 2.1 give nν(E)≤1. Since this holds for every n, [F7] forces ν(E)=0. If 0<m(θ,x)<∞, division by that scalar and the definition of m give ∫q(z∣θ,x) μ(dz)=m(θ,x)/m(θ,x)=1. The valid-fibre set V=m−1((0,∞)) is measurable by step 2.2 and [F8]. For measurability, define ρ:[0,∞]→[0,∞] by ρ(t)=1/t for finite t>0 and ρ(0)=ρ(+∞)=0. For a<0, {ρ>a}=[0,∞]; for a=0 it is (0,∞); and for a>0 it is (0,1/a). These sets are Borel by [F8], so [F9] makes ρ Borel. By [F10], ρ∘m is measurable on Θ×X. 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 p preserves measurability by [F11]. This product restricts to q=p/m on V×Z, so q is measurable on the valid-fibre set.

4.1step 2.2step 2.1step 3.2step 3.1∎

Steps 2.2, 2.1, 3.2, and 3.1 prove the marginal measurability, normalization, valid-fibre density, and integrable-exchange clauses.

LemmaStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

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 x of an open domain and the current direction p satisfies Df(x)[p]<0. If the line search starts at t=1, uses a factor β∈(0,1), and accepts when f(x+tp)≤f(x)+αt Df(x)[p] for a fixed α∈(0,1), it accepts after finitely many reductions. For the Newton branch, assume the current Hessian is symmetric positive definite.

Facts & Assumptions

Given: An open U⊆Rd, a Fréchet differentiable f:U→R, x∈U, α,β∈(0,1), and a direction p with Df(x)[p]<0; for the Newton branch, a symmetric positive-definite Hessian.

[F1]

Gradient descent: its backtracking branch uses p=−∇f(x), starts at t=1, multiplies rejected steps by β, and checks the Armijo inequality.

[F2]

Damped Newton method: its direction solves H(x)p=−∇f(x) using Cholesky when H(x) is symmetric positive definite, and its line search uses the same geometric backtracking rule.

[F5]

Bernoulli's inequality (1+x)n≥1+nx: (1+c)n≥1+nc for c≥0 and n∈N.

[F6]

Every complete ordered field is Archimedean: the natural numbers are cofinal in R.

Proof

1.1F1F2F3F4givenalgebra

By linearity of Df(x) and its values on the standard basis, Df(x)[p]=⟨∇f(x),p⟩. In the gradient branch, if ∇f(x)≠0, then Df(x)[−∇f(x)]=−∥∇f(x)∥2<0 by [F1]. In the Newton branch, write g=∇f(x) and Hp=−g. If g≠0, then p≠0 by [F4] and Df(x)[p]=gTp=−pTHp<0, since H is symmetric positive definite by [F2] and [F4].

1.2F3givenchoose

Set d:=−Df(x)[p]>0. Fréchet differentiability gives [f(x+tp)−f(x)]/t→−d as t↓0. Choose δ>0 small enough that x+tp∈U and this quotient is less than −d+(1−α)d/2=−(1+α)d/2≤−αd whenever 0<t<δ. Then every such trial satisfies the Armijo test.

1.3F5F6givenalgebra

The trials are tn=βn. Put c=β−1−1>0. By [F5], β−n=(1+c)n≥1+nc, hence tn≤(1+nc)−1. By [F6], for any δ>0 some n is large enough that (1+nc)−1<δ; thus tn→0.

2.1step 1.1step 1.2step 1.3∎

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.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Gradient descent rate under strong convexity and smoothness

Statement

Let f:Rd→R be continuously differentiable and have an attained minimum f∗=f(x∗). Say that f is L-smooth when ∥∇f(x)−∇f(y)∥≤L∥x−y∥ for all x,y, and μ-strongly convex when f(y)≥f(x)+⟨∇f(x),y−x⟩+μ2∥y−x∥2(x,y∈Rd). If 0<μ≤L and Gradient descent uses the fixed step 1/L, then the initial gap is unchanged at k=0, and for every generated iterate xk with integer k≥1, f(xk)−f∗≤(1−μL)k(f(x0)−f∗). For μ=L, the factor is zero only for the stated k≥1 range; no 00 convention is used.

Facts & Assumptions

Given: A continuously differentiable f:Rd→R with attained minimum f∗, a gradient Lipschitz constant L>0, a strong convexity constant 0<μ≤L, and iterates from Gradient descent with step 1/L.

[A1]

L-smooth means the displayed gradient Lipschitz bound in the Statement.

[A2]

μ-strong convexity means the displayed quadratic lower bound in the Statement.

[F1]

Gradient descent in fixed-step mode updates xk+1=xk−L−1∇f(xk) whenever it does not stop at xk.

[F2]

The real Frechet derivative on real and complex matrix spaces with the Frobenius norm: Df(x) 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, Df(x)[h]=⟨∇f(x),h⟩.

[F3]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): differentiating a composition with the line s↦x+sh composes the total derivative with h.

[F4]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous real function on a compact interval is Riemann integrable.

[F5]

Newton–Leibniz needs only continuity on [a,b], differentiability on (a,b), 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

1.1A1F2F3F4F5F6givenalgebra

Fix x and write g:=∇f(x) and d:=−g/L. Define ϕ(s):=f(x+sd) on [0,1]. By [F2]–[F3], ϕ′(s)=⟨∇f(x+sd),d⟩ on (0,1). The gradient is continuous by [A1], so ϕ′ is continuous and integrable by [F4]. Applying [F5] gives f(x−g/L)−f(x)=−1L∫01⟨∇f(x−sg/L),g⟩ ds. By [A1] and [F6], ∥∇f(x−sg/L)−g∥≤s∥g∥, whence ⟨∇f(x−sg/L),g⟩≥(1−s)∥g∥2. Integrating this bound gives f(x−g/L)≤f(x)−∥g∥22L.

1.2A2givenalgebra

By [A2], for every y, f(y)≥f(x)+⟨g,y−x⟩+μ2∥y−x∥2=f(x)−∥g∥22μ+μ2∥y−x+gμ∥2. Taking y=x∗ and using nonnegativity of the square yields ∥g∥2≥2μ(f(x)−f∗).

2.1F1step 1.1step 1.2algebra

Apply steps 1.1 and 1.2 at x=xk and use [F1]. Then f(xk+1)−f∗≤f(xk)−f∗−∥∇f(xk)∥22L≤(1−μL)(f(xk)−f∗). The factor is nonnegative because μ≤L.

3.1step 2.1givenalgebradischarge-induction∎

The k=0 case is equality. For k=1, the result is step 2.1 whenever x1 is generated. If xk+1 is generated, then xk was generated and the algorithm made the kth update; multiplying the bound at k by 1−μ/L≥0 and applying step 2.1 proves it at k+1. Induction along generated iterates gives the claim for every generated k≥1. If the stopping rule fires earlier, no later iterate is asserted.

TheoremStatement: Literature-sourcedProof: AI-adaptedjudge pass (gpt-6-luna)Open item page →

Newton's method has local quadratic convergence under a Lipschitz Hessian

Statement

Let d≥1, let U⊆Rd be open, and let f:U→R be C2. Use the Hessian convention of The Hessian matrix and critical points of a scalar field. Suppose x∗∈U is an interior critical point, H(x∗):=∇2f(x∗) is positive definite, and for some R>0, K≥0 the ball B(x∗,R) lies in U and ∥H(x)−H(y)∥op≤K∥x−y∥(x,y∈B(x∗,R)). Fix any Newton-decrement tolerance ε>0 and the Armijo parameters 0<α<1/2 and 0<β<1 in Damped Newton method. There are ρ>0 and C<∞ such that every generated iterate from a start x0∈B(x∗,ρ) remains in this ball. At each generated nonstationary iterate xk for which the algorithm's decrement test satisfies λk2/2>ε and a Newton update is therefore attempted, the line search accepts the full step tk=1 and ∥xk+1−x∗∥≤C∥xk−x∗∥2. If the decrement test stops the procedure, no next iterate or update bound is asserted at that point. Here λk2=∇f(xk)TH(xk)−1∇f(xk) 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 d, tolerance ε>0, and U,f,x∗,R,K,α,β as in the Statement. The operator norm is ∥A∥op:=sup⁡∥v∥=1∥Av∥.

[F1]

Damped Newton method: at a nonstationary point with positive-definite Hessian it computes p=−H(x)−1∇f(x) and λ2=∇f(x)TH(x)−1∇f(x); it stops before line search if λ2/2≤ε, and otherwise accepts t=1 whenever the Armijo inequality holds.

[F2]

The Hessian of a C2 scalar field is symmetric: the Hessian of a C2 real scalar field is symmetric.

[F5]

The chain rule for total derivatives: D(g∘f)(a)=Dg(f(a))∘Df(a): differentiating each gradient coordinate along a line composes its total derivative with the line direction.

[F6]

A continuous function on [a,b] is Riemann integrable, by Heine-Cantor and Riemann's criterion: a continuous real function on a compact interval is Riemann integrable.

[F7]

Newton–Leibniz needs only continuity on [a,b], differentiability on (a,b), 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.

[F8]

Multivariable Taylor formula with a Lagrange remainder along a line segment: for f∈C2 on a convex open set and a segment x+[0,1]p in it, the order-one Taylor formula has a second-order Hessian remainder at x+θp for some θ∈(0,1).

[F9]

The Hessian matrix and critical points of a scalar field: Hf(x) is the matrix of second partial derivatives, and a critical point has ∇f(x)=0.

Proof

1.1F2F3F4F9F10givenchoosealgebra

By [F2]–[F3], H(x∗) has an orthonormal eigenbasis with positive eigenvalues. Let λ>0 be its smallest eigenvalue. Choose r<R/2 with Kr≤λ/2. For ∥x−x∗∥≤r and any vector v, vTH(x)v≥vTH(x∗)v−∥H(x)−H(x∗)∥op∥v∥2≥λ2∥v∥2. Thus H(x) is positive definite there and [F4] makes each Newton solve well-defined.

2.1F5F6F7F9F10F11givenstep 1.1algebra

Put M0:=∥H(x∗)∥op+Kr, M:=d M0, and m:=λ/2. Along the segment x∗+te, where e=x−x∗ and ∥e∥≤r, apply [F5] to each coordinate of the gradient map t↦∇f(x∗+te). Its derivative is the corresponding coordinate of H(x∗+te)e; the integrand is continuous and hence integrable by [F6]. Newton–Leibniz [F7] and ∇f(x∗)=0 give ∇f(x)=∫01H(x∗+te)e dt. For every t∈[0,1], ∥H(x∗+te)∥op≤M0, so each coordinate of H(x∗+te)e is bounded in absolute value by M0∥e∥. Apply [F11] to each coordinate integral; this gives ∣∇f(x)i∣≤M0∥e∥ and hence ∥∇f(x)∥≤M∥e∥. Each coordinate of (H(x)−H(x∗+te))e is bounded in absolute value by K(1−t)∥e∥2, using the operator-norm Lipschitz bound and [F10]. Applying [F11] to these coordinate integrals gives ∥H(x)e−∇f(x)∥≤d K2∥e∥2.

3.1F1F3F9step 1.1step 2.1algebra

Let p=−H(x)−1∇f(x) be the Newton direction and e+:=x+p−x∗. Since e+=H(x)−1(H(x)e−∇f(x)) and ∥H(x)−1∥op≤1/m=2/λ by step 1.1 and the orthonormal eigenbasis in [F3], step 2.1 gives ∥e+∥≤C∥e∥2,C:=d K/λ. Also ∥p∥≤D∥e∥ with D:=M/m=2M/λ, because ∥p∥≤m−1∥∇f(x)∥.

4.1givenstep 3.1choosealgebra

Choose ρ≤r/(1+D) and, if K>0, also choose Dρ≤(1/2−α)λ/K; decrease ρ further so Cρ≤1/2. For x∈B(x∗,ρ) the segment from x to x+p lies in B(x∗,r). If ∇f(x)=0, step 3.1 gives ∥e∥≤C∥e∥2, so the choice Cρ≤1/2 forces e=0.

5.1F1F2F8F10step 1.1step 4.1algebra

Whenever a nonzero Newton direction is sent to line search, apply [F8] with k=1 on the segment x+[0,1]p. For some θ∈(0,1), f(x+p)=f(x)+⟨∇f(x),p⟩+12pTH(x+θp)p. Write A:=pTH(x)p≥m∥p∥2 by step 1.1. Since ∇f(x)=−H(x)p and H is K-Lipschitz, f(x+p)−f(x)−α⟨∇f(x),p⟩≤−(1/2−α)A+K2∥p∥3≤0 by the choice of ρ in step 4.1. If K=0, the same inequality holds with its cubic term zero. Therefore the full step passes the Armijo test and [F1] accepts t=1. This is conditional on the decrement test not stopping before line search.

6.1step 1.1step 3.1step 4.1step 5.1givendischarge-induction∎

At any generated iterate in B(x∗,ρ), 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 ∥e+∥≤Cρ∥e∥≤∥e∥/2, so the next generated iterate remains in the ball. If an iterate is stationary, step 4.1 shows it is x∗. 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.

Sources