EpistemicPhysics
Survey · Statistics

When a question changes the shape of uncertainty

Turn questions, reshape uncertainty, and build probability menus that can keep growing.

· 17 min read · 2 interactive demos

You have a mysterious object, a detector that answers yes or no, and permission to turn the detector in any direction. Point it north. Ask ten questions. Receive five answers each way.

You have learned something about north. What happened to your uncertainty about east?

Our first experiment has a delicious answer: it grew. Learning squeezed the possibilities into a pancake, and pancakes are wide sideways.

Bring that pancake aboard. It will take us from Bayesian inference to probabilities with principal axes, then to a question menu that can discover new answers without spending its prior all over again. Along the way, Epistemic Physics gains a richer kind of belief: one that remembers the directions of its trials and the structure of its questions.

An unknown point and a movable question

Let the object’s unknown condition be a vector v=(vx,vy,vz) inside the unit ball. A vector is an ordered list of components; its length ‖v‖ is at most one. Each component describes a possible directional bias.

Choose a unit vector u for the detector’s orientation, and give its positive answer the probability

Pr(+∣v,u)=1+u⋅v2.

The dot product u⋅v picks out the bias along the question. It lies between −1 and 1, so the displayed probability lies between zero and one. The negative answer has the complementary probability.

Think of v as a plant’s hidden response tendencies and u as a chosen combination of light, temperature, and moisture. We have chosen a small model in which only their alignment controls the response. The point’s ball-shaped constraint couples those tendencies: a large bias in one direction leaves less room for the others.

A prior describes the possible conditions before collecting the current trials. Choose a uniform prior inside the three-dimensional ball: equal volumes receive equal probability. The detector’s answers then update this distribution into a posterior.

Point upward and write s=vz. A horizontal slice at height s is a disk with area π(1−s2). There are more possible points near the equator than near a pole. Thus the prior density of the vertical coordinate is

f0(s)=34(1−s2),−1≤s≤1.

“Uniform inside the ball” has become a curved density when viewed through one coordinate. Geometry has already entered the statistics.

Five answers each way make a pancake

Let Y count positive answers and N negative answers, all collected along this same direction. Assume they are independent conditional on the fixed unknown point. Their likelihood, the probability of these answers as a function of that point, is proportional to

L(s)∝(1+s)Y(1−s)N.

The proportionality symbol ∝ allows us to omit a factor that does not depend on s. Multiplying by the prior gives

f(s∣Y,N)∝(1+s)Y+1(1−s)N+1.

Set p=(1+s)/2. This is exactly a Beta distribution for p, with shape parameters Y+2 and N+2. Those initial twos come from the chosen uniform-ball geometry.

Now set Y=N=5. The vertical density becomes proportional to (1−s2)6, favoring the equator. Its mean remains zero, and its variance becomes 1/15. Variance is the average squared distance from the mean.

What happens sideways? Conditional on a particular height s, the remaining coordinates are still uniform inside a disk of radius 1−s2. Either sideways coordinate has conditional variance (1−s2)/4. Average over the updated heights:

Var⁡(vz∣5,5)=115,Var⁡(vx∣5,5)=1−E[vz2∣5,5]4=1−1/154=730.

The symbol E means an average under the stated distribution. The same sideways result holds for vy.

Coordinate varianceBefore the questionsAfter five answers each way
Measured direction1/51/15
Each sideways direction1/57/30

The sideways variance rose by one sixth. Balanced vertical answers favor the broad middle of the ball, opening more room sideways.

Make a prediction: add several positive answers instead. They pull the posterior toward a pole. Will the sideways variance still grow?

Point a question into a ball

Can learning make uncertainty wider?

Drag the teal handle to choose a question direction. Then add answers. Before collecting five of each, predict what will happen to the apricot sideways curve. Changing the direction starts a fresh experiment with zero trials.

The posterior's shape

Choose a new question direction. Drag or use arrow keys. Changing direction clears the old answers. Home points upward.Drag the question handleDirection 90°

Measured and sideways marginals

Probability density-101Coordinate along each axis
Measured directionEach sideways directionPrior on either axis
Answers along this direction
0 + / 0 −
Mean measured coordinate
0.000
Measured variance
0.20000
Each sideways variance
0.20000
Every direction begins with variance 1/5. Start by adding five answers each way: the center will stay put while the cloud changes shape.

Darker tiles mark greater projected density, with the hidden third coordinate integrated out. The two colored crossbars extend one standard deviation each way from the mean. Curves are one-coordinate marginal densities; every curve encloses area one. Variances are exact; the sideways curve is drawn by numerical integration. This experiment allows up to 60 answers.

There is a compact formula behind every batch in the laboratory. Define T=Y+N+4 and the posterior axial mean q=(Y−N)/T. Then

