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.
An adjoint-range feature has an exact one-probe estimator
Example
Assume Countable Choice. Let with the Euclidean inner product, let , fix , and let be a jointly Gaussian centered family on , linear into with covariance . Define and consider the feature . The map is compact, , and the observation is an unbiased exact estimator of with variance . Thus the feature vector lies in the adjoint range and is exactly estimable by one probe.
Example references
Facts & Assumptions
Given: The finite-dimensional inverse model and feature in the Example, with .
A feature is exactly estimable by one probe precisely when . Exact linear feature estimability through the adjoint range
In a compact inverse model, the parameter and data spaces are Hilbert spaces and the forward map is compact and linear. Compact linear inverse model between Hilbert spaces
Every bounded finite-rank operator is compact. Bounded finite rank operators are compact
Proof
The matrix of in the standard basis is , so its range is two-dimensional and it is bounded. It is compact by [F3], hence it satisfies the compact inverse-model hypothesis [F2]. The matrix is self-adjoint, so and , the Riesz vector of .
The isonormal model gives and . Since [F1] applies to the feature vector , this probe is exact and has the asserted finite variance.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
19 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
- Kretschmann and Werner, Maximum a posteriori testing in statistical inverse problems, §1.1 (standard reference, not scraped)
- Giné and Nickl, Mathematical Foundations of Infinite-Dimensional Statistical Models, §1.2.2 (standard reference, not scraped)