Codex @codex  0

A box plot compresses a statistical sample into a box spanning its lower and upper quartiles $Q_1,Q_3$, a line at its median $Q_2$, and two whiskers. It makes location and central spread easy to compare across groups on a common value axis. The box represents the central half in terms of quantile levels; with ties or interpolated quartiles, it need not contain exactly half the observations. Whisker endpoints require a stated convention: they can be the observed extremes, or they can stop short of separately marked observations. ^[ref]

Here is one explicitly toy dataset, reused under histogram: twelve invented, unitless values, with repeated values counted separately, already arranged as order statistics:For this box plot we choose the interpolated quartiles defined under quartile, using R's type-7 rule. This givesThe interquartile range is $I=Q_3-Q_1=3.5$. Our whisker convention uses the fencesThe whiskers end at the smallest and largest observations in the closed interval $[L,U]$: here $1$ and $8$. Values strictly outside the fences receive separate outlier markers: here only $20$. An observation exactly on a fence is retained within the whisker under this convention. The fences are thresholds, not observed whisker endpoints; the upper whisker is at $8$, not $11.5$. R's documented whisker rule likewise includes observations no more than $1.5$ box lengths away, although its box uses hinges, which can differ from our type-7 quartiles. ^[ref]

A separate outlier marker is a prompt to investigate, not a finding that the value is bad data and not an instruction to delete it. A distant observation can be a recording error, a legitimate unusual outcome, or evidence that the assumed statistical model misses some behavior. Check its provenance and context before deciding how to analyze it. No measurement-error claim is possible for our invented $20$: we deliberately put it there to demonstrate the rule. ^[ref]

The beauty of a box plot is its compact comparison of ordered positions rather than every observation. That compression also loses information: many different statistical samples have the same quartiles and whiskers, so the box alone cannot reveal every cluster or gap that a histogram might show. For example, replacing the two invented $6$ values by $5.5$ and $6$ leaves the type-7 quartiles, whiskers and separate marker unchanged. Displaying the individual values alongside the box plot is especially helpful for such a small statistical sample. Always state both the quartile rule and the whisker rule; changing either can change which values are marked.

Descriptive statistics summarizes observed data, for example through location and spread statistics or graphical summaries such as a histogram.

The empirical distribution function counts the fraction of observations at or below a threshold. For a statistical sample of $n\ge 1$ real observations $X_1,\dots ,X_n$, defineEach indicator function contributes one exactly when its observation is counted. Equivalently, $F_n(x)=P_n((-\infty ,x])$, where the empirical measure $P_n=n^{-1}{\sum }_i{\delta }_{X_i}$ assigns probability mass $1/n$ to each observation, including repeated observations.^[ref]

Choose the illustrative statistical sample $[1,1,2,4,6]$. Its empirical distribution function isFor example, $F_5(1)=2/5$ counts both observations equal to $1$, $F_5(3)=3/5$, and $F_5(4)=4/5$. There is no observation at $3$, so there is no jump there. The five observations produce only four distinct jump locations.

The convention $X_i\le x$ makes the empirical distribution function right-continuous: once a threshold reaches an observation, that observation remains counted immediately to its right. For a finite statistical sample, the count is constant from any $x$ up to the next larger observed value, proving right continuity. Its left-hand limit $F_n(x^{-})$ counts observations strictly below $x$, soA value occurring $m$ times causes one jump of size $m/n$. At $1$ the jump is $2/5$; at $2$, $4$, and $6$ each jump is $1/5$. All jumps sum to one. Thus the empirical distribution function is a nondecreasing step function with limits zero and one, and is itself a valid cumulative distribution function.

This turns many questions about data into simple cumulative distribution function operations. The observed fraction in $(a,b]$ is $F_n(b)-F_n(a)$: for $(1,4]$ it is $4/5-2/5=2/5$, counting $2$ and $4$ but excluding both $1$s. Including the left endpoint gives $F_n(4)-F_n(1^{-})=4/5$. A sample quantile reads the same staircase in reverse: the smallest threshold reaching $1/2$ is $2$. Unlike a histogram, this representation requires no choice of bins; its jumps retain every observation and its multiplicity.

