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.
Discrete, continuous, and mixed distribution functions
Example
Assume the Axiom of Countable Choice (The Axiom of Countable Choice ()).
Three standard distribution functions illustrate three different atom patterns:
The first law is purely atomic, the second has no atoms on , and the third is mixed: it has an atom at and a continuous part on .
Facts & Assumptions
Given: The Axiom of Countable Choice and the three displayed functions.
Assuming the Axiom of Countable Choice, distribution functions determine probability laws (Probability laws correspond to distribution functions).
Atoms are positive point masses of the law, while continuity points are points where the distribution function is continuous (Atoms and continuity points of a law).
Verification
Each displayed function is nondecreasing, right-continuous, tends to at , and tends to at . Therefore [L1] gives a probability law for each of them.
The jumps identify the atoms. For , the jumps are at and at , so the law is purely discrete. For there are no jumps, hence no atoms. For there is a jump of size at and no jump on , so the law is mixed.
Thus the three distribution functions realize discrete, continuous, and mixed behavior without any implication that a density must exist in general.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
17 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
- J. R. Norris, Probability and Measure, Section 2.3 (standard reference, not scraped)