Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
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-alphabet mean-field probability ensembles

Definition

Let A be a finite nonempty alphabet, let p=(p(a))a∈A be a probability vector with p(a)>0 for every a, and write Δ(A):={q∈[0,1]A:∑a∈Aq(a)=1} with the metric d1(q,r):=∑a∈A∣q(a)−r(a)∣ and its induced topology, called the ℓ1 topology. This is a metric: symmetry, nonnegativity and separation follow coordinatewise, and the triangle inequality follows by summing ∣q(a)−s(a)∣≤∣q(a)−r(a)∣+∣r(a)−s(a)∣. For each integer n≥1, the configuration space is Ωn:=An with the full power-set σ-algebra. Its reference probability is the product law p⊗n, which gives the word xn=(x1,…,xn) mass ∏i=1np(xi). By The finite product law has iid coordinate maps, this mass assignment is normalized and is a probability law; explicitly, ∑xn∈An∏i=1np(xi)=∏i=1n∑a∈Ap(a)=1. The empirical macrostate is the probability vector Ln(xn)(a):=1n#{i∈{1,…,n}:xi=a},a∈A. Thus Ln is the empirical type defined by the finite-alphabet supplier.

For a continuous function h:Δ(A)→R and a real parameter β, define the finite canonical normalizer and word law by Zn,β:=∑xn∈Ωnp⊗n(xn)e−nβh(Ln(xn)),pn,β(xn):=p⊗n(xn)e−nβh(Ln(xn))Zn,β. The normalizer is finite and positive because the sum is finite and every summand is finite and positive. The canonical macrostate law is the probability measure on Borel subsets B⊆Δ(A) that assigns mass pn,β({xn∈Ωn:Ln(xn)∈B}).

For a real-valued function f on a nonempty set S, define argmin⁡x∈Sf(x):={x∈S:f(x)=inf⁡y∈Sf(y)} and argmax⁡x∈Sf(x):={x∈S:f(x)=sup⁡y∈Sf(y)}; either set is empty if the corresponding extremum is not attained. For q∈Δ(A), set D(q∥p):=∑a:q(a)>0q(a)ln⁡q(a)p(a), omitting zero-mass terms, as in the finite relative-entropy convention. For u∈h(Δ(A)), define the constrained cost, entropy, canonical variational set, and constrained variational set by d(u):=inf⁡q∈Δ(A):h(q)=uD(q∥p),s(u):=−d(u), Mβ:=argmin⁡q∈Δ(A)[D(q∥p)+βh(q)],Mu:=argmin⁡q∈Δ(A):h(q)=uD(q∥p). For A⊆Ωn and an event E⊆Ωn with p⊗n(E)>0, define the conditional probability by p⊗n(A∣E):=p⊗n(A∩E)/p⊗n(E). For δ>0, the microcanonical shell event is En,δ,u:={xn:∣h(Ln(xn))−u∣<δ}. Whenever p⊗n(En,δ,u)>0, its microcanonical shell law is the conditional probability p⊗n( ⋅∣En,δ,u).

Depends on

Dependency tree · 2 levels

Sources