The exact description of a finite statistical sample must be distinguished from a statistical model for how it was obtained. The empirical distribution function is defined for any finite list, with no independence assumption. Once the list is observed, its counts are fixed. For statistical inference, one often models $X_1,\dots ,X_n$ as independent and identically distributed random variables with an unknown population cumulative distribution function $F(x)=\mathbb{P}(X_i\le x)$. Then $F$ describes the sampling law, while $F_n$ varies across repeated statistical samples. The value $F_5(1)=0.4$ is an observed fraction and an estimate of $F(1)$; it does not establish that the population probability is $0.4$. Even when $F$ is continuous, every finite $F_n$ is discrete.

For any threshold $x$ fixed before sampling, the indicator functions are independent Bernoulli random variables with success probability $F(x)$. Therefore the count has a binomial distribution andThe expected value follows by adding the expected values of the indicator functions; the variance follows by adding their variances using independence and dividing by $n^2$. Thus $F_n(x)$ is an unbiased estimator of $F(x)$ at a fixed threshold. Controlling the error at every threshold at once requires more than a fixed-threshold calculation: the DKW inequality supplies such control, and the Glivenko-Cantelli theorem describes its uniform convergence almost surely as $n$ grows.

Comparing $F_n$ with a proposed cumulative distribution function also motivates goodness-of-fit tests, including the Kolmogorov-Smirnov test, the Anderson–Darling test, and the Cramér–von Mises criterion. A standard Kolmogorov-Smirnov test calibration assumes a fully specified continuous population law; fitting its statistical parameters from the same statistical sample changes that calibration.^[ref]

The 2007 paper Comparison of the Hanbury Brown-Twiss effect for bosons and fermions by T. Jeltes and others compares polarized helium-3 fermions with helium-4 bosons. The chemical atoms occupy a metastable atomic level. Switching off magnetic trapping of neutral atoms releases them onto a microchannel plate detector with a delay-line anode, 63 cm below. Position and arrival-time readouts give three-dimensional pair separations by time-of-flight atom detection. About 1000 clouds per isotope supply histograms; normalization removes the broad cloud shape.

The pair detection correlation dips below one for helium-3 and rises above one for helium-4. The same apparatus, matched temperatures near $0.5\mu \mathrm{K}$, nearly identical trapping potentials, negligible interactions, and magnetic field gradient checks of spin polarization support an exchange-statistics interpretation. Finite detector resolution suppresses contrast; trap switch-off and resolution uncertainties limit quantitative agreement. A diverging laser lens deepens the dip, but its aberrations preclude a precise lens-model test. This detects exchange correlations, rather than measuring occupation of one selected spin orbital.^[ref]

Under controlled staining and detector settings, integrated fluorescence can be approximately proportional to nuclear DNA amount. A histogram of accepted single-cell events then separates a $2C$ region, an intermediate region and a $4C$ region. These are ordinarily assigned to G0 phase/G1 phase, S phase, and G2 phase/M phase respectively in the stated diploid model.

A Cornell protocol fixes a single-cell suspension by adding cold 70% ethanol dropwise while mixing, reducing clumping. After washing, its staining solution contains propidium iodide at $50\mu g/ml$; ribonuclease A removes interfering RNA. It specifies excitation at $488\mathrm{nm}$ and emission around $600\mathrm{nm}$. The resulting readout is fluorescence per event, not a direct count of chromosomes. ^[ref]

Useful controls include an unstained sample for background and a reference population with known nuclear DNA amount, processed with identical settings. Two attached $2C$ biological cells can mimic one $4C$ event. Comparing signal integral with pulse height or width helps exclude such doublets; a gate selecting intact single particles also limits debris. These are proposed assay checks, not measurements underlying the illustration.

A $4C$ peak cannot distinguish G2 phase from mitosis; a $2C$ peak cannot distinguish G1 phase from G0 phase. Mixed ploidy, uneven staining and aggregates can invalidate phase assignments. Peak areas describe the accepted sample at collection, and do not by themselves establish phase durations, division rates or a particular arrest mechanism. A treatment comparison needs matched handling and another readout appropriate to the claimed mechanism.

A Haar density estimator estimates the Haar scaling function coefficients by sample averages. It is exactly the histogram with cells of width $2^{-j}$. Its expectation is the Haar projection of the density. If the density has bounded derivative $L$ and is bounded by $B$, its pointwise expected absolute error is at most $L{2}^{-j}+\sqrt{B{2}^j/n}$: the first term is the Haar projection error for a Lipschitz function, and the second follows from the variance of a cell count and the Cauchy-Schwarz inequality. Choosing $2^j\asymp n^{1/3}$ gives error $O(n^{-1/3})$ while preserving nonnegativity and integral one.

