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.
Squared-error risk for a Bernoulli observation
Example
Observe one Bernoulli variable with parameter , so and . Estimate by the rule under squared-error loss . Its risk is which is zero at both endpoints and has maximum at .
Facts & Assumptions
Given: The finite Bernoulli model, estimator, squared-error loss, and risk definition in the Example.
A probability measure is a measure with total mass one (Probability measures and probability spaces).
A statistic or estimator is a measurable data map to its target (Statistics and estimators).
Risk is the integral of loss under the sampling law (Loss functions and risk).
On a finite probability space, expectation is the probability-weighted sum (Expectation agrees with the published finite weighted sum).
Verification
For each , define for . Its singleton masses are nonnegative and sum to one; any disjoint sequence of subsets has at most two nonempty terms, and their masses add to the union mass. Thus is a probability measure by [F1]. The identity rule is measurable on the finite full-power-set spaces and estimates the target by [F2].
The finite expectation formula [F4] and risk definition [F3] give .
Since , the risk is at most , with equality at ; substitution gives risk zero at and .
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
18 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.