EpistemicPhysics
All articles
Bayesian relativity · Statistical mechanics · Probability · Dynamics

The world inside a normalizer

The constant beneath a Beta density connects predictions, counting, thermal fluctuations, and motion. Follow it far enough and a missing clock becomes visible.

A probability density usually arrives wearing a small, forgettable denominator. The numerator gives the curve its interesting shape. The denominator makes its area equal one. It is tempting to divide, tidy the expression, and move on.

Keep that denominator on the desk. It can predict the next observation, count possible histories, compare models, and generate a geometry of statistical distinguishability. After a change of coordinates, it becomes a partition function, the object a statistical physicist uses to organize a whole thermal system.

There is another surprise waiting at the end. Even a complete probability distribution over velocities leaves a journey unfinished. To find where a traveler ends up, we also need to know how long each velocity lasts.

Three objects that travel together

Assume an unknown binary rate P has a proper Beta distribution, with positive shapes α,β. Recenter it to U=2P−1, so possible values u lie between −1 and 1. Throughout this article, write the prior-inclusive evidence coordinates without their usual epistemic subscripts:

τ=α+β,x=α−β,v=E[U]=xτ,m=2αβ.

The random variable U describes the whole cloud of possible velocities. Its mean v describes one feature of that cloud. The exact identity τ2−x2=m2 puts these parameters inside a Lorentz cone.

Our traveling kit contains three objects:

q(u)=(1+u)α−1(1−u)β−1,Z=∫−11q(u)du,fU(u)=q(u)Z.

Here q is an unnormalized kernel, Z its total weight, and fU the probability density. Think of q as a recipe’s relative ingredients, Z as the recipe’s total, and fU as the proportions.

Substitute p=(1+u)/2 into the integral. Because du=2dp, the powers of two collect into

Z=2τ−1B(α,β)=2τ−1Γ(α)Γ(β)Γ(τ).

The Beta function B is an integral; Γ extends the factorial, with Γ(k+1)=k! for nonnegative integers. Euler’s Beta integral supplies the identity used here.

The change of variables also explains a common puzzle. Stretching the probability interval from [0,1] to [−1,1] halves the density’s height:

fU(u)=12fP(1+u2),∫−11fU(u)du=1.

This factor is the Jacobian, the correction for a coordinate’s changing length scale. Omitting it doubles the area. A coordinate change preserves total probability when the density and measure travel together.

ShapesKernel q(u)Area Z
α=β=1/21/1−u2π
α=β=112
α=β=21−u24/3

The first row is the Lorentz-factor shape. Its normalized version is the Jeffreys prior j(u)=1/[π1−u2]. Thus γ(u)=πj(u): the same shape, with explicitly different areas.

Multiplying q by any positive constant multiplies Z by that constant and leaves fU unchanged. A raw area acquires meaning only after we specify the kernel and integration measure. We have now done that.

A lattice decorated with π

Begin with Jeffreys half-counts and collect Y support trials and N opposition trials:

α=Y+12,β=N+12,n=Y+N,τ=n+1.

For integer counts, the half-integer Gamma formula simplifies the area to

ZY,N=π(2Y)!(2N)!2Y+NY!N!(Y+N)!.

Every lattice site gets a rational multiple of π. The prior has Z=π; one support trial still has Z=π; two support trials give 3π/2; one of each gives π/2.

Why do balanced and one-sided trials send the area in opposite directions? Multiplying by (1+u) rewards the positive end. Repeating that reward amplifies a region already favored by earlier trials. A balanced pair multiplies by 1−u2, which never exceeds one.

Two particularly tidy paths are

Zk,k=π(2kk)4k,Zn,0=π(2nn)2n.

For large counts these behave as π/k and 2nπ/n, respectively. Remember that the first path has 2k trials and the second has n. At any common total, exchanging support and opposition leaves the area unchanged; greater imbalance makes it larger.

The next prediction hides in a neighboring area