A histogram groups numerical observations into adjacent intervals called bins and draws one rectangle per bin. Its attraction is that a long list of values becomes a visible pattern of concentration, gaps and skewness. Specify the bin edges, the treatment of values on those edges, and what the vertical axis means: count, proportion, or density. Those choices are part of the graphic. ^[ref]

Let $n>0$ observations be covered by disjoint bins $B_j$ with positive widths ${\Delta }_j$ and counts $n_j$, so ${\sum }_j{n}_j=n$. For example, use left-closed, right-open bins, closing the final right edge too. The three common height choices have different meanings:

For the density convention, a histogram is a piecewise constant probability density function estimate:Its normalization follows by adding rectangular areas:If the observations have units, density has reciprocal units; a density height is not a probability and can exceed $1$. With equal bin widths, count heights and density heights differ only by a common scale factor. With unequal widths, count-height areas $n_j{\Delta }_j$ give wider bins extra visual weight unrelated to their counts. Dividing by width removes that distortion. R's histogram documentation explicitly describes area-one normalization for unequal bins. ^[ref]

Reuse the twelve invented values under box plot, with bins $[0,2),[2,4),[4,8),[8,22]$. The counts are $(1,3,6,2)$ and the widths are $(2,2,4,14)$. Hence the density heights and areas are exactlyThe second and third bars have equal density heights even though the third contains twice as many observations: it is also twice as wide. The last bar contains only two observations; its count-height area would be $2\cdot 14=28$, larger than the six-observation bar's $6\cdot 4=24$. Its correct density area is only $1/6$.

Bin choice trades detail against stability. Broad bins merge distinctions: the toy bin $[8,22]$ hides the empty stretch between $8$ and $20$. Narrow bins expose gaps but can make each individual observation dominate a bar. With one-unit bins starting at $0$, the bins $[2,3),[4,5),[6,7)$ each contain two values and appear equally prominent; that apparent pattern depends on grouping the repeated integers together. Moving the bin origin also changes membership without changing the observations. For density estimation, this is a form of the bias-variance tradeoff: averaging over broad bins loses local detail, while narrow bins give more variable density estimates across repeated statistical samples. ^[ref] A useful practice is to compare a few plausible widths and offsets, keeping common edges when comparing groups. Automatic bin selectors are starting points, rather than guarantees of a unique correct picture. ^[ref]

A histogram retains only bin membership. Its density estimate spreads each bin's fraction uniformly across that bin, so our last bar assigns density throughout $[8,22]$ even though the only toy values there are $8$ and $20$. It does not recover within-bin positions or observation order, and a visually convincing shape does not establish a population probability distribution. A box plot provides a complementary compact summary of quartiles; neither graphic replaces the original observations.

Murray Rosenblatt's 1956 paper studied density estimation from a one-dimensional statistical sample, the unavoidable bias of an estimator under its stated conditions, and asymptotic mean squared error. It is an early foundation of kernel density estimation. ^[ref]. Emanuel Parzen's 1962 paper developed statistical consistency and asymptotic normality for probability density function estimates and studied estimation of the mode. ^[ref].

The authors' interests help explain the connection with smoothing. In a conversation recorded in 2006 and published in 2009, Rosenblatt recalled that his density estimation work grew out of estimation of the time-series spectral density and emphasized the connection with a smoothed histogram. This is his retrospective account of the motivation. ^[ref]. Parzen's original paper lists Stanford University as his affiliation; its opening frames the problem as recovering both a probability density function and its mode from independent and identically distributed random variables. ^[ref].

Why add the daughter four-momenta? Consider a selected combination of final particles withUsing the $+---$ Minkowski metric, its scalar square isIn the combination's center-of-momentum frame, its total momentum vanishes and its total energy is $M{c}^2$. Therefore $P^{\mu }{P}_{\mu }=M^2{c}^2$, givingLorentz transformations preserve this scalar square, so the reconstructed invariant mass does not depend on the combination's laboratory motion. It includes relative kinetic energy and need not equal the sum of the daughter rest masses. A random pair has an invariant mass too; that number does not itself establish a common parent.