E[v∥]=q,Var⁡(v∥)=1−q2T+1,Var⁡(v⟂,j)=T(1−q2)4(T+1).

The subscripts ∥ and ⟂ mean parallel and perpendicular to the question; j chooses either sideways coordinate. This posterior retains both the answer balance and the direction in which the answers were collected.

Average the sideways variance over every possible batch of ten answers, weighted by the prior’s predictions, and it returns to 1/5. Particular experiences can widen one coordinate even though the average across experiences obeys the familiar variance bookkeeping.

A trial has a direction

A single total trial amount cannot describe this pancake. Ten repetitions along north and ten questions spread across three directions can leave very different unknowns.

The local sensitivity of one answer is captured by its Fisher information matrix. This matrix measures how strongly small changes in the unknown vector affect the answer distribution. For an interior point, where |u⋅v|<1, differentiating our likelihood gives

I(u;v)=uuT1−(u⋅v)2.

The superscript T turns a column into a row. Their product uuT is an outer product, a matrix whose action follows one direction. Its rank is one: it supplies one independent direction of local sensitivity.

This suggests an adventurous learning machine. Keep a posterior shape and a library of possible questions. Predict how each question would reshape that posterior, then choose a direction that helps the next decision. A robot could ask where its map is thinly supported. A tutor could choose an exercise that separates two plausible misconceptions. An experimentalist could turn a sensor toward the long axis of the remaining uncertainty.

At the origin, repeating one question n times supplies information nuuT. Spreading the questions equally across three orthogonal axes instead supplies (n/3)I, where I is the identity matrix. The same trial count now reaches every direction. Question diversity has acquired a precise geometric meaning.

Put an amount and a direction in the same object

An ordinary Beta probability can be assembled from two independent Gamma amounts with the same rate:

G+∼Gamma⁡(α,1),G−∼Gamma⁡(β,1),p=G+G++G−.

A Gamma distribution describes a positive random amount; its shape parameter controls its distribution. The notation ∼ means “has this distribution.” With the chosen rate one, the mean Gamma amount equals its shape. The resulting share p has a Beta distribution with shapes α,β.

Now give the amounts directions. A Gaussian vector z has bell-shaped coordinates, and its outer product zzT is a positive matrix. Summing such outer products produces a Wishart matrix, a matrix relative of the Gamma amount.

Take independent Wishart matrices W+,W− with a common scale, form their total S, and normalize:

S=W++W−,Q=S−1/2W+S−1/2.

The operation S−1/2 rescales the principal axes of S until the total becomes I. Applying that same transformation on both sides preserves positivity. This construction gives a matrix Beta distribution. In real dimension d, with Wishart degrees of freedom n+,n−>d−1, its density is proportional to

det(Q)(n+−d−1)/2×det(I−Q)(n−−d−1)/2.

Here det is the determinant, the matrix’s volume-scaling factor; degrees of freedom count independent Gaussian vectors when they are integers. Díaz-García and Gutiérrez-Jáimez describe the matrix Beta construction and density.

Ordinary shareDirectional matrix share
Positive amounts G+,G−Positive matrices W+,W−
Total G++G−Total S=W++W−
Probability pQuestion matrix Q
Complement 1−pComplement I−Q
0≤p≤10⪯Q⪯I

The matrix order Q⪰0 means wTQw≥0 for every vector w. Consequently, every unit direction reads an ordinary probability wTQw between zero and one.

The smallest and largest possible readouts are the eigenvalues of Q. Their eigenvectors are its principal directions. Imagine a probability crystal: turn it, and another share appears.

The object and the question get different matrices

Let ρ describe the state being examined. It is a positive matrix with trace one; the trace, written tr, adds the diagonal entries. Let Q describe a binary question, with 0⪯Q⪯I. Their meeting produces

Pr(+∣ρ,Q)=tr⁡(ρQ).

This is the state-and-effect pairing of quantum measurement theory. A menu of positive question matrices that sums to I gives outcome probabilities summing to one. Such a menu is called a positive operator-valued measure, usually shortened to POVM. An operator here is a matrix acting on vectors. Heinosaari, Jivulescu, and Nechita study random versions of these menus.

Our opening ball fits directly into this language. Let i be the imaginary unit, defined by i2=−1. For any three-component vector a, define

M(a)=(1+azax−iayax+iay1−az).

Then choose ρ=M(v)/2 and Q=M(u)/2. Direct multiplication gives

tr⁡(ρQ)=1+u⋅v2.

The matrix’s eigenvalues are (1±‖a‖)/2 after division by two, so the ball constraint supplies the needed positivity. The earlier directional likelihood is now a matrix pairing.

This opens two different statistical adventures. We can learn an unknown state using calibrated questions, or learn an unknown question using calibrated states. Put priors on both and the instrument can learn about its world while the world teaches it about the instrument. A laboratory’s calibration procedure becomes part of its inference model.

