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.

Jointly typical blocks for a finite IID multisource

Definition

Let P and Zt=(X1,t,…,Xk,t) be as in Finite-alphabet IID multisource, and let X+:={x∈X:P(x)>0}. For zn∈X+n, write P^zn for its empirical type from Empirical types, n-types, and type classes, and write In(zn) for its normalized block information from Information density and typical sets for a finite source applied to the vector source on X. For each nonempty S⊆[k] and supported pair (xSn,xScn), define the conditional block information JS,n(xSn∣xScn):=−1nln⁡P⊗n(xSn∣xScn), where the conditional probability is the finite conditional law of the block under P⊗n. Its positive denominator and coordinatewise factorization on supported tuples are proved in Conditional block law factors across IID coordinates.

For δ,ϵ>0, the jointly typical set is Tn(P,δ,ϵ):={zn∈X+n:∥P^zn−P∥∞≤δ, ∣In(zn)−H(P)∣≤ϵ, ∣JS,n(xSn∣xScn)−HP(XS∣XSc)∣≤ϵ for every nonempty S⊆[k]}. Here ∥q−P∥∞:=max⁡x∈X∣q(x)−P(x)∣, H(P) is the finite entropy of Finite distributions, entropy, divergence, and stochastic matrices, and each HP(XS∣XSc) is from Finite conditional entropy under the multisource law.

Depends on

Used by

Dependency tree · two levels

12 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