For two daughters, expanding the square and substituting each energy–momentum relation givesHere $M$ and $m_i$ are masses, not energies. Reporting $M$ in $\mathrm{GeV}/c^2$ and momenta in $\mathrm{GeV}/c$ is equivalent to calculating numerically with $M{c}^2$ and $c{\mathbf{p}}_i$ in $\mathrm{GeV}$. Setting $c=1$ in natural units suppresses these conversion factors; it does not change the measured quantity.

Alvarez's lecture illustrates invariant mass searches with $K\pi$ combinations and contrasts resonance lifetimes near $10^{-23}\mathrm{s}$ with the much longer lived states the chambers originally targeted. These resonances decayed before producing a resolvable parent track.^[ref]

Operationally, choose a reaction hypothesis, require an acceptable bubble-chamber kinematic fitting result, and form specified daughter combinations. Accumulate their invariant masses in a histogram across events. A particle resonance is inferred from the ensemble's dynamics; its short-lived parent is not directly photographed. Daughter tracks can be visible even when the production and decay positions of the parent cannot be separated. Wrong combinations create background, and several combinations from one event are statistically correlated.

Let $X_1,\dots ,X_n$ be real independent and identically distributed random variables with unknown probability density function $f$, let $n\ge 1$, and choose a nonnegative, unit-integral kernel for density estimation $K$ and a smoothing bandwidth $h>0$. The kernel density estimator isPlace a bump at every observation and add their contributions. Each bump $K_h(x-X_i)/n$ has area $1/n$, so for every realized statistical sampleThe change of variables is $u=(x-X_i)/h$. Summing the unweighted bumps $K_h(x-X_i)$ would give area $n$; summing just $K((x-X_i)/h)$ would give area $nh$. Those raw sums do not have the normalization of a probability density function.

Unlike a histogram, the construction does not require choosing bin origins, and a Gaussian density kernel gives a smooth curve. Its appeal is that identical local contributions can combine into a probability density function with several peaks without first choosing their number. This makes kernel density estimation useful for exploring an unknown probability distribution and estimating interval probabilities, while the smoothing bandwidth controls how much detail is visible.

Before the statistical sample is observed, ${\hat{f}}_{n,h,K}$ is a random function; afterwards it is a fitted probability density function. It is an estimator of the unknown $f$, not the true probability distribution. For fixed $K,h$, its expectation is the convolution $K_h\ast f$, generally different from $f$, and repeating the sampling changes the fitted curve. The exact mean integrated squared error of a kernel density estimator separates this smoothing bias of an estimator from sampling variance. Allowing signed kernels of order ell retains the formula but can lose nonnegativity.

Nuclear DNA content is the amount of DNA in a specified cell nucleus. Define $1C$ relative to one unreplicated haploid set of the chosen species. It includes coding and non-coding DNA and excludes DNA outside the cell nucleus, such as a mitochondrion's genome. $C$ is an amount, whereas $n$ is a chromosome count; neither fixes the other across different species.

For an original numerical model, assign the three chromosome types unreplicated DNA amounts of 3, 2 and 1 arbitrary units. Then $C=3+2+1=6$ units: diploid G1 phase contains 12 units, G2 phase 24, each completed meiosis I product 12, and each completed meiosis II product 6. The totals $2\times 12=24$ and $4\times 6=24$ check conservation after copying. Equal chromosome counts alone would not justify equal DNA amounts if the sets had different sequence lengths.

How can an experiment measure the amount independently of chromosome counting? UCL's Cell Cycle Analysis by Propidium Iodide Staining, pp. 1–2, specifies a flow cytometric DNA-content assay. Washed biological cells receive cold 70% ethanol dropwise while vortexing, then at least 30 minutes on ice. After centrifugation and two washes, ribonuclease A removes RNA that would also bind the dye. Propidium iodide stains the preparation. A flow cytometry instrument such as the listed BD LSR II records individual-event fluorescence on a linear scale. Signal area versus height or width excludes doublets and clumps; acquisition is below 400 events per second, retaining at least 10,000 single-cell events. These are protocol settings, not measured results.^[ref]

For a ploidy comparison, add a known diploid G1 phase reference processed with the same staining and detector settings, and an unstained background control. These are proposed comparison controls, beyond the protocol's clump-exclusion procedure. Proportional fluorescence then estimates relative Nuclear DNA content; it does not count chromosomes. A $2C$ event could be a diploid G1 phase product or a replicated haploid product; $4C$ could be replicated diploid material or an unreplicated four-set cell nucleus. Peaks alone therefore cannot establish ploidy or cell cycle stage without a reference and biological context. Uneven staining, residual RNA and unresolved doublets limit this inference; two $2C$ particles can mimic one $4C$ event.

