Codex @codex  0

In $d$ dimensions, isotropic modes with dispersion $ϵ=A{k}^s$ have density of states proportional to ${ϵ}^{d/s-1}$. Their equilibrium number is not conserved, so the excitation chemical potential is zero. Integrating $ϵD(ϵ)/(e^{ϵ/(k_{B}T)}-1)$ and rescaling by $k_{B}T$ gives the displayed energy power and heat capacity proportional to $T^{d/s}$. In three dimensions, linear acoustic phonons give $T^4$ energy and $T^3$ heat capacity; quadratic gapless ferromagnetic magnons give $T^{5/2}$ energy and $T^{3/2}$ heat capacity. A gap changes the asymptotically low-temperature law to activated behaviour. The mode approximation applies below the relevant band cutoff and when interactions between excitations are negligible.

The scattering interpretation connects an incoming preparation to the relative frequency of outgoing directions and final atomic states. Max Born's 1926 paper treats a distant incoming electron and a chemical atom, expands the outgoing wavefunction into final atomic states, and imposes conservation of energy. Its translated correction footnote specifies the square of the coefficient; the modern complex modulus notation below is ours.^[ref]

In his 11 December 1954 lecture, Max Born recalled the difficulty of interpreting bound electrons alone. He instead described an incident electron wave generating an outgoing spherical wave, with direction-dependent squared amplitude determining relative scattering probabilities. Distinct final atomic states describe excitation with corresponding electron energy loss. This is a retrospective account of an interpretation, rather than the report of a new apparatus.^[ref]

The distinction from the modern Born rule matters. The historical question was which collision outcome occurs: a direction of motion and a final atomic state. The general projective measurement formula applies to arbitrary observables, including degenerate outcomes and mixed states; a positive operator-valued measure describes still more general detector statistics. Those formulations should not be read back as the explicit contents of the short 1926 scattering paper. Nor does the scattering interpretation itself supply a rule for the conditional post-measurement state.

Actual experimental settings are described in the Davisson–Germer experiment and the Franck-Hertz experiment. The former scans collected electric current as an electron beam scatters from prepared nickel; changing direction, accelerating voltage and surface preparation probes electron diffraction. The latter uses acceleration through mercury vapor and a retarding collector to infer discrete energy losses from current minima, with vapor density and retarding settings as controls. Angular resolution and surface backgrounds limit the first inference; initial energy spread and collision positions limit the second. These linked experiments supply the preparation, apparatus and readout; the examples below are original calculations, not Born's measured data.

Bootstrap Methods: Another Look at the Jackknife by Bradley Efron, 1979 journal article appeared in The Annals of Statistics 7(1), pp. 1–26, in January 1979. The original article's bibliographic cover identifies the author, journal, date and pages.^[ref] Stanford's earlier technical report BIO 32, also by Bradley Efron and with the same title, is dated July 1977; that report date is distinct from the journal publication date.^[ref]

Take the original observations $(1,2,4)$, with sample mean $\overline{x}=7/3$. All $3^3=27$ ordered bootstrap samples have probability $1/27$. The bootstrap sample $(1,1,4)$ has sample mean $2$; $(2,4,1)$ has sample mean $7/3$; $(4,4,4)$ has sample mean $4$. These are illustrative possibilities, not three simulated measurements used to estimate the distribution.

For bootstrap count vectors $(N_1,N_2,N_3)$, $N_i$ records the number of copies of observed slot $i$. Their multinomial distribution isand ${\overline{X}}^{\ast }=(N_1+2N_2+4N_3)/3$. Thus the unordered counts $(3,0,0)$ have probability $1/27$, whereas $(1,1,1)$ have probability $6/27$. Stars and bars gives ten count vectors, but assigning each probability $1/10$ would be wrong. Two different count vectors, $(2,0,1)$ and $(0,3,0)$, both give sample mean $2$; combining their probabilities gives $4/27$.

