Alphabeta Math
ExampleConstruction: AI-generatedVerification: AI-generatedPipeline-generated
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.

Complete, partial, and no-pooling limits in the normal hierarchy

Example

In the known-variance normal hierarchy, fix μ, an observed group summary yˉj, and sj2>0. Specify the likelihood-density version pointwise by fj(θ,y)=(2πsj2)−1/2exp⁡ ⁣(−(y−θ)22sj2)(θ,y∈R). For finite τ2>0, the posterior mean is a strictly weighted average of yˉj and μ. As τ2↓0 it approaches complete pooling at μ; at the boundary τ2=0, the prior itself forces θj=μ. As τ2→∞, the posterior mean and variance approach the group-only values yˉj and sj2, the no-pooling limit. The value τ2=∞ is not an admissible proper prior.

Facts & Assumptions

Given: A finite group hierarchy, fixed μ, observed yˉj, known sj2>0, and conditional variance τ2>0 except when examining the stated boundary limit.

[F1]

For positive τ2,sj2 and the canonical normal likelihood-density version specified in the Example, the conditional posterior mean and variance are θ^j=(yˉj/sj2+μ/τ2)/(1/sj2+1/τ2) and Vj=(1/sj2+1/τ2)−1. Conditional normal shrinkage in a finite hierarchy

[F2]

The library normal law includes the degenerate boundary N(μ,0)=δμ. Standard normal and normal laws

[A1]

AC is assumed for the library normal-law convention. The Axiom of Choice

[A2]

τ2>0 and sj2>0 for the conditional-posterior formula.

Verification

Given: The normal hierarchy in the Example and Facts & Assumptions.

1.1A1A2F1algebra

Set aj=τ2/(τ2+sj2). Algebra in [F1] gives θ^j=ajyˉj+(1−aj)μ and Vj=τ2sj2/(τ2+sj2). Since both variances are positive, 0<aj<1, so for finite positive τ2 the group mean uses both its own data and the population mean.

2.1A1A2F1F2step 1.1algebra

As τ2↓0, aj→0, Vj→0, and θ^j→μ. At τ2=0, [F2] makes the conditional prior δμ, so every group parameter equals μ and conditioning on the data leaves it there. This is complete pooling.

3.1A1A2F1step 1.1algebra∎

As τ2→∞, aj→1, Vj→sj2, and θ^j→yˉj. These are the group-only posterior mean and variance, so they describe the no-pooling limit. No posterior at τ2=∞ is asserted.

Depends on

Used by

Nothing in the library uses this result yet.

Dependency tree · two levels

28 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