Alphabeta Math
LemmaStatement: AI-adaptedProof: AI-generatedPipeline-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.

The Gaussian profile likelihood reduces to the trace score

Statement

Assume AC. Let N,p≥1, let x1,…,xN∈Rp be independent observations with common law Np(μ,Σ), where Σ is real symmetric positive definite; put Θ=Σ−1, xˉ=N−1∑r=1Nxr, and S=N−1∑r=1N(xr−xˉ)(xr−xˉ)T. The log-likelihood maximized over μ is −Np2log⁡(2π)+N2(log⁡det⁡Θ−tr⁡(SΘ)). Thus, after removing the additive constant and multiplying by 2/N, the normalized Gaussian profile-likelihood score is log⁡det⁡Θ−tr⁡(SΘ).

Facts & Assumptions

Given: AC, observations x1,…,xN∈Rp, an iid model Np(μ,Σ) with Σ positive definite, and Θ=Σ−1.

[F1]

For the data, xˉ=N−1∑rxr and S=N−1∑r(xr−xˉ)(xr−xˉ)T; the score is defined on symmetric positive-definite Θ. Gaussian sparse-precision objective with the all-entry penalty.

[F2]

A positive-definite multivariate normal law has density (2π)−p/2det⁡(Σ)−1/2exp⁡(−12(x−μ)TΣ−1(x−μ)). A positive-definite multivariate normal law has its Gaussian density.

[F3]

The law Np(μ,Σ) is the multivariate normal law with the given mean and covariance. Multivariate normal law, including singular covariance.

[F4]

A probability kernel has probability-measure sections and measurable evaluations; a constant probability law on a singleton source is a probability kernel. Measure kernel and probability kernel.

[F5]

A finite product of dominated probability kernels has the product density relative to the product reference measure. Finite products of dominated kernels have the product density.

[F6]

Independent random elements have joint law equal to the finite product of their marginal laws. Independent random elements have product joint law.

[A1]

AC is an explicit hypothesis of the cited multivariate-normal density supplier; here AC means every family of nonempty sets has a choice function. A positive-definite multivariate normal law has its Gaussian density The Axiom of Choice.

Proof

1.1givenA1F2F3F4F5F6

Each independent observation with the common law in [F3] has the density in [F2]. On the one-point source {∗}, the constant law Kr(∗,⋅)=Np(μ,Σ) is a probability kernel: its sections are probability measures and each evaluation map is constant, hence measurable [F4]. The density fr(∗,x)=fμ,Θ(x) is continuous in x and constant in ∗, hence jointly measurable; [F5] gives the product law density ∏r=1Nfμ,Θ(xr). By [F6], independence identifies this product law with the joint observation law. Its log-likelihood for fixed μ and Θ is L(μ,Θ)=−Np2log⁡(2π)+N2log⁡det⁡Θ−12∑r=1N(xr−μ)TΘ(xr−μ).

2.1givenF1step 1.1algebra

Write yr=xr−xˉ, so ∑ryr=0 and xr−μ=yr+(xˉ−μ). Expanding and summing removes the cross term: ∑r=1N(xr−μ)TΘ(xr−μ)=∑r=1NyrTΘyr+N(μ−xˉ)TΘ(μ−xˉ).

3.1givenstep 2.1algebra

Positive definiteness of Θ makes the last quadratic term nonnegative and equal to zero exactly at μ=xˉ. Therefore xˉ uniquely maximizes L(μ,Θ) over μ.

4.1F1step 1.1step 2.1step 3.1algebra∎

By [F1], ∑ryryrT=NS. Cyclicity of the finite matrix trace gives ∑ryrTΘyr=∑rtr⁡(ΘyryrT)=Ntr⁡(SΘ). Substituting this identity and μ=xˉ into step 1.1 yields the displayed profile log-likelihood and its normalization.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

41 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