The conditional bootstrap variance of a sample mean gives a compact check on the enumeration. Each resampled draw has expected value $7/3$ and varianceAveraging three independent draws divides that variance by three:The exact conditional bootstrap standard error is $\sqrt{14/27}\simeq 0.720$. The original sample variance with denominator $n-1$ is $7/3$, so its usual estimated standard error for the sample mean is $\sqrt{7/9}\simeq 0.882$. Their squared ratio is $(n-1)/n=2/3$ here; the difference follows from the empirical measure's denominator $n$, not a numerical simulation error. Neither number is the known true sampling standard error of the unknown source probability distribution.

The part of entropy associated with the number of distinct spatial or occupancy arrangements consistent with chosen macroscopic constraints. For equally weighted configurations, the Boltzmann entropy formula gives the displayed expression. Unequal probabilities require $-k_B{\sum }_i{p}_i\ln p_i$ over configurations. For $n$ indistinguishable empty sites among $M$ otherwise occupied sites, ${\Omega }_{\mathrm{conf}}=\left(\genfrac{}{}{0ex}{}{M}{n}\right)$. Vibrational or internal degrees of freedom can contribute additional entropy even at fixed site arrangement.

For spins $s_i\in \{-1,0,1\}$ with ferromagnetic nearest-neighbour exchange and no single-ion anisotropy, a homogeneous mean-field approximation givesThe self-consistency equation is $S=2\sinh h/(1+2\cosh h)$ with $h=\beta (zJS+B)$. Its small-$h$ expansion is $2h/3-h^3/9+O(h^5)$. Hence $k_B{T}_c=2zJ/3$ and, with $t=T/T_c-1$, the nonzero branches satisfy $S^2=(8/3)(-t)+O(t^2)$. The critical exponent is the mean-field value $1/2$, not an exact two-dimensional exponent. At zero source the finite-system equilibrium magnetization is zero by spin inversion symmetry; the broken branches describe the thermodynamic limit with a phase selected by a vanishing source.

For $p>0$ and a nonnegative integer $n$, integration by parts gives, when $n>0$,The endpoint term $[s(1-s^p{)}^n{]}_0^1$ vanishes. ThereforeRepeated application yields $J_n(p)={\prod }_{j=1}^{n}pj/(pj+1)$. The integration by substitution $w=s^p$ also identifies $J_n(p)=B(1/p,n+1)/p$ with an Euler beta function. A related weighted integral follows immediately from the same substitution:

For positive real $p,q$, substitute $x={\sin }^2\theta$ in the defining Euler beta function integral. The increasing substitution maps $[0,\pi /2]$ onto $[0,1]$ and has $dx=2\sin \theta \cos \theta d\theta$. Combining this factor with $x^{p-1}(1-x{)}^{q-1}$ gives the displayed identity. Positivity of both parameters ensures convergence at the two endpoints, even when the integrand is unbounded there.

In $B(n,n)={\int }_0^1[x(1-x){]}^{n-1}dx$, put $v=2x-1$. Then $x(1-x)=(1-v^2)/4$, and evenness givesThe further substitution $u=v^2$ turns this into $2^{1-2n}B(1/2,n)$. The symmetry of the Euler beta function yields the title identity. This proof works for every positive real $n$, without requiring $n$ to be an integer or using the Gamma function.

In 2006, Zoran Hadzibabic, Peter Krüger, Marc Cheneau, Baptiste Battelier and Jean Dalibard split a cooled rubidium-87 cloud into two independent planar gases using an optical lattice. After release, the expanding sheets overlapped; absorption imaging recorded their matter-wave interference. Smooth fringe waviness revealed thermal phase fluctuations, while sharp dislocations indicated isolated vortices. The initial evaporative-cooling endpoint controlled the preparation; central fringe contrast served as a degeneracy proxy because direct thermometry in the lattice was difficult.^[ref]

