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 be a finite candidate set and let be a nonempty compact metric space of approximate designs on . For each , let and be exact and computed sensitivities and let be symmetric positive definite. Suppose uniformly over that , , and , where . Put . Suppose the criteria and are continuous on , and for some every matrix on every segment between and satisfies . If maximizes and is a -approximate maximizer of , meaning with , then
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.
Finite nonlinear observation designs, local identifiability, and weighted information defines for approximate design weights; Computed Jacobian error controls the weighted information-matrix error defines the computed matrix .
Computed Jacobian error controls the weighted information-matrix error: the uniform sensitivity and weight bounds imply for each .
A uniform positive eigenvalue floor controls log-determinant error: if the segment eigenvalue floor is , then .
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
For each , [F1] defines the two information matrices and [F2] gives . Applying [F3] on their segment gives the uniform bound . By [F4], both maxima are attained; write for a computed maximizer.
The -approximate maximality of gives . Write . The middle term is at most because maximizes , and the first and last terms are at most by step 1.1. Thus the gap is at most , proving the bound.
Depends on
- Finite nonlinear observation designs, local identifiability, and weighted information
- Computed Jacobian error controls the weighted information-matrix error
- A uniform positive eigenvalue floor controls log-determinant error
- A continuous real-valued function on a nonempty compact metric space is bounded and attains a greatest and a least value
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
- Stephen Boyd and Lieven Vandenberghe, Convex Optimization, §7.5 (standard reference, not scraped)
- Leah R. McLean et al., Estimability Analysis and Optimal Design in Dynamic Multi-scale Models of Cardiac Electrophysiology, §2.3 (standard reference, not scraped)