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.
Learned reconstruction targets and risk — Examples and Counterexamples
1 · Prerequisites
- Absolute and Conditional Convergence; Rearrangement; Products
- Bayesian models, priors, and posterior laws
- Binary Operations, Monoids, Groups and Subgroups
- Bounded Linear Operators and Quotient Spaces
- Compactness in Metric Spaces
- Complete Metrizability, Čech-Completeness, and Baire Category
- Completeness, Completion, and Uniform Continuity
- Complex Norms and Realification
- Complexification, Realification and Real Structures
- Conditional Distributions and Regular Conditional Probability
- Conditional Expectation
- Construction of the Natural Numbers
- Construction of the Real Numbers via Cauchy Sequences
- Construction of the Real Numbers via Dedekind Cuts
- Continuity, IVT, EVT, and Uniform Continuity
- Convergence: Nets and Filters
- Convexity
- Cosets, Index and Lagrange's Theorem
- Countability and Uncountability
- Countability Axioms and Cardinal Functions
- Darboux, L'Hôpital, and Taylor's Theorem
- Divisibility, Euclidean Domains, Principal Ideal Domains and Unique Factorisation
- Domination and Likelihood Ratios
- Dual Spaces, Bilinear and Quadratic Forms, and Sylvester's Law of Inertia
- Estimators and Randomized Procedures
- Filters and Ultrafilters
- Finite Counting, Factorials and Binomial Coefficients
- Foundations of the Real Numbers for Analysis
- Function-space priors and sample regularity
- Hilbert Space Geometry and Riesz Representation
- Ideals, Quotient Rings and the Isomorphism Theorems for Rings
- Infinite Product Measures and Kolmogorov Extension
- Inner Product Spaces, Gram-Schmidt, Projections and Adjoints
- Inverse maps, identifiability, and stability
- Learned reconstruction targets and risk
- Lebesgue-Stieltjes Measures and Distribution Functions
- Likelihood potentials and posterior propriety
- Limits of Real Functions
- limsup, liminf, and Subsequential Limits
- Linear Independence, Bases and Dimension
- Linear Transformations, Rank-Nullity and Quotient Spaces
- Loss, Risk and Decision Theory
- Matrices, the Matrix of a Linear Map, and Change of Basis
- Measurable Functions and Simple Approximation
- Measures and Their Basic Properties
- Metric Spaces
- Modes of Convergence Egorov and Lusin
- Monotone Functions, Discontinuities, and Continuity Sets
- Monotone Sequences, Bolzano-Weierstrass, and Cauchy Completeness
- Normal Subgroups and Quotient Groups
- Normed and Banach Spaces
- Norming and Separation under Hahn–Banach
- Order, Zorn's Lemma, and the Axiom of Choice
- Orthonormal Bases, Parseval and Fourier Series
- Outer Measure and the Caratheodory Extension Theorem
- Polynomial Rings, the Division Algorithm and Roots
- Posterior Prediction, Credible Sets, and Bayes Actions
- Posterior propriety and dominated Bayes formula
- Power Series and Real-Analytic Functions
- Probability Spaces Random Variables and Expectation
- Product Measures and the Fubini Tonelli Theorems
- Properties of the Integral and the Working FTC
- Relations, Functions, and Quotients
- Rings, Subrings, Integral Domains and Fields
- Rⁿ as a Normed Space; Vector-Valued Functions
- Roots, Rational Powers, and Classical Inequalities
- Separation Axioms: the Hierarchy
- Sequences and Limits
- Sequences and Series of Functions; Uniform Convergence
- Series: Convergence and the Nonnegative Tests
- Sigma Algebras and Borel Sets
- Signed and Complex Measures Hahn and Jordan
- Simple Field Extensions and the Construction of the Complex Numbers
- Standard-Borel Real Codings and Determining Classes
- Statistical Experiments, Models and Identifiability
- Subspaces, Products, and Quotients
- Suprema and Infima
- The Analytic Hahn Banach Theorem
- The Cantor Set, Baire Category, and Measure Zero in ℝ
- The Complex Exponential and Euler's Formula
- The Derivative and the Mean Value Theorems
- The Exponential Function
- The Lebesgue Integral and the Convergence Theorems
- The Logarithm and General Powers
- The Lᵖ Spaces Holder Minkowski and Riesz Fischer
- The Radon Nikodym Theorem and Lebesgue Decomposition
- The Riemann Integral: Definition and Integrability
- The Topology of Euclidean Space
- The ZFC Axioms and the Basic Set Constructions
- Topological Spaces and Continuity
- Topology of ℝ
- Triangularisation, Generalised Eigenspaces and Jordan Canonical Form
- Vector Spaces, Linear Subspaces, Span and Direct Sums
- Weak Convergence Tightness and Representation
2 · Logical flowchart
3 · Definitions, theorems and proofs
None yet.
4 · Examples, counterexamples and false statements
A posterior mean can lie outside a nonconvex signal class
Example
Assume the Axiom of Choice. Let the admissible signal set be , which is nonconvex because it omits the midpoint , let the target be the signal itself, and let the data space consist of one point . Use the constant forward map and the prior assigning probability to each signal. The posterior law at the sole datum is therefore . Under squared loss on the full action space , the posterior mean is , which is outside ; its posterior risk at action is , so its unique unconstrained minimum is at . If actions are restricted to , both admissible actions have risk . The proposition concerns the full Hilbert action space and does not assert that the posterior mean is an admissible signal.
Example references
Facts & Assumptions
Given: AC, the two-point signal set, constant observation, equal prior weights, and squared loss.
The Axiom of Choice is assumed by the general posterior-mean proposition. The Axiom of Choice
A conditional law is a probability kernel satisfying the conditional-event integral identities. Conditional law given a random element
In a real Hilbert target with finite second moment, the posterior mean uniquely minimizes posterior squared risk over the full target space. The posterior mean is the unique squared-loss Bayes action in a Hilbert target
Reconstruction risk is the expected target-action loss under the specified joint law. Inverse reconstruction risk under train and test laws
Verification
Since almost surely, the constant kernel satisfies the conditional-law identity both for the empty event and for the whole sample space; hence it is a posterior version for the stated joint law.
Direct integration gives . Since , this posterior mean is not an admissible signal, and is nonconvex because it omits the midpoint of its two elements.
For every , . The unique minimizer over is ; on the restricted set , both values have risk . This also agrees with the full-space proposition [F2], whose AC hypothesis is stated in the Example, while the restricted-action calculation is separate.
A train/test prior shift changes reconstruction risk
Example
Let the truth space and target space both be , let the target map be the identity, let the data space be , and let the deterministic forward map be for both truths. Use squared loss and the point reconstruction rule . Let the training prior be and the test prior be . The resulting joint laws of data and target are and . The input marginal is the same in both laws, but and ; equality of input marginals alone does not bound target-risk change under prior shift.
Example references
Facts & Assumptions
Given: The finite truth and data spaces, the constant forward map, the two prior laws, squared loss, and the rule in the Example.
An inverse-problem model specifies a forward map on an admissible truth class and a target map into a metric target space. Inverse-problem models and solution classes
A point reconstruction rule is a measurable data-to-target map. Learned inverse estimators and reconstruction targets
Under a joint data-target law, risk is the integral of the nonnegative loss evaluated at the target and rule output. Inverse reconstruction risk under train and test laws
Verification
Under either prior, the deterministic observation is , so the training and test data marginals are both . The target equals almost surely under and equals almost surely under .
The rule is measurable on the one-point data space and takes values in , so it is a point reconstruction rule.
By [F3], and . Therefore the risk changes from zero to one while the input marginal remains fixed; no risk comparison follows from that marginal agreement alone.
An exact posterior sample need not minimize point risk
Example
Assume the Axiom of Choice. Let take values and with equal probabilities, let deterministically, and use the squared-error loss on . The posterior is . Given , draw independently of from . Here exact posterior calibration means , which holds because the sampler kernel is . The posterior mean action has posterior risk , while the expected squared error between the true posterior draw and the independent posterior sample is . Thus even an exactly calibrated posterior sample is not the Bayes-optimal point action and is not itself the posterior mean.
Example references
Facts & Assumptions
Given: AC; the symmetric two-point target law; the deterministic one-point data value; the posterior sampling kernel; and squared-error loss.
The Axiom of Choice is assumed by the general posterior-mean proposition. The Axiom of Choice
A conditional law is a probability kernel satisfying the conditional-event integral identities; values at marginal-null data remain version choices. Conditional law given a random element
A posterior sampler is a kernel from data to target space, and it is exact when its law equals the posterior kernel. Learned inverse estimators and reconstruction targets
The posterior mean uniquely minimizes squared posterior risk over the full real Hilbert target. The posterior mean is the unique squared-loss Bayes action in a Hilbert target
A randomized reconstruction rule's risk averages its loss over the joint target-data law and its output kernel. Inverse reconstruction risk under train and test laws
Verification
Because with probability one, the constant kernel satisfies the conditional-law identity for the empty event and the whole sample space, so it is a posterior version.
The sampler kernel is , hence and exact posterior calibration holds by [F2]. Its mean is .
Under posterior risk, the action has loss expectation . By [F3], whose AC hypothesis is stated in the Example, it is the unique Bayes point action.
Conditional independence gives probability to equal draws, with squared difference , and probability to unequal draws, with squared difference . Therefore , which is the randomized rule risk under [F4].
The exact posterior sample has conditional law , but its random squared-error risk exceeds the posterior mean action's risk ; therefore posterior calibration of a sample does not make the sample the point Bayes action.