Continue the random-number stream used for the ten trajectories, then generate 1000 further independent realizations with the same model parameters. Plot each statistic in its own histogram:

stats = sir_sim_stats(1000, 100, [99,1,0], 1, .25, rng)
fig, axes = plt.subplots(1, 2, figsize=(9, 4), layout="constrained")
axes[0].hist(stats[:,0], bins=np.arange(.5,65.6,2))
axes[1].hist(stats[:,1], bins=np.arange(0,61,2))
axes[0].set(xlabel="Peak infected population", ylabel="Number of outbreaks")
axes[1].set(xlabel="Final recorded time (days)", ylabel="Number of outbreaks")
plt.show()

Both histograms have a group of early failures separated from a group of large outbreaks. For this reproducible run the mean peak is 33.73 individuals, and the mean final time is 22.165 days; the largest final time is 56.916 days, so all 1000 runs reached epidemic extinction before the 100-day horizon.

“Failed to take off” needs an operational definition; the two separated groups in the histograms suggest a low peak or an early end. For example, classify a run as a failure if its peak is below ten infected individuals, or alternatively if its extinction time is below ten days:

failed_by_peak = stats[:,0] < 10
failed_by_time = stats[:,1] < 10
print(failed_by_peak.mean(), failed_by_time.mean())

Both definitions give $255/1000=0.255$ in this run. Here they also classify the same 255 realizations, although agreement is not guaranteed for other simulations or cutoffs. These are empirical failure fractions for the stated rules, not exact model constants.

The early branching process approximation provides a useful check: while susceptible depletion is negligible, $R_0\simeq 4$ gives eventual extinction probability about $1/R_0=0.25$ from one initial infection. Allowing for the initial susceptible fraction gives a rate ratio $\gamma /(\beta \times 0.99)\simeq 0.253$; both approximations are compatible with this simulation, but neither defines the finite-population cutoff exactly.

The accepted values ${\theta }^{(1)},\dots ,{\theta }^{(R)}$ have marginal posterior densityEstimate this one-dimensional density by a histogram or kernel density estimation from the simulated values. Where $\pi (\theta )>0$, likelihood reconstruction from posterior simulation givesUse bins or a sufficiently fine grid, and refine near the maximum. For a histogram with bins $I_b$, its posterior mass divided by prior mass estimates a prior-weighted average of the likelihood in that bin:Narrowing the bins gives pointwise likelihood reconstruction at continuous positive-prior points. A flat proper prior over the search interval makes the highest posterior-density bin approximately the highest-likelihood bin. With a nonconstant prior, maximizing the posterior alone gives a maximum a posteriori estimate, generally different from maximum likelihood estimation. Choose prior support covering the intended search region and include a possible boundary maximum; for $k=0$, ${\ell }_0(\theta )=E[e^{-\theta L/2}]$ decreases with $\theta$, so the maximum-likelihood estimate is $0$.

The sampled genealogies provide a second likelihood reconstruction when the one-dimensional prior integral is computable. PutTheir posterior density is $q(t)r_k(t)/m_k$. Therefore, for any trial value $\vartheta$,This is an importance sampling estimate of the likelihood curve using the posterior genealogies. It can be maximized over a grid without estimating a posterior density in $\theta$, provided $r_k(t)>0$ wherever the target integrand is positive and the weights are numerically usable. The ordinary moment estimate $k/a_n$ is not automatically a maximum-likelihood estimate: it uses only the mean equation, while the likelihood integrates the entire random branch-length distribution.

Let $\varphi$ be the scaling function and $\psi$ an orthonormal wavelet, with ${\varphi }_{j,k}(x)=2^{j/2}\varphi (2^{j}x-k)$ and ${\psi }_{j,k}(x)=2^{j/2}\psi (2^{j}x-k)$. For $f\in L^2(\mathbb{R})$, the wavelet series at a coarse level $j_0$ isThe series converges in the L2 norm. Its coarse part captures broad variation and successive wavelet levels add finer detail. Truncating at levels $j<J$ produces the orthogonal projection onto $V_J$; Parseval identity makes its squared approximation error the sum of the omitted squared coefficients. Merely square-integrable functions need not have pointwise convergence.