A support trial changes (α,β) to (α+1,β). Gamma recurrence immediately gives

Z(α+1,β)Z(α,β)=2ατ=1+v.

But a support observation’s likelihood is (1+u)/2. Its predictive probability therefore includes one more factor of 1/2:

P(+∣α,β)=Z(α+1,β)2Z(α,β)=1+v2.

The opposition formula replaces v by −v. Neighboring normalizers know our next prediction.

A support-opposition pair gives a richer identity:

Z(α+1,β+1)Z(α,β)=4αβτ(τ+1)=m2τ(τ+1)=τVar⁡(U).

The same ratio is E[1−U2]. It joins the mass-like quantity, the cloud’s variance, and a two-observation update. Divide it by four to get the probability of one specified ordered pair, such as support followed by opposition.

A sequence, a count, and a bet

Suppose a particular sequence D contains Y support trials and N opposition trials. Averaging its likelihood over the Jeffreys prior gives

P(D)=ZY,Nπ2n.

An unordered count includes (nY) different sequences, so its probability is (nY)P(D). For two observations, the particular sequence +,− has probability 1/8; the count “one of each” has probability 1/4 because −,+ also qualifies.

A fixed fair coin assigns the specified sequence probability 2−n. Thus

P(D∣unknown rate, Jeffreys prior)P(D∣fixed fair coin)=ZY,Nπ.

This probability ratio is a Bayes factor. Here the raw area has a concrete comparison attached to it. A value above one favors the unknown-rate model relative to the fair-coin model for these data. Prior odds between models are a separate input.

There is also a coding interpretation. The ideal information length of this sequence is

L(D)=−log2⁡P(D)=n+log2⁡π−log2⁡ZY,N.

Each observation adds its predictive surprise, −log2⁡P(next outcome), in bits. The half-count predictor is the binary rule studied in Krichevsky and Trofimov’s universal encoding paper; a finite implemented code also has rounding and overhead.

For a playful third reading, imagine betting a fraction v of current wealth on support at even odds, allowing a negative fraction to back opposition. Outcome s=±1 multiplies wealth by 1+sv. Iterating the neighboring-area rule gives

Znπ=∏i=1n(1+sivi−1).

Under a fair coin, each factor has conditional mean one. The resulting wealth process is a martingale: its expected next value, given its history, equals its present value. This interpretation follows from the specified fair-coin experiment. Shared testimony still needs its lineage tracked; repeating one trial’s report does not create a fresh independent trial.

Before opening the lab, predict what happens after two support trials and after one of each. Then select bars with the same total count. Watch which quantities are probabilities and which are ratios.

Normalizer laboratory

One sequence, a whole packet of orderings

Tap a tile to change its outcome. Your strip is one particular sequence. A count packet includes every ordering with the same number of support trials.

Predict: which gets more probability, this exact sequence or its whole count packet? 2 support, 2 opposition.

Choose another count packet

Keep 4 trials. Tap a bar to change how many support outcomes the packet contains.

Support count. Swipe horizontally to see every packet.

Open the normalizer ledger
Raw area Z / π, a Bayes factor
0.375
Next support probability
50.0%
Sequence code length
5.42 bits

The prior contributes ½ to each Beta weight once: α = 2.5, β = 2.5. Z/π compares the unknown-rate model against a fixed fair coin; it can exceed one because it is a probability ratio.

Give the same belief three different clocks

Now hold that velocity distribution fixed

All three journeys have mean velocity 0.000 and velocity variance 0.167. Rose keeps one draw forever; teal redraws at random refresh times; gold redraws every 0.25 time units.

Position variance16.700510Time

At time 5.00, mean displacement = 0.000 for every model.

Fixed draw: position variance
4.167
Poisson refresh: position variance
1.336
Independent bins: position variance
0.208

Analytic curves, with X(0) = 0 and stationary initial velocities; no sampled trajectories. Time and position use dimensionless model units. The refresh clock is an extra assumption: the Beta shapes alone do not choose it.

