When a measurement has several possible outcomes, the one that happens is the one whose clock fires first, and the law those clocks obey isn't a modelling choice, as it's the only law that makes the race come out right, and that's proved in both directions.
hasRaceProperty_iff_exists_expMeasureSuppose a measurement outcome is decided by something physical rather than declared by a rule. That something then has to be specified in detail, and every detail a theory specifies is a detail a critic can call arbitrary, so the first-passage race is CSD's way of settling an outcome physically while leaving as little as possible to choice.
The picture is a race. Each possible outcome carries its own clock, and the clocks run at speeds set by the quantum state, so an outcome the state favours has a fast clock and an outcome it disfavours a slow one, and the outcome that happens is the one whose clock fires first. Set up this way, the race reproduces the quantum probabilities exactly, but it seems to buy that result by choosing how the clocks behave. The clocks have exponential waiting times, which means the chance of a clock firing in the next instant never depends on how long it has already been running, much as a radioactive atom is no more likely to decay for having survived a long time, so you can ask why that law and not some other.
The answer is that no other law works. If the rule that the first clock to fire wins is to reproduce the right proportions for every possible number of outcomes, the waiting times have to be exponential, so it isn't a natural choice or a convenient one but the only one. The argument runs both ways, as the exponential law makes the race work, and any law that makes the race work is exponential.
The race is the record layer's order-free way of deciding an outcome. An earlier construction cut an interval into consecutive pieces stacked in a fixed order, which quietly privileged whichever outcome came first in the list, and in the race no outcome is privileged, as each simply has a clock. The clock rates are read off the moment map, the map that extracts the Born weights directly from the geometry of the state space, so the squared amplitudes that set the speeds are geometry rather than an extra input, and the clock law itself is a theorem in the corpus rather than a citation to the probability literature.
Two qualifications travel with the result and should never be dropped. First, the characterisation quantifies over every number of outcomes, as at any one fixed number of outcomes the race constrains only finitely many summary statistics of the waiting-time law and determines nothing on its own. What's forced is the exponential law given that a single clock law serves every case, and that's a commitment the programme already makes, as the behaviour of the clocks doesn't depend on which measurement is being performed.
Second, the result removes a posit and doesn't supply a mechanism. No dynamics is shown to carve the cells of the race, and the earlier attempt to derive them from a mixing flow was retired as mis-specified rather than merely unfinished.
Take independent, identically distributed clock readings xi_j drawn from a common probability law on the reals, and let clock j fire at time xi_j / b_j for a rate vector b with positive entries. The law has the race property when, for every number of clocks and every such rate vector, the probability that clock i fires first is b_i / sum_j b_j. The theorem hasRaceProperty_iff_exists_expMeasure (CsdLean4/Mathlib/Probability/IidClockRace.lean) states that a probability law has the race property if and only if it's an exponential law with some positive parameter.
The forward direction instantiates the race at k clocks for every k, which turns the race condition into a family of moment identities for the unknown law, and atomlessness and support in the positive reals are derived from the race property along the way rather than assumed. The quantification over the number of clocks is load-bearing, as at a fixed number of clocks only finitely many moments are constrained, so what's characterised is the law that serves every number of clocks.
CsdLean4/Mathlib/Probability/IidClockRace.leanSource links are pinned to a commit, so they do not drift. The anchors above are checked mechanically against the Lean tree on every build. The mathematics is not, and cannot be: that is a human responsibility and it rests with the author.
Part of Constraint-Surface Dynamics · Formalised in csd-lean4.
Google Analytics counts visits to this page, which stores cookies in your browser. They record how the page was reached, not who you are, and nothing is passed on. Blocking cookies for this site breaks nothing here. Details.