One total, several directional shares

Turn a probability crystal, then split an answer

Drag the gold handle to turn the state being tested. Each colored curve gives an outcome's probability in that direction. Split “Yes” into two finer answers, and watch their probabilities recombine into the original share.

Read the same menu from a new direction

YesNo

One state, an ordinary probability menu

Yes82.6%
Prior concentration: ½
No17.4%
Prior concentration: ½

The same total prior budget: 1

The prior weights describe the menu's chosen Gamma prior. The probability bars describe this particular normalized menu and state. They answer different questions.

Blend the state with an even mixture

Whole Yes probability
82.59%
Sum of outcome probabilities
1.000000
Smallest directional Yes share
25.65%
Largest directional Yes share
85.89%
This Yes matrix has principal shares 25.65% and 85.89%. Choose “Direction only” and turn the handle to find them. An even mixture averages these two eigenvalues, so turning its handle changes nothing.

Change the raw directional amounts

Each card is a positive amount along a fixed axis. Click to cycle its amount from ¼ to 3 in quarter steps. Changing a raw piece changes the shared total, so every normalized outcome can respond. Splitting a label preserves all four raw pieces.

The four displayed amounts are a chosen example. Each raw matrix is amount × direction × direction-transpose. One shared inverse square root normalizes every piece. The state is ρ = mwwᵀ + (1 − m)I/2, where w is the gold unit direction and m is 1, ½, or 0. Each readout is tr(ρE). The eigenvalue range describes the question matrix itself and stays fixed when only the state changes.

The gold handle selects the state direction. The colored curves belong to the question menu. Changing the state preserves that menu; changing a raw directional amount rebuilds the menu through its shared total. These are two separate ways an ordinary probability can move.

Discover a finer answer without losing the old one

Suppose a detector originally reports “yes” or “no,” and later learns to distinguish two kinds of yes. Give every outcome a positive raw matrix Wi and normalize them together:

S=∑iWi,Ei=S−1/2WiS−1/2,∑iEi=I.

Now split a raw outcome into two pieces, Wi=Wi,A+Wi,B. The shared total remains exactly the same. Therefore

Ei=Ei,A+Ei,B,tr⁡(ρEi)=tr⁡(ρEi,A)+tr⁡(ρEi,B).

The whole old answer is recoverable for every state. Refinement reveals distinctions inside an existing answer. Nechita explains the shared Wishart normalization behind random measurement menus.

Picture a field microscope that first recognizes “organism,” then “alga,” then several algal forms. Each refinement should preserve the older broad question. If the original tracelets include images or other identifying features, their lineage can also carry the distinction into the finer categories. The question tree grows while its trunk remains connected.

Give an expandable menu one prior budget

Can the prior itself survive that growth? Choose positive weights aj summing to one, unit directions uj, and independent Gamma amounts

Gj∼Gamma⁡(aj,1),∑jaj=1.

Attach an outcome label to each contribution, then build each raw outcome matrix by summing the contributions carrying that label:

Wi=∑j:label(j)=iGjujujT.

This is a finite marked Gamma construction: each random amount has a label and a direction attached. Choose directions spanning the state space so that the shared total is invertible. Normalize once, exactly as before.

The laboratory’s four contributions illustrate this construction with aj=1/4. Coarse “yes” receives 1/2 of the concentration budget. Splitting it gives 1/4 to each child, while the total remains one. These prior shapes belong to the menu model; the earlier uniform-ball model has its own geometrically determined shapes.

There is even an exact recipe for subdividing one Gamma amount. If a=aA+aB, draw

G∼Gamma⁡(a,1),B∼Beta⁡(aA,aB)

independently, and set GA=BG, GB=(1−B)G. The children are independent Gamma amounts with shapes aA,aB, and their sum is the original G. Retain the parent’s direction for these children, and both the raw matrix and its prior budget refine consistently.

A continuum of labels and directions suggests a Gamma random measure: an additive random supply of amounts over regions, with additive shape budgets. Assign total base concentration one and carry the same shared normalization through every partition. Work on infinitely divisible matrix Gamma laws offers mathematics for taking that construction further. Pérez-Abreu and Stelzer develop such cone-valued distributions.

Now imagine an Epistemic Physics laboratory that invents better questions as it learns. Early observations build a rough instrument. Later tracelets divide its answers into finer distinctions. Its state posterior develops ridges and pancakes; its question prior grows branches; its lineage keeps the old observations connected to their newer interpretations. When evidence takes different roads builds an exact reconstruction from joined observations, then lets the questions themselves change the state.

An ambitious next experiment would let this laboratory choose both the direction of its next trial and whether to refine its answer menu. Give each action a cost, predict its effect on the next decision, and let the instrument grow where a new distinction becomes useful. Learning would then reshape what the observer believes and what the observer knows how to ask.