research29 min studyLesson 650 in Physics

Discovery significance and look-elsewhere effects

Interpret one-sided discovery tests, distinguish local and global tail probabilities, and calibrate the full search procedure when locations or selections are scanned.

On this page

What you’ll understand

  • Distinguish a background tail probability from a probability that the background hypothesis is true.
  • Calculate a finite independent-search correction and a union bound.
  • State when boundary and low-count effects invalidate a simple asymptotic significance formula.

An excess becomes evidence only relative to a defined background model and a specified rule for finding unusual data. The chance of a large fluctuation at one preselected mass differs from the chance of finding one somewhere in a wide search. Discovery significance must therefore describe both the local test and the larger procedure that selected the reported excess. We will define one-sided likelihood tests, calculate a simple multiple-search probability, and explain why nuisance assumptions, small counts, and data-dependent choices belong in the interpretation of a claimed signal.

A p-value conditions on a hypothesis

Choose a test statistic for which larger values indicate a more signal-like result. The background p-value is the probability, assuming the background model and the declared procedure, of obtaining a statistic at least as large as observed. It is not the probability that background is true and not the probability that this particular excess was caused by noise. A posterior hypothesis probability would require additional model and prior specifications, including alternatives.

For a nonnegative signal-strength parameter, a common discovery statistic compares the best fit with the fit constrained to zero signal, and sets the discovery statistic to zero for a downward unconstrained signal estimate. The physical boundary changes its null distribution. Under suitable large-sample conditions, the one-sided local significance can be approximated by the square root of that statistic. This is a calibrated asymptotic result, not an algebraic identity for every likelihood or every event count.