For the Haar wavelet, use the cell convention $I_{j,k}=(k{2}^{-j},(k+1)2^{-j}]$ and let $I_j(x)$ be the unique such interval containing $x$. The Haar scaling functions are $2^{j/2}{1}_{I_{j,k}}$, so the Haar projection isFor a merely locally integrable function this cell-average formula remains defined, even if a global $L^2$ orthogonal projection is unavailable. If $\Vert f^{\prime }{\Vert }_{\infty }=L$, the mean value theorem gives Lipschitz continuity and, since $|t-x|\le 2^{-j}$ on the cell,Thus the requested bound holds with $\boxed{c=\Vert f^{\prime }{\Vert }_{\infty }}$, by the Haar projection error for a Lipschitz function.

To estimate a density, replace each scaling or wavelet coefficient $\int f{\varphi }_{j,k}$ or $\int f{\psi }_{j,k}$ by the sample average of that basis function. The finite-resolution Haar density estimator is thereforeIt is the histogram on the dyadic cells, is nonnegative, and integrates to one. Its expectation is $K_{j}f(x)$. A density with bounded derivative is bounded: the Lipschitz density height bound gives $f(x{)}^2\le L$ by integrating the triangular lower envelope $(f(x)-L|t-x|{)}_{+}$. The case $L=0$ cannot be a probability density on the whole real line. Hence $B=\Vert f{\Vert }_{\infty }<\infty$.

The cell probability is $p_j(x)={\int }_{I_j(x)}f\le B{2}^{-j}$. The sample count has a binomial distribution, soThe Cauchy-Schwarz inequality bounds the mean centered absolute deviation by the square root of this variance. Adding the projection bias givesChoose $j_n=\lfloor ({\log }_{2}n)/3\rfloor$, so $2^{j_n}\asymp n^{1/3}$. The two terms have the same order, andThis is a bias-variance tradeoff: refining the cells decreases the averaging bias but increases the sampling variance.

The Haar projection averages this normal distribution density on each cell; the finer cells follow its variation more closely. A Haar density estimator replaces these exact cell probabilities by empirical frequencies and therefore also introduces sampling noise.

Use several complementary Markov chain Monte Carlo convergence diagnostics, monitoring both $p$ and $\beta$ rather than judging the chain solely by its length:

A million iterations and stable-looking plots do not prove convergence. Agreement across dispersed chains, exploration of all visible modes and adequate effective sample size of a Markov chain provide stronger evidence. Estimate the Monte Carlo standard error using the chain's autocorrelation; the independent random variables formula from 3(b)(ii) does not apply directly to these dependent draws.

Cecil Frank Powell's 1950 lecture illustrates the successive decays of pions and muons through their tracks and explains why the nearly fixed secondary muon range, allowing for range straggling, supports a single neutral decay partner. He describes its identification as a neutrino tentatively. The neutral particle itself leaves no recorded track. He contrasts this decay with the nuclear reactions caused by stopped negative pions, connecting the latter with the nuclear force.^[ref]

Here is a modern special relativity derivation for the dominant leptonic pion decay, assuming a free pion at rest, a massless muon neutrino, and no emitted photon. Write $m_{\pi }$ and $m_{\mu }$ for the pion and muon masses. By conservation of momentum the daughter momenta are opposite with equal magnitude $p$. By conservation of energy and the energy–momentum relation,Substitute $E_{\mu }=m_{\pi }{c}^2-pc$, square, and cancel $p^2{c}^2$. This givesThe resulting $p$ is fixed, although the muon's direction is not set by the incoming stopping track. Thus the kink angle relative to that earlier track is not the angle between the two daughters: in the pion rest frame, the daughters are back to back. A neutral-partner arrow in a diagram represents inferred momentum, not an observed string of grains.

For an original calculation, adopt rounded input values $m_{\pi }{c}^2=139.57\mathrm{MeV}$ and $m_{\mu }{c}^2=105.66\mathrm{MeV}$. They give $pc=29.79\mathrm{MeV}$, $T_{\mu }=4.119\mathrm{MeV}$ and $E_{\nu }=29.79\mathrm{MeV}$. Their sum satisfies $T_{\mu }+E_{\nu }=(m_{\pi }-m_{\mu })c^2=33.91\mathrm{MeV}$. These are rounded calculation inputs and outputs, not a fit to the 1947 plates.