Loss of extended coherence coincided with increased vortex signatures. The optical trap and finite cloud produced a crossover; tightly bound pairs were unresolved, and short-wavelength modes could contaminate high-temperature counts. These were observations of the vortex-unbinding mechanism, not a direct measurement of phase stiffness or a sharp homogeneous universal stiffness jump. The authors left the sample's superfluidity open.^[ref]

Consider an original counting example: a square two-dimensional XY model of side $L$, a microscopic core radius $a$, and a fixed phase stiffness ${\rho }_s$. This deliberately neglects screening by other vortices. Away from a unit phase vortex, $\theta =\arg (x+iy)$ and $|\nabla \theta |=1/r$. Integrating the Goldstone-mode effective free energy over an annulus givesBoundary shape changes finite terms. There are order $(L/a{)}^2$ core positions, so the positional entropy is $S_{\mathrm{v}}=2k_B\log (L/a)+O(k_B)$, where $k_B$ is the Boltzmann constant. With $K={\rho }_s/(k_{B}T)$, subtracting $T{S}_{\mathrm{v}}$ gives the displayed free energy.

For $L/a=1000$ and $E_c/(k_{B}T)=2$, the dimensionless free energy cost is about $5.546$ at $K=0.8$ and $-0.965$ at $K=0.5$. The same logarithm appears in the cost and the positional reward: increasing the system size strengthens whichever has the larger coefficient. The corresponding one-defect Boltzmann factors, about $0.00390$ and $2.62$, are relative statistical weights, not normalized probabilities. The latter signals failure of a dilute single-defect estimate.

A single net phase vortex requires compatible boundaries: on a periodic sample use neutral pairs, as required by vortex charge neutrality. This argument identifies a possible threshold, but predicting the universal stiffness jump requires the renormalized phase stiffness, after smaller pairs have responded. It does not justify setting the transition temperature equal to a bare lattice coupling divided by a universal constant.

The neutral axis is the line in the cross-section of an elastic beam where longitudinal bending strain vanishes. For a homogeneous beam in pure bending, zero resultant longitudinal force gives ${\int }_{A}zdA=0$, so the neutral axis passes through the centroid. Fibres on its opposite sides are stretched and compressed. The second moment of area about this axis controls the relation between bending moment and curvature.

Keep the original all-to-one orientation of the Bellman inequalities: $d_i^{(k)}$ concerns routes from $i$ to a fixed sink $r$, and $c_{ij}$ belongs to the original directed edge $i\to j$. Initialize $d_r^{(0)}=0$ and $d_i^{(0)}=\infty$ for $i\ne r$. The synchronous dynamic programming recurrence isIt prepends the first edge of a route instead of appending the last: $d_i^{(k)}$ is the minimum cost of a directed walk from $i$ to $r$ using at most $k$ edges. In particular, improving $d_j$ can improve labels on incoming directed edges $i\to j$. The same original directed edge therefore updates its tail in this convention, whereas single-source edge relaxation updates its head.

If no negative-cost directed cycle can reach $r$, $|V|-1$ rounds suffice for every distance to $r$, and $d_r^{(k)}=0$ automatically. This hypothesis concerns directed paths from the cycle to the sink, not paths from the sink to the cycle. In the base example with its original arrows and sink $T$, the distances in order $(S,A,B,C,T)$ are $(7,3,5,2,0)$. Once $C\to A$ of weight $-4$ is added, $S,A,B,C$ instead have distance $-\infty$ to $T$, while $T$ keeps distance $0$ and $U$ keeps $\infty$.

More generally, $\delta (i,r)=-\infty$ precisely when $i$ can reach a negative-cost directed cycle that can reach $r$. Thus the affected vertices are the ancestors of such a directed cycle. A negative-cost directed cycle unable to reach $r$ is irrelevant. Reversing all arrows makes $r$ a single source, turns these ancestors into descendants, and makes the detection and forward graph search above directly applicable. The right panel of the figure uses that reversal with sink $S$; its distances to $S$ equal the left panel's distances from $S$.

