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.
A finite mixture latent factorization
Example
Let the parameter space be a singleton, let have sigma-finite reference measure , and let the finite latent label set be with counting measure. Choose weights with and probability densities with respect to . Set Then the observed marginal density is , and on each positive finite fibre the conditional label probabilities are .
Facts & Assumptions
Given: A finite integer , positive weights summing to one, nonnegative measurable component densities with , and the singleton parameter space.
Latent-variable joint and observed-data factorization: the complete-data density is jointly measurable and integrates to one on each parameter fibre; an observed marginal is obtained by integrating over the latent reference measure.
The observed density is the latent marginal under Tonelli: the observed marginal is a density, and division by a positive finite marginal normalizes the latent fibre.
Verification
The map is nonnegative and product measurable. With counting measure on the finite label set, It is therefore a complete-data probability density of the type in [F1].
Integrating over the label coordinate gives . For , the conditional label mass is and its finite sum is
The joint density, its observed marginal, and its normalized positive finite fibres therefore have exactly the finite-mixture factorization claimed.
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.
Sources
- Mario A. T. Figueiredo, Lecture Notes on the EM Algorithm (2004) (standard reference, not scraped)