q0={−2ln⁡λ(0),μ^≥0,0,μ^<0,p0=P0(q0≥q0,obs),Z=Φ−1(1−p0)≃q0(q0,obs>0)q_0=\begin{cases}-2\ln\lambda(0),&\widehat\mu\ge0,\\0,&\widehat\mu<0,\end{cases}\qquad p_0=P_0(q_0\ge q_{0,\mathrm{obs}}),\qquad Z=\Phi^{-1}(1-p_0)\simeq\sqrt{q_0}\quad(q_{0,\mathrm{obs}}>0)
The hat in the piecewise definition refers to the usual unconstrained estimate with the chosen one-sided convention. Phi is the standard-normal cumulative distribution. The square-root relation is the regular one-sided local asymptotic approximation, particularly for a positive observed excess; exact calibration can differ at low counts. A zero discovery statistic is reported with zero discovery significance by convention; the displayed tail-to-Z formula is restricted to a positive observed statistic.↔ Scroll wide equations horizontally.

Searching changes the tail event

A local probability treats a specified mass or signal model as fixed before observing the excess. A global probability instead asks whether the complete search would produce at least one excess of comparable strength anywhere in its declared domain. For K independent tests with the same local tail probability p, the probability that none crosses the threshold is the Kth power of one minus p. Taking its complement gives the global probability. This independence model is a transparent example, not a realistic description of adjacent highly correlated mass points.

Without independence, the union bound still limits the global probability by the sum of individual tail probabilities. A continuous scan requires its correlations and boundaries to be modeled; the number of grid points is not automatically the number of independent trials. Gross–Vitells methods use properties of the scanned test-statistic process under specified asymptotic assumptions. Pseudoexperiments can calibrate the maximum statistic directly when they repeat the full scan and nuisance procedure.

pglobal=1−(1−plocal)Kfor independent equal-tail tests,P ⁣(⋃k=1KAk)≤∑k=1KP(Ak)p_{\mathrm{global}}=1-(1-p_{\mathrm{local}})^K\quad\text{for independent equal-tail tests},\qquad P\!\left(\bigcup_{k=1}^{K}A_k\right)\le\sum_{k=1}^{K}P(A_k)
A k is the event that test k crosses the stated threshold. For small K p the independent expression is approximately K p; the union bound is valid with arbitrary dependence and can be capped at one.↔ Scroll wide equations horizontally.

Calibrate the actual search, including its choices

Background functional forms, event categories, mass windows, and cut choices can all create additional opportunities for a fluctuation to become the selected result. If choices were made after looking at the candidate signal, calibrating only the final fixed test understates the selection process. Predeclared procedures, blinded analyses, or independent development samples help make those choices explicit. They do not remove the need to validate background tails and nuisance models where the excess appears.

A significance describes incompatibility with a stated model, while discovery of a physical particle additionally requires scrutiny of instrumental effects, alternative backgrounds, reproducibility, and consistency across observables. Large data samples do not protect against a systematically wrong tail model. Conversely, a non-significant result does not establish the absence of every possible signal. Confidence limits, model comparison, expected sensitivity, and discovery p-values answer different questions and should be reported with their corresponding assumptions and search domains.

Four independent opportunities for an excess

A synthetic search performs four independent predeclared tests. At a specified threshold each has background tail probability 0.01. Find the probability that at least one crosses the threshold, compare it with the union bound, and distinguish it from the local probability.

  1. For one test, the probability of not crossing is 0.99. Independence gives probability 0.994=0.960596010.99^4=0.96059601 that none of the four crosses.

  2. The global crossing probability is its complement, 1−0.96059601=0.039403991-0.96059601=0.03940399, about 3.94 percent.

  3. The union bound gives at most 4(0.01)=0.044(0.01)=0.04, slightly above the exact independent value. The local probability remains one percent for a specified test, but choosing any crossing among four uses the global event.

The result

The global tail probability is about 3.94 percent, compared with a one-percent local probability and a four-percent union bound.

Explore the model

Interactive lab

Interactive lab · probability

At least one rare threshold crossing

Treat a success as one independent test exceeding a fixed threshold. Reset, set Success probability p = 0.01 and Trials n = 4, and predict the zero-success bar 0.99⁴. For a fresh comparison Reset, set p = 0.01 and n = 20, and predict a smaller zero-success bar and a larger chance of at least one success.

At least one rare threshold crossingThese are exact binomial probabilities for independent trials with one fixed success probability. Playback tours the distribution; it does not resample outcomes. Current readings: Mean · np: 5; Variance · np(1−p): 2.5; Total probability: 1. All parameters are adjustable with the labeled controls below.03581000.070.150.220.3Successes kP(X = k)k = 0 · P = 9.77e-4
Exact probabilityHighlighted outcomeMean np
Mean · np
5
Variance · np(1−p)
2.5
Total probability
1
t = 0 s

These are exact binomial probabilities for independent trials with one fixed success probability. Playback tours the distribution; it does not resample outcomes. Parameter changes pause playback and recompute the model at the current elapsed time. Reset restores both parameters and returns time to zero. Playback starts paused. Adjust either parameter, then choose Play or Step.

Look forThe bars implement an exact independent binomial count. They do not represent a correlated mass scan, compute profile likelihoods, model nuisance uncertainty, or establish a real discovery probability.

Check your understanding

What is a global background p-value for a declared resonance search?

Try it yourself

For a separate synthetic fixed-location count, known background mean is 1 and four events are observed. Compute the exact upward Poisson tail using e−1≃0.36787944e^{-1}\simeq0.36787944. If five such locations are tested with unspecified dependence, give a union bound on the chance of at least one count at least four.

Take a moment to make a prediction or work it out on paper. Open a hint when you need one.

Give me a hint

Subtract the probabilities for zero through three from one, then use the union bound without assuming independence.

Compare with the solution

The sum through three is e−1(1+1+1/2+1/6)=(8/3)e−1e^{-1}(1+1+1/2+1/6)=(8/3)e^{-1}. The exact local tail is 1−(8/3)(0.36787944)≃0.018988161-(8/3)(0.36787944)\simeq0.01898816. For five locations the global probability is at most 5(0.01898816)≃0.09494085(0.01898816)\simeq0.0949408. This is a bound, not an exact global probability without the dependence structure. The low-count tail was computed directly rather than assigned an automatic square-root-likelihood significance.

Take it with you

  • A p-value is a tail probability conditional on a model and procedure.
  • Global searches include opportunities across the declared domain and depend on correlations.
  • Boundaries, small counts, nuisance assumptions, and data-dependent choices require appropriate calibration.

Read further

Original sources and deeper explanations to follow at your own pace.

Optional progress, saved in this browser when available. Revisit any lesson at any time.

Lesson not marked complete.