Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-generatedPipeline-generatedprecheck passverified 2026-10-22 (gpt-6.1-sol)
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.

Exact finite-MLE criterion for a minimal finite exponential Gibbs family

Statement

Use the finite exponential family, minimality, convex hull, affine hull, and relative-interior definitions from the A-page finite-family Definition. Assume the representation is minimal. The sample space is Xn with product mass ∏i=1nπθ(xi), which is the IID sampling model; n≥1. For a realized tuple x1,…,xn∈X, set Tˉ=n−1∑i=1nT(xi) and K=conv⁡(T(X)). A finite MLE is a parameter θ^∈Rk attaining the maximum of that likelihood. Then a finite MLE exists if and only if Tˉ∈ri⁡K, and when it exists it is unique.

Facts & Assumptions

Given: The finite family, minimality, n≥1, and the realized IID sample in the Statement.

[A1]

The sampling model is IID with mass function πθ; the likelihood of the realized sample is ∏i=1nπθ(xi).

[F1]

Finite exponential Gibbs family for inverse inference: πθ(x)=w(x)eθ⋅T(x)−A(θ) with w(x)>0; its proof verifies 0<Z(θ)<∞, normalization and full support, and K is the finite convex hull of T(X).

[F2]

Identifiability and covariance in a finite exponential Gibbs family: for a minimal family, ∇2A(θ) is positive definite for every finite θ, and the affine hull of T(X) is Rk.

[F3]

Dominated exponential normalization and covariance: for the finite family, A∈C2(Rk), ∇A(θ)=EπθT, and ∇2A(θ)=Cov⁡πθ(T); its compact-envelope hypothesis is verified in the finite-family Definition.

[F4]

Supporting direction at a boundary point of a finite full-dimensional polytope: if Tˉ is a boundary point of the full-dimensional finite convex hull K, a unit vector u satisfies u⋅(T(x)−Tˉ)≤0 for every x∈X.

[F5]

A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: a continuous real-valued function on a nonempty compact metric space attains its minimum.

[F6]

For n≥1, every Euclidean closed ball and every Euclidean sphere of positive radius is compact: every Euclidean closed ball in Rk of positive radius is compact.

[F7]

The natural logarithm as the inverse of the exponential function: log⁡ is the inverse of exp⁡ on (0,∞), so log⁡(exp⁡t)=t for every real t.

[F8]

Order, continuity, range, and the product, quotient, and reciprocal laws for the natural logarithm: log⁡ is strictly increasing on (0,∞) and satisfies log⁡(ab)=log⁡a+log⁡b for positive reals a,b.

[F9]

The mean value theorem, as the case g(x)=x of Cauchy's: for f continuous on [a,b] with a<b and differentiable on (a,b) there is c∈(a,b) with f(b)−f(a)=f′(c)(b−a): if a real function is continuous on a closed interval and differentiable on its interior, then its derivative equals the interval's average rate of change at some interior point.

[F10]

Cauchy-Schwarz ∣⟨x,y⟩∣≤∥x∥2∥y∥2 with its equality case, the triangle inequality for ∥⋅∥2, the parallelogram law and polarisation: the Euclidean norm is a norm, with positive definiteness and absolute homogeneity; in particular ∥θ∥2>0 for θ≠0 and ∥θ/r∥2=∥θ∥2/r for r>0.

[F11]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: ∥u∥2=u⋅u, so ∥u∥2=1 implies u⋅u=1.

[F12]

For a convex set C, a function f:C→R is strictly concave when f((1−t)θ+tφ)>(1−t)f(θ)+tf(φ) for every distinct θ,φ∈C and every t∈(0,1).

Proof

Given: The IID model and realized finite sample in the Statement.

1.1givenA1F1F7F8algebra

Since every πθ(xi)>0, the likelihood is positive. Repeated application of the logarithm product law [F8], followed by log⁡(exp⁡t)=t [F7], gives the log likelihood ℓ(θ)=log⁡∏i=1nπθ(xi)=∑i=1nlog⁡w(xi)+n(θ⋅Tˉ−A(θ)). Because log⁡ is strictly increasing [F8], maximizing this log likelihood is equivalent to maximizing the likelihood. Also Tˉ is the convex combination with weights 1/n of T(xi), so Tˉ∈K.