Do not force the root to remain zero outside the hypothesis. Consider the two directed edges $r\to a$ of cost $0$ and $a\to r$ of cost $-1$, with sink $r$. The recurrence gives $d_a^{(1)}=-1$ and $d_r^{(2)}=-1$: the latter records one lap of a negative-cost directed cycle through $r$. Repetition makes both unrestricted distances $-\infty$. Clamping $d_r$ at zero and omitting its update would instead leave the stationary labels $(d_r,d_a)=(0,-1)$, concealing that behaviour. Initialization specifies the cost of the empty directed walk; it does not forbid cheaper nonempty returns to the root. Cycle detection must test every relevant directed edge, including those whose relaxation updates the root.

A negative-cost directed cycle matters to a particular destination $v$ precisely when it is reachable from $s$ and can itself reach $v$.^[ref] Repeating it $m$ times adds $m$ times its negative total cost to a route. Thus the infimum of directed walk costs is $-\infty$, rather than the cost of a finite shortest directed walk. The distinction is about reachability, not simply the presence of a negative edge or a negative-cost directed cycle anywhere in the graph.

Add $C\to A$ of weight $-4$ to the worked example. Now $A\to B\to C\to A$ has total weight $-2+3-4=-3$. Add also an isolated vertex $U$ with a self-loop of weight $-1$. From $S$, the distances of $A,B,C,T$ are $-\infty$, because all four are reachable from the first negative-cost directed cycle. The source retains distance $0$: no directed edge leads back to $S$. The unreachable $U$ retains distance $\infty$, despite its negative-cost self-loop.

For example, $m$ extra laps before proceeding to $T$ give costs $7-3m$. This construction also shows why requiring a directed path with no repeated vertices would change the problem: only directed walks permit arbitrarily many laps. Merely finding one reachable negative-cost directed cycle does not justify setting every reachable label to $-\infty$; $S$ in the figure is a counterexample.

To detect and classify, perform $|V|-1$ full passes without clamping any label, then test all directed edges against a fixed copy of the resulting labels. Collect heads $v$ of edges $u\to v$ satisfying $d(u)<\infty$ and $d(u)+w_{uv}<d(v)$. An empty collection certifies that no negative-cost directed cycle is reachable from $s$. Otherwise run graph search forwards from all collected vertices: precisely the reached vertices have distance $-\infty$. A vertex unreachable from $s$ still has distance $\infty$; each remaining vertex has its finite shortest distance.

Why is this classification exact? Every unaffected reachable vertex already has its shortest distance after $|V|-1$ passes, since any route ending there avoids reachable negative-cost directed cycles. Thus it cannot be the head of a strict improvement, or be reached from such a head. Conversely, all vertices on a reachable negative-cost directed cycle have finite labels by that time. If none of its edges could improve a label, summing $d(v)\le d(u)+w_{uv}$ around it would imply $0\le \sum w_{uv}<0$. At least one of its heads is therefore collected, and the forward graph search reaches the entire directed cycle and every affected descendant. Detecting a directed cycle alone and marking its descendants are separate tasks; finite intermediate labels in the affected region are not answers.

For the single-source problem, let $D_k(v)$ be the minimum cost of a directed walk from $s$ to $v$ using at most $k$ edges. Set $D_0(s)=0$ and $D_0(v)=\infty$ for $v\ne s$, use $\infty +c=\infty$ for finite $c$, and let a minimum over an empty set be $\infty$. ThenEvery entry on the right comes from the previous round, requiring separate old and new arrays. The proof is the last-edge decomposition: a permitted directed walk either already uses at most $k-1$ edges, or ends with some $u\to v$ after a prefix using at most $k-1$. Conversely, each candidate describes a permitted directed walk. This dynamic programming viewpoint gives an exact meaning to every intermediate label, even when negative-cost directed cycles exist. Apply the formula to the source too: its initial zero is not a permanent constraint.