At fixed material and particle identity, a fixed initial kinetic energy suggests a narrow particle range distribution broadened by range straggling and measurement uncertainty. The synthetic example convolves a single chosen range with a normal distribution; a second example superposes two such chosen ranges. It explains why repeated comparable stopping distances can be informative, without pretending to extract a historical spectrum.

The decay equations do not identify the neutral partner as a neutrino on their own: a massless photon would satisfy the same energy and momentum equations. Nor does any isolated kink establish the pion's identity. The inference gains force from calibrated particle range, track grain density, repeated decay patterns and independent particle properties. Historical particle names should not obscure the distinction: a muon is a lepton, whereas a pion is a meson.

A protein is a biological molecule made of one or more polypeptide chains: ordered amino acid residues joined by peptide bonds. Biological translation assembles a chain in the order specified by messenger RNA codons. Protein folding then brings parts of that chain into spatial relationships that support its function. See Cooper, The Cell: protein composition and structure. These processes can overlap in a biological cell; the sequence-to-shape explanation does not require waiting until biological translation finishes before any folding begins. See Cooper, The Cell: protein folding and processing.

The useful connection is from information to physical work. A protein's protein primary structure records an order; its protein tertiary structure can bring distant amino acid residues together at an active site. An enzyme uses such an arrangement to recognize a substrate and accelerate a chemical reaction. Other proteins serve as receptors, membrane transport proteins or structural material. For example, actin assembles into filaments whose mechanical properties can be described by biopolymer mechanics. See Alberts et al., Molecular Biology of the Cell: protein function and binding.

Order matters beyond composition. Let A stand for alanine and M for methionine, and read from the N-terminus to the C-terminus. The illustrative strings AMAMAMAMAMAM and AAAAAAMMMMMM each contain exactly six A and six M amino acid residues. Each has $12-1=11$ peptide bonds when made into one unbranched polypeptide chain. In the first string all eleven neighboring pairs have different letters; in the second only the pair at positions 6 and 7 does. A composition histogram therefore loses information about which amino acid residues are neighbors. Their arrangements can affect protein folding and function; these short invented strings neither specify a known functional protein nor establish what shape either would adopt.

Protein structure is a moving arrangement, not a permanently rigid outline. Substrate binding can change an enzyme's shape through induced fit, and a functional protein can include flexible regions. Sequence, surroundings and interacting molecules must therefore be considered together. See Alberts et al.: binding, conformational changes and protein function.

A Q-Q plot is a scatter plot pairing quantiles at the same probability levels. For a statistical sample of size $n$, sort the observations into order statistics $x_{(1)}\le \cdots \le x_{(n)}$. Choose plotting positions $p_i$ and a reference quantile function $Q_0$, then plotHere the horizontal coordinate is a reference value, and the vertical coordinate is an observed value; neither axis is the probability $p_i$. The displayed plotting positions are our chosen convention, placing every level strictly between zero and one. They are not a claim that the $i$th order statistic equals that population quantile. For two statistical samples, use sample quantiles at matching levels, with a stated interpolation convention when their sizes differ. ^[ref]

As a computed example, take $n=19$ and the standard normal quantiles $z_i={\Phi }^{-1}(p_i)$, where $\Phi$ is the standard normal cumulative distribution function. Construct the ordered values $a_i=10+2z_i$. At ranks $1,10,19$, the plotting positions are $1/38,1/2,37/38$, the reference quantiles are approximately $-1.937932,0,1.937932$, and the constructed values are approximately $6.124137,10,13.875863$. Every point lies on $a=10+2z$ by construction. These 19 values are deliberately chosen, not random draws or real measurements.

The usefulness of a Q-Q plot is that it turns a comparison of probability distributions into geometry: if a reference random variable $Z$ is transformed into $X=\mu +\sigma Z$ with $\sigma >0$, its quantile function satisfies $Q_X(p)=\mu +\sigma Q_Z(p)$. This follows because a positive scaling preserves ordering. Thus the location-scale family produces a straight population Q-Q plot, and an approximate sample line suggests a compatible shape over the observed range. Its intercept describes location and its slope describes scale. The identity line requires the same location, scale and units on both axes; even then its displayed angle is 45 degrees only with equal axis scales. Curvature is often more informative than a histogram because it shows which quantiles depart from the reference. ^[ref]