Rapidity opens a thermal door

Unroll the bounded velocity interval using rapidity ϕ=artanh⁡u, or u=tanh⁡ϕ. Two elementary identities do the work:

1±u=e±ϕcosh⁡ϕ,du=sech2⁡ϕdϕ.

Here sech⁡ϕ=1/cosh⁡ϕ. Carrying the Jacobian transforms our entire unnormalized measure:

q(u)du=exϕ−τlog⁡cosh⁡ϕdϕ,Z=∫−∞∞exϕ−τlog⁡cosh⁡ϕdϕ.

This is also a form of the hyperbolic Beta integral. The right tail decays like e−(τ−x)ϕ and the left like e(τ+x)ϕ. Both integrate to a finite value precisely when τ>|x|. The evidence cone is also the domain where this partition function exists. A cone-shaped domain alone does not make Z invariant under Lorentz boosts.

Hold the mean v=x/τ fixed and define an energy landscape

Hv(ϕ)=log⁡cosh⁡ϕ−vϕ.

The rapidity density becomes the exact Gibbs form

fΦ(ϕ)=e−τHv(ϕ)Z(τ,τv).

In this dimensionless thermal reading, τ is inverse temperature. The landscape’s minimum solves tanh⁡ϕ=v. Its minimum is therefore the mean-state rapidity artanh⁡v, also the mode of this rapidity density. Generally it differs from E[Φ].

The landscape measures a familiar prediction mismatch. Set pv=(1+v)/2 and pϕ=(1+tanh⁡ϕ)/2. Subtract the energy at its minimum and simplify:

Hv(ϕ)−Hv(artanh⁡v)=DKL(Bern⁡(pv)‖Bern⁡(pϕ)).

The KL divergence on the right is the expected log probability ratio between two Bernoulli models. A thermal well and excess predictive loss now appear in the same equation.

At fixed interior v and large τ, the well looks quadratic and Var⁡Φ≈1/[τ(1−v2)]. Increasing τ along that ray sharpens the distribution. An actual observation usually changes v too. For example, one opposition trial changes Beta⁡(9.5,0.5) to Beta⁡(9.5,1.5) and raises velocity variance from 19/1100 to 19/484. Surprising evidence can broaden a belief while increasing its trial amount.

Even “raise the density to a power” needs a coordinate:

Operation with power c>0New shapes
Power fU relative to du1+c(α−1), 1+c(β−1), when positive
Power fΦ relative to dϕcα, cβ
Power the likelihood, keep Jeffreys prior1/2+cY, 1/2+cN

The last row naturally expresses fractional trial weight. A physical temperature calibration would add units and a specified physical model to the Gibbs correspondence.

Differentiate the denominator

Let A=log⁡Z. Differentiating its integral reveals

∂xA=E[Φ],∂x2A=Var⁡(Φ),∂τA=−E[log⁡cosh⁡Φ].

An applied bias changes a mean; the rate of that response equals a fluctuation. This is the partition function’s great organizational trick.

More fully, the matrix of second derivatives in coordinates (x,τ) is the covariance matrix of (Φ,−log⁡cosh⁡Φ). It is the family’s Fisher information matrix, measuring how distinguishable neighboring distributions are. These are the standard exponential-family derivative identities, specialized to this integral. The positive Fisher metric and the indefinite form dτ2−dx2 perform different jobs: statistical distinguishability and evidence-cone geometry.

The thermal derivatives also need the correct route through parameter space. At fixed v, use a total derivative along x=τv:

Fv=−τ−1log⁡Z(τ,τv),Uv=−ddτlog⁡Z(τ,τv)=E[Hv],Cv=τ2Var⁡(Hv).

These are the chosen model’s free energy, mean energy, and heat capacity. The fixed-x partial derivative answers a different question. Likewise, −log⁡P(D) is data surprise; connecting it to this free energy requires the prior and reference-likelihood factors already displayed above.

