Alphabeta Math
DefinitionDefinition: Literature-sourcedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Current-group and new-group posterior prediction

Definition

Let Y=∏j=1mYj be the data space and Y+={y∈Y:0<Z(y)<∞} its measurable subset of positive finite evidence fibers. Write Py for the full latent probability kernel supplied by Hierarchical posterior normalization on positive finite evidence, and set Λy:=Py for every y∈Y. On Y+ this is the normalized joint posterior; off Y+ it is the prior filler P0, so no likelihood quotient is formed there. For an already observed group j, its current-group posterior predictive law for a future observation with the same conditional observation kernel is Qj,ycur(A)=∫ΞKj(θj,A) Λy(dη,dθ1⋯dθm).

For a new group, specify a probability kernel Knew from (Θ,T) to a future observation space (Y~,A~). Its new-group posterior predictive law is Qynew(A)=∫Ξ[∫ΘKnew(θ,A) Gη(dθ)] Λy(dη,dθ1⋯dθm). For y∈Y+, if Λyη denotes the hyperparameter marginal of Λy, the joint posterior law of (η,θnew) used here is Λyη(dη)Gη(dθnew). Thus the new-group prediction first draws a new latent parameter from Gη and then draws its observation from Knew. On Y+ both formulas average over the joint posterior and retain uncertainty about unknown hyperparameters. On exceptional fibers they reduce to prior-predictive laws because Λy=P0.

Depends on

Used by

Dependency tree · two levels

26 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