A return period expresses how rare a threshold exceedance is in a specified time block. Let $M_j$ be the sample maximum in block $j$, fix a threshold $u$, and suppose $p=\mathbb{P}(M_j>u)>0$ is the same for every block. The conventional return period is $T=1/p$ blocks; blocks of duration $\Delta$ give a time of $\Delta /p$. Thus an annual exceedance probability $p=0.01$ means a 100-year return period. This names a frequency scale, not a schedule or a guarantee of one exceedance in each century. The annual convention and the misleading “once every 100 years” interpretation are discussed in USGS: the 100-year flood.

To derive a waiting-time interpretation, assume the exceedance indicators $B_j=1_{\{M_j>u\}}$ are independent and identically distributed random variables with the Bernoulli distribution of parameter $p$. Define $W=\min \{j\ge 1:B_j=1\}$, counting the successful block as well as all preceding blocks. The first $k-1$ Bernoulli trials must fail and the $k$th must succeed, so independence gives the geometric distributionThe expected value can also be read directly from the geometric series: $\mathbb{E}[W]={\sum }_{n=0}^{\infty }\mathbb{P}(W>n)={\sum }_{n=0}^{\infty }(1-p{)}^n=1/p$. This counts blocks from the starting boundary, not the exact time of an exceedance within its block. Counting only failed blocks instead would give expected value $T-1$. The waiting law and its memorylessness of the geometric distribution are developed in Kyle Siegrist, Random Services: the geometric distribution.

For a horizon of $n$ complete years, at least one exceedance is the complement of no exceedances. Under the same independence and constant-$p$ assumptions,For the toy choice $p=0.01$, this gives $9.6\%$ in 10 years, $26.0\%$ in 30 years, $39.5\%$ in 50 years, and $63.4\%$ in 100 years. Even after 100 years there is a $36.6\%$ chance of no exceedance. These numbers are exact model calculations rounded to one decimal place, not measured frequencies. The median waiting count is 69 years, since $1-0.99^{68}<1/2\le 1-0.99^{69}$; the expected value is 100 years. A mean and a median answer different questions.

The exceedance count $N_n={\sum }_{j=1}^n{B}_j$ has the binomial distribution under independence, with expected value $np$. Thus $N_{100}$ has expected value one, although its probability of being at least one is only $63.4\%$: some realizations contribute several exceedances. For $0<p<1$, the memorylessness of the geometric distribution gives $\mathbb{P}(W>m+n\mid W>m)=(1-p{)}^n$. A long quiet spell does not make the next independent year's exceedance overdue, and an exceedance this year does not force a quiet interval. Two specified consecutive years both exceed with probability $p^2=0.0001$ in this toy model.

A reproducible tabletop experiment makes the assumptions tangible. Put 100 identical slips numbered 1 to 100 in a bag; after thoroughly mixing, draw one and record whether it is 100. Replace the slip and mix again before every draw. Treat each draw as one toy year, so the exceedance indicator is a Bernoulli random variable with $p=0.01$, provided the sampling is uniform and successive draws are independent. Repeat complete 30-draw runs and record the fraction containing at least one 100; separately repeat runs stopped at the first 100 and record their waiting counts. The first fraction targets $1-0.99^{30}$; the waiting-count histogram targets $0.99^{k-1}(0.01)$. Replacement keeps $p$ fixed, mixing is intended to support independence, and repeated runs expose sampling variation. This is a proposed demonstration of the toy model; no experimental results are asserted here.

Stationarity supports a time-invariant annual probability distribution, but does not imply independence. For an extreme counterexample, draw just one Bernoulli random variable $B$ of parameter $0.01$ and set $B_j=B$ for every year. This is a stationary process, yet the probability of any exceedance in every finite horizon is $0.01$; from an arbitrary starting boundary the wait is infinite with probability $0.99$. The reciprocal marginal frequency $T=100$ therefore need not equal that forward waiting expected value. With equal marginal probabilities $p$ and arbitrary dependence, only the general bounds $p\le \mathbb{P}(N_n\ge 1)\le \min (1,np)$ follow, the upper bound being the union bound. Linearity of expectation still gives $\mathbb{E}[N_n]=np$ without independence. Mere zero correlation does not restore the product formula; even pairwise independence does not imply joint independence. If annual probabilities change to $p_j$, independence instead gives $\mathbb{P}(N_n\ge 1)=1-{\prod }_{j=1}^n(1-p_j)$, and one fixed return period no longer describes all years.