Normalization retains the shapes, trial amount, and malleability encoded in the distribution. If a separate material density ρ matters, write ρfU; its integral is ρ. There is no need to assign that role to an arbitrary kernel area.

Spheres and zeta values appear along the way

For a balanced state α=β=a, the kernel is (1−u2)a−1. It has a geometric realization: the first coordinate of a uniformly chosen point on a sphere in d=2a+1 dimensions has this density, whenever d is an integer at least two. To see the exponent, write that coordinate as u=cos⁡θ. The sphere’s angular area factor is sind−2⁡θdθ; changing to du removes one sine and leaves (1−u2)(d−3)/2.

A circle gives the Jeffreys arcsine law. An ordinary sphere in three dimensions gives a uniform coordinate. Balanced Jeffreys trials Y=N=k correspond to d=2k+2: each balanced pair advances this distributional representation by two dimensions. It is a lovely way to visualize concentration without asserting that physical space gains dimensions.

The same normalizer also generates rapidity moments:

E[esΦ]=Z(τ,x+s)Z(τ,x)=Γ(α+s/2)Γ(β−s/2)Γ(α)Γ(β),−2α<s<2β.

Derivatives at zero of the logarithm are cumulants: the first is the mean, the second the variance, and higher ones measure departures from Gaussian shape. For balanced shapes, odd cumulants vanish. The even ones become

κ2r=21−2r(2r−1)!ζ(2r,a),

where ζ(s,a)=∑k=0∞(k+a)−s is the Hurwitz zeta function. This follows by differentiating log Gamma and using its polygamma series. At Jeffreys, the rapidity density is sech⁡ϕ/π and its variance is π2/4. These identities connect fluctuations to zeta values at positive even integers; questions about nontrivial zeta zeros require further structure.

Which integral gives position?

Several integrals have now appeared. Put their meanings side by side:

IntegralWhat it measures
∫−11fU(u)duTotal probability, equal to one
∫−1afU(u)duProbability of falling below a threshold a
τ∫−11ufU(u)duThe existing evidence coordinate x=τv
∫0tU(s)dsDisplacement along a specified velocity process

The third integrates across possibilities; the fourth integrates along a history. A cloud is a photograph. A process is a film.

Even along an evidence history, the ratio v=x/τ and incoming tangent bias j=dx/dτ differ:

dxdτ=v+τdvdτ,τdvdτ=j−v.

Integrating j reconstructs the evidence path. Integrating v generally constructs a different trajectory. The tracelets in a lineage carry ordered increments; the final Beta state alone does not specify their timing.

Choose a velocity process and set X(0)=0. Then

E[X(t)]=∫0tE[U(s)]ds,Var⁡X(t)=∫0t∫0tCov⁡(U(s),U(r))dsdr.

The covariance tells us whether a velocity now resembles the velocity later. That is the missing clock.

The lab compares three explicit choices, all with the same stationary Beta velocity distribution, mean v, and variance σU2:

ClockPosition variance
Draw once and hold foreverσU2t2
Redraw at Poisson rate λ2σU2[t/λ−(1−e−λt)/λ2]
Redraw every ΔtσU2tΔt at bin endpoints

A Poisson clock has independent exponentially distributed waiting times, averaging 1/λ. The chance that no redraw separates two times is e−λ|s−r|, so its velocity covariance is σU2e−λ|s−r|. Inserting this into the double integral gives the middle row.

At short times, persistence produces quadratic, ballistic variance growth. Over many refreshes it crosses toward linear, diffusive growth. The fixed-bin model supplies a useful limiting surprise: shrinking Δt to zero while retaining bounded velocities makes position variance vanish. A nontrivial white-noise limit requires a different scaling.

Edit the movie while keeping every snapshot

Cast four travelers in a short film. Every frame contains the same four velocities, but you decide which traveler receives each one. Rotate the cast to make the travelers reunite or spread apart. This finite, discrete example makes the missing ingredient tangible: a sequence of identical velocity histograms can support very different correlations across time.

