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.
Homogeneous Poisson rate estimation at positive-count and zero-count boundaries
Example
Take , so , and fit the homogeneous model . For an observation with three points, the likelihood is maximized at . For an empty observation the likelihood increases as decreases to zero; the boundary value is attained only when is included in the parameter space.
Facts & Assumptions
Given: , , homogeneous rate , and the two observed counts and .
For , a positive observed count has unique MLE ; at zero count the supremum is the rate-zero boundary and is attained exactly when zero is admitted. (Homogeneous Poisson rate MLE in a positive-volume window)
Verification
Given: , , homogeneous rate , and the two observed counts and .
[F1] For , a positive observed count has unique MLE ; at zero count the supremum is the rate-zero boundary and is attained exactly when zero is admitted. (Homogeneous Poisson rate MLE in a positive-volume window)
For , [F1] gives . The log likelihood up to a constant is , and the proposition proves this rate is the unique maximizer.
For , that log likelihood reduces to for ; it tends to as and is strictly smaller at every positive rate. The normalized likelihood at is positive for the empty configuration, so the maximum is attained at zero if the parameter space contains zero, while on only the boundary supremum exists.
Depends on
Used by
Nothing in the library uses this result yet.
Dependency tree · two levels
24 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
- Adrian Baddeley, Spatial Point Processes and their Applications, complete lecture notes (standard reference, not scraped)
- Günter Last and Mathew Penrose, Lectures on the Poisson Process, author-hosted 2017 version (standard reference, not scraped)