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.

Uniform information errors control approximate D-optimal design gaps

Statement

Let X be a finite candidate set and let Ξ be a nonempty compact metric space of approximate designs on X. For each x, let Jx and Jh,x be exact and computed sensitivities and let Wx be symmetric positive definite. Suppose uniformly over x∈X that ∥Jx∥2≤K, ∥Jh,x−Jx∥2≤η, and ∥Wx∥2≤w, where K,η,w≥0. Put δ=w(2Kη+η2). Suppose the criteria Φ(ξ)=log⁡det⁡M(ξ) and Φh(ξ)=log⁡det⁡Mh(ξ) are continuous on Ξ, and for some α>0 every matrix on every segment between M(ξ) and Mh(ξ) satisfies vTAv≥α∥v∥22. If ξ∗ maximizes Φ and ξ^ is a τ-approximate maximizer of Φh, meaning Φh(ξ^)≥max⁡ξ∈ΞΦh(ξ)−τ with τ≥0, then Φ(ξ∗)−Φ(ξ^)≤τ+2pδα.

Facts & Assumptions

Given: The compact design set, exact/computed sensitivity matrices, precision matrices, uniform bounds, information-matrix eigenvalue floor, and τ-approximate computed maximizer in the Statement.

[F1]

Finite nonlinear observation designs, local identifiability, and weighted information defines M(ξ)=∑xξxJxTWxJx for approximate design weights; Computed Jacobian error controls the weighted information-matrix error defines the computed matrix Mh(ξ)=∑xξxJh,xTWxJh,x.

[F2]

Computed Jacobian error controls the weighted information-matrix error: the uniform sensitivity and weight bounds imply ∥Mh(ξ)−M(ξ)∥2≤δ for each ξ.

[F3]

A uniform positive eigenvalue floor controls log-determinant error: if the segment eigenvalue floor is α, then ∣Φh(ξ)−Φ(ξ)∣≤pδ/α.

[F4]

A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value: each continuous real-valued criterion on the nonempty compact metric space Ξ attains its maximum.

Proof

technique · direct
1.1givenF1F2F3F4construct

For each ξ∈Ξ, [F1] defines the two information matrices and [F2] gives ∥Mh(ξ)−M(ξ)∥2≤δ. Applying [F3] on their segment gives the uniform bound ∣Φh(ξ)−Φ(ξ)∣≤e:=pδ/α. By [F4], both maxima are attained; write ξh for a computed maximizer.

2.1givenstep 1.1algebra∎

The τ-approximate maximality of ξ^ gives Φh(ξh)−Φh(ξ^)≤τ. Write Φ(ξ∗)−Φ(ξ^)=[Φ(ξ∗)−Φh(ξ∗)]+[Φh(ξ∗)−Φh(ξ^)]+[Φh(ξ^)−Φ(ξ^)]. The middle term is at most τ because ξh maximizes Φh, and the first and last terms are at most e by step 1.1. Thus the gap is at most e+τ+e=τ+2pδ/α, proving the bound.

Depends on

Used by

Dependency tree · two levels

46 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