The velocity casting room

Edit four journeys from the same snapshots

Every frame contains the same four velocities. Tap a frame to rotate which traveler gets which velocity. Can you bring everyone together without changing a single frame's histogram?

Invite all four travelers back to position zero after four frames. Click a frame to cycle its cast; edits rewind the film.

Position-30301234Frame

Traveler ATraveler BTraveler CTraveler D

The film is paused. Arrange the remaining casts, or play the next frame.

Each frame's velocity variance
0.3125
Final position variance
Play to reveal
Same marginals, different temporal coupling

This exact finite ensemble uses four equally weighted velocities −0.75, −0.25, 0.25, and 0.75 in each unit-time frame. It illustrates the clock principle with a discrete distribution, rather than sampling a Beta law. All travelers begin at zero; positions add their assigned velocities. Rotations preserve every one-frame histogram and its zero mean.

Changing assignments changes correlations between a traveler's velocities at different times. Persistent assignments produce variance 16 × 0.3125 = 5 after four frames. Giving every traveler each velocity once produces zero final position variance. The same logic is why a stationary Beta cloud alone cannot specify its displacement process.

Conservation, biology, and a partition function for histories

There is a local conservation law hiding in normalization. Let P(z,u,t) be the joint position-velocity density for the refresh process and ρ(z,t)=∫Pdu its position density. Transport and refreshing obey

∂tP+u∂zP=λ[fU(u)ρ−P].

Integrate over velocity. Since ∫fUdu=1, the refresh terms cancel:

∂tρ+∂zJ=0,J=∫uPdu.

The flux J moves probability around without creating it. Replacing fU by raw q would create an artificial source λ(Z−1)ρ; retaining q/Z restores conservation. Every trajectory also stays inside |X(t)|≤t, because |U|≤1. Relating this trajectory cone to the evidence-parameter cone requires an explicit mapping between their coordinates.

Biology offers another clock. Neutral Wright-Fisher diffusion with recurrent mutation has a Beta stationary distribution, as developed in the population-genetics treatment by Steinrücken, Wang, and Song. One recentered convention is

dU=D(x−τU)dt+2D(1−U2)dWt.

Here D>0 sets the time scale and Wt is standard Brownian motion. With the usual mutation-diffusion boundary behavior, its stationary density is our fU. Its stationary covariance decays as σU2e−Dτ|t|. Choosing λ=Dτ makes its integrated position variance match the refresh model exactly, despite one velocity process being continuous and the other jumping.

Matching a distribution and covariance still leaves different movies. Jump timing, continuity, and higher joint moments can distinguish them. In the biological model the shapes describe mutation relative to genetic drift; reading them as observation counts adds a separate interpretation.

Selection supplies another useful correspondence. Reweight a population by fitness w(u)≥0:

fnew(u)=w(u)f(u)Ef[w].

The divisor is mean fitness. Replace fitness by a likelihood and the same operation is Bayesian updating, with predictive evidence as divisor. For exponential fitness esu, differentiating its log normalizer gives the selected mean and variance. The resulting density generally extends beyond the ordinary Beta family.

To encode an entire journey, choose its Markov generator L, an operator describing instantaneous changes of functions of velocity, and form

G(u,t;k)=Eu[ek∫0tU(s)ds].

Conditioning on a short first step gives ∂tG=(L+ku)G, with G(u,0;k)=1. For refreshing, Lg=λ(Ef[g]−g). For the diffusion, Lg=D(x−τu)g′+D(1−u2)g″. Derivatives of log⁡G in k now organize displacement cumulants. This is a calculable route from a static normalizer to a partition function over histories.

A further adventure would couple many such beliefs and ask whether a collective transition emerges. One finite Beta partition function is smooth inside its domain; two finite competing model evidences also combine smoothly by addition. A sharp transition needs a specified interaction and limiting process. That choice could create new physics, just as the refresh clock created a new journey.

Reading further