Alphabeta Math
TheoremStatement: AI-adaptedProof: AI-adaptedPipeline-generatedprecheck passjudge 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 weighted information matrix is positive definite exactly at full sensitivity rank

Statement

For the finite nonlinear observation design of Finite nonlinear observation designs, local identifiability, and weighted information, fix θ∈Θ and an approximate design ξ. The matrix Mθ(ξ) is positive definite, meaning symmetric with vTMθ(ξ)v>0 for every nonzero v∈Rp, if and only if the stacked support sensitivity Jacobian Jξ(θ) has trivial kernel, equivalently full column rank.

Facts & Assumptions

Given: The objects and hypotheses of Finite nonlinear observation designs, local identifiability, and weighted information, at a fixed θ and design ξ.

[F1]

Finite nonlinear observation designs, local identifiability, and weighted information: Mθ(ξ)=∑xξxJx(θ)TWxJx(θ), each support weight is positive, and each Wx is symmetric positive definite.

[F2]

Rectangular matrix multiplication and the identity matrix In, including zero-sized shapes: for compatible real matrices and vectors, products associate and (Jxv)TWx(Jxv)=vTJxTWxJxv by the coordinate product rule.

[F3]

The Euclidean inner product ⟨x,y⟩=∑k<nxkyk on Rn: ∥z∥22=zTz. The strict positivity of zTWxz for nonzero z follows from the positive-definiteness hypothesis on Wx in [F1].

Proof

technique · direct
1.1F1F2F3givenalgebra

For any v∈Rp, [F1] and [F2] give vTMθ(ξ)v=∑x∈supp⁡(ξ)ξx(Jx(θ)v)TWx(Jx(θ)v). Every term is nonnegative by [F3], and a term is strictly positive exactly when Jx(θ)v≠0, since ξx>0 on the support and Wx is positive definite.

2.1step 1.1algebra∎

If Jξ(θ)v=0, every support component Jx(θ)v is zero, so step 1.1 gives vTMθ(ξ)v=0. Conversely, if vTMθ(ξ)v=0, the finite sum of nonnegative terms in step 1.1 can vanish only if every support component Jx(θ)v=0, hence Jξ(θ)v=0. Thus the quadratic form is positive on every nonzero v exactly when ker⁡Jξ(θ)={0}, as claimed.

Depends on

Used by

Dependency tree · two levels

21 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