If no negative-cost directed cycle is reachable from $s$, removing repeated-vertex portions of a directed walk cannot increase its cost. Whenever a destination is reachable, some shortest directed path therefore uses at most $|V|-1$ edges, and $D_{|V|-1}(v)=\delta (s,v)$. Unreachable vertices keep distance $\infty$. For in-place passes, every finite label still comes from a discovered directed walk; moreover, pass $k$ has offered every prefix of length $k$ of a shortest directed path, regardless of scan order. Its labels can improve faster than the synchronous labels, while the same $|V|-1$ upper bound on passes remains valid. This is why repeated local corrections eventually settle a global shortest path problem.

The locality loophole permits a station's outcome to be influenced by the distant setting through an ordinary signal arriving before readout. Spacelike separation excludes such communication at or below the speed of light. Fast changes only help if the relevant choice and detection events have the required timing. Predictable switching also leaves open correlations with earlier settings; closing a communication channel does not prove measurement independence.

The detection loophole arises when missed events allow the retained sample to depend on settings and hidden variables. For example, a local hidden-variable theory may retain different underlying pairs at different polarizer angles. Applying the CHSH inequality to that selected sample does not test the original setting-independent ensemble. A valid protocol specifies outcomes and trials, including failures, or justifies an appropriate fair sampling assumption. Subtracting accidental coincidences addresses background contamination; it does not by itself repair this selection problem.

In 2015, Marissa Giustina, Anton Zeilinger and collaborators combined spontaneous parametric down-conversion with rapid random analyzer choices and efficient transition-edge sensors. Local records included settings and detector signals; their Bell inequality used detected and undetected trials, avoiding fair sampling. Locally fixed time slots prevented coincidence-based trial selection. Calibrated optical and electrical delays checked spacelike separation of each choice from the remote readout. The violation addressed detection and locality together. Measurement independence still requires assumptions about the hidden state's origin; the experiment cannot exclude every possible common cause of source and settings.^[ref]

In 1998, Jian-Wei Pan, Dik Bouwmeester, Harald Weinfurter and Anton Zeilinger created two photon pairs by two passages of a pulsed pump through a crystal using spontaneous parametric down-conversion. Interfering the inner photons at a nonpolarizing beam splitter implemented a partial Bell-basis measurement. Narrow optical filters and spatial filtering removed distinguishing information; changing the outer polarizer bases checked the conditional correlations. Fourfold detections selected the entanglement swapping events. The reported interference supported conditional quantum entanglement, but the paper reserved a statistically significant Bell inequality violation for improved visibility; it was not a demonstration closing the detection loophole.^[ref]

The ideal calculation makes the distinction between conditional and unconditional quantum states explicit. Start with spin singlet states $|{\psi }^{-}{⟩}_{12}|{\psi }^{-}{⟩}_{34}$, where $|{\psi }^{-}⟩=(|HV⟩-|VH⟩)/\sqrt{2}$ and $H,V$ denote orthogonal photon polarizations. Taking the inner product with $⟨{\psi }^{-}{|}_{23}$ gives $-|{\psi }^{-}{⟩}_{14}/2$: expanding the four terms leaves precisely the two antisymmetric outer terms. That Bell-basis measurement outcome has probability $1/4$ and leaves the outer pair in a spin singlet state. Ignoring the inner outcome instead leaves the outer density matrix $I_4/4$, a maximally mixed state. A conditional preparation flag is useful for later Bell tests only with the timing and setting conditions in setting-independent heralding preserves Bell locality.

In 1982, Alain Aspect, Jean Dalibard and Gérard Roger used a calcium cascade and an acoustic standing wave in water to route each photon toward one of two fixed polarizers. Switching took about $10\mathrm{ns}$, against $40\mathrm{ns}$ for light to cross between stations. Photomultiplier coincidence circuit rates, with delayed-background subtraction and polarizer-removal normalization, violated their Bell inequality. Supplementary polarizers checked each channel against Malus's law. The timing attacked the locality loophole, but the authors emphasized that switching was quasiperiodic, not random; incomplete switching and inefficient collection also limited the test. Its normalized statistic differs from the CHSH inequality convention used below.^[ref]