1.2givenF1F2F7F8F10F11F13algebra

Suppose Tˉ∈ri⁡K. Minimality makes K full-dimensional, so there is ϵ>0 such that the open ball of radius ϵ about Tˉ lies in K; set δ=ϵ/2, so the closed ball of radius δ lies in that open ball and hence in K. For every unit u, Tˉ+δu is a convex combination of the vectors T(x); since u⋅u=1 by [F11], at least one x satisfies u⋅(T(x)−Tˉ)≥δ. Put wmin⁡=min⁡x∈Xw(x)>0. If θ≠0, write r=∥θ∥2 and u=θ/r; [F10] gives r>0 and ∥u∥2=1. For some x as above, θ⋅(T(x)−Tˉ)≥rδ. Since the xth summand is part of Z(θ) and is positive by [F13], monotonicity and the product law of log⁡ [F8], together with [F7], give A(θ)=log⁡Z(θ)≥log⁡(wmin⁡eθ⋅T(x))=log⁡wmin⁡+θ⋅T(x), and hence A(θ)−θ⋅Tˉ≥rδ+log⁡wmin⁡. Thus θ↦A(θ)−θ⋅Tˉ tends to +∞ as ∥θ∥2→∞.

2.1F2F3F9F12step 1.1algebra

Let θ≠φ and put v=φ−θ and g(s)=ℓ(θ+sv) for s∈[0,1]. By A∈C2 [F3], g is twice continuously differentiable; by [F2] its second derivative is g′′(s)=−n vT∇2A(θ+sv)v<0. Thus g′ is strictly decreasing: for 0≤a<b≤1, the mean value theorem [F9] applied to g′ gives g′(b)−g′(a)=g′′(c)(b−a)<0 for some c∈(a,b). Fix t∈(0,1). Applying [F9] to g on [0,t] and [t,1] gives α∈(0,t) and β∈(t,1) such that g(t)−g(0)t=g′(α)>g′(β)=g(1)−g(t)1−t. Rearranging yields g(t)>(1−t)g(0)+tg(1). By [F12], ℓ is strictly concave on Rk.

3.1F3F5F6F10step 1.1step 2.1step 1.2algebra

The function Φ(θ):=A(θ)−θ⋅Tˉ is continuous: A is continuous by [F3], and the linear form is continuous by the Cauchy–Schwarz bound [F10]. It tends to +∞ by step 1.2. Choose R>0 large enough that Φ(θ)>Φ(0) whenever ∥θ∥2>R. The closed ball B‾2(0,R) is nonempty and compact by [F6], so [F5] gives a minimizer θ^ on it. Since 0 lies in the ball and every point outside has value greater than Φ(0), θ^ is a global minimizer on Rk. The log-likelihood formula in step 1.1 and n≥1 show that it is a finite MLE. If two distinct finite MLEs existed, their midpoint would have a strictly larger log likelihood by step 2.1, a contradiction; hence it is unique.

4.1givenA1F1F2F3F4F8step 1.1algebra∎

Suppose Tˉ∉ri⁡K. Since Tˉ∈K by step 1.1 and K is full-dimensional, Tˉ is a boundary point. By [F4] choose a unit u with u⋅(T(x)−Tˉ)≤0 for every x. Full affine span implies at least one of these inequalities is strict; otherwise u⋅T would be constant on X. Every πθ(x) is positive, so u⋅(∇A(θ)−Tˉ)=∑xπθ(x)u⋅(T(x)−Tˉ)<0 for every finite θ. Therefore the directional derivative of ℓ along u is n u⋅(Tˉ−∇A(θ))>0 at every finite θ. By the definition of a positive derivative, a sufficiently small positive step along u increases ℓ, and therefore increases the likelihood by [F8]. No finite MLE exists. This proves both directions.

Remarks

This is an exact finite IID model statement. It does not assert that a finite dataset is typical, that an estimator is consistent or concentrated, or that any algorithm computes the MLE. No MCMC output is treated as IID data; a dependent-chain analysis would require its own finite-state Markov-chain central limit theorem and autocorrelation-aware variance conditions, which are not used here.

Depends on

Dependency tree · 2 levels

Sources