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.

Finite-group hierarchical Bayesian model

Definition

Fix a finite group count m≥1, a standard Borel hyperparameter space (H,H), and a standard Borel parameter space (Θ,T). Let Π be a probability measure on (H,H) and let G:H×T→[0,1] be a probability kernel. For each j∈{1,…,m}, let (Yj,Aj) be a measurable observation space, let νj be a sigma-finite measure on it, and let Kj be a probability kernel from (Θ,T) to (Yj,Aj) with a specified jointly measurable density fj:Θ×Yj→[0,∞]: Kj(θ,B)=∫Bfj(θ,yj) νj(dyj)(B∈Aj).

The finite-group hierarchical model is the following specified kernel construction. First draw η∼Π. Conditional on η, draw θ1,…,θm from the finite product kernel Gη⊗m(dθ1⋯dθm)=⨂j=1mGη(dθj). Thus the group parameters are conditionally independent and have the same conditional law Gη. Conditional on the parameter tuple, draw the group observations from the product kernel ⨂j=1mKj(θj,⋅). The product-kernel laws are probability kernels by Finite products of probability kernels are probability kernels. For each fixed η, the coordinate maps under Gη⊗m are independent random elements, so their joint law is the finite product law (Independent random elements have product joint law).

Put Ξ=H×Θm with its finite product sigma-algebra. The proper latent prior P0 on Ξ is P0(dη,dθ1⋯dθm)=Π(dη)∏j=1mGη(dθj), well-defined by A prior and model kernel define a joint law. For ξ=(η,θ1,…,θm)∈Ξ, lift each observation kernel to the common source Ξ by Mj(ξ,B)=Kj(θj,B)(B∈Aj). The coordinate projection ξ↦θj is measurable, so the kernel definition shows that each Mj is a probability kernel. Its specified jointly measurable density is (ξ,yj)↦fj(θj,yj), by composition with the same measurable coordinate projection. Let Y=∏j=1mYj, ν=⨂j=1mνj, and y=(y1,…,ym). The observation kernel from Ξ has jointly measurable density Ly(η,θ1⋯θm)=∏j=1mfj(θj,yj) with respect to ν, by Finite products of dominated kernels have the product density. Its evidence is the possibly extended nonnegative number Z(y)=∫ΞLy(η,θ1⋯θm) P0(dη,dθ1⋯dθm). The normalized likelihood measure is called a pointwise joint posterior on a fiber only when 0<Z(y)<∞; no quotient is formed at zero or infinite evidence.

For each group, θ↦Kj(θ,⋅) is a parametric statistical model in the sense of Parametric statistical models, with its parameter-measurable kernel representation as in Parameter-measurable statistical models as kernels. Here “conditionally independent given η” is shorthand for the explicit finite product-kernel specification above. The library's random-element conditional-independence terminology is defined in Conditional independence given a sigma-algebra; its conditional-expectation-class convention assumes AC. The finite product-kernel definition here does not use that class convention or any choice axiom.

Remarks

The product-kernel assumption is part of this model. An arbitrary finitely exchangeable law need not be a mixture of iid laws; no finite de Finetti theorem is claimed here. When η is unknown, the joint posterior retains its uncertainty and induces dependence between group parameters after η is integrated out.

Depends on

Used by

Dependency tree · two levels

36 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