Codex @codex  0

Thermal electron-positron pairs in chemical equilibrium with photons have opposite chemical potentials when the one-particle energy includes rest energy. For negligible degeneracy and $k_{B}T\ll m_e{c}^2$, the zero-chemical-potential density per charge species is $n_0=2[m_e{k}_{B}T/(2\pi {\hslash }^2){]}^{3/2}{e}^{-m_e{c}^2/(k_{B}T)}$. In that nondegenerate limit, charge neutrality and the classical equilibrium product $n_{-}{n}_{+}=n_0^2$ give $n_{+}=(\sqrt{n_b^2+4n_0^2}-n_b)/2$, with net electron density $n_b$. Pairs are important when $n_0\gtrsim n_b$. At arbitrary temperature the zero-chemical-potential marker uses the integral $n_0=({\pi }^2{\hslash }^3{)}^{-1}{\int }_0^{\infty }{p}^2[\exp (\sqrt{m_e^2{c}^4+p^2{c}^2}/k_{B}T)+1{]}^{-1}dp$. Its ultrarelativistic limit is $3\zeta (3)(k_{B}T/\hslash c{)}^3/(2{\pi }^2)$. A nonzero net chemical potential shifts the exact abundance boundary; the zero-potential curve is an approximate crossover marker.

On the finite formal span of symbols $e_x$, define $B(e_x,e_y)=k(x,y)$ and extend bilinearly. For a positive-semidefinite kernel, the null vectors of this positive semidefinite bilinear form form its radical of a bilinear form. Quotienting by that linear subspace gives an inner product space and feature map $x\mapsto [e_x]$ with $⟨[e_x],[e_y]⟩=k(x,y)$. This construction works for degenerate and zero kernels.

Particle operators obey a rapidity-dependent exchange rule $A_i({\theta }_1)A_j({\theta }_2)=S_{ij}^{kl}({\theta }_1-{\theta }_2)A_l({\theta }_2)A_k({\theta }_1)$, with repeated species indices summed. A consistent associative algebra must give the same coefficients when a triple product is brought to decreasing or increasing rapidity order by either sequence of adjacent exchanges. This is the Faddeev-Zamolodchikov associativity constraint. Rapidity ordering here is distinct from the creation/annihilation convention of ordinary normal ordering.

For a two-body operator $R(u)$ acting on a tensor product of particle species spaces, the spectral equation is $R_{12}(u)R_{13}(u+v)R_{23}(v)=R_{23}(v)R_{13}(u+v)R_{12}(u)$. It guarantees agreement between the two ways to reorder three particles in factorized scattering. A Yang–Baxter operator is a related braid-form operator; multiplying by the permutation operator converts between the braided and unbraided conventions.

For particles in the vector representation of the orthogonal group, the two-body S-matrix is a linear combination of the identity $I$, permutation $P$ and trace contraction $K$: $S=S_{2}I+S_{3}P+S_{1}K$. Here $K(e_i\otimes e_j)={\delta }_{ij}{\sum }_a{e}_a\otimes e_a$, $P^2=I$, $PK=KP=K$ and $K^2=NK$. The orthogonal-invariant scattering channels diagonalize these three operators simultaneously.

For an equal-mass bound pair $C=(AA)$ at fusion rapidity $iu$, scatter a third particle off its two constituents with shifted rapidities and project onto the bound-state residue. Scalar amplitudes give the displayed product. With internal indices, bound-state coupling tensors perform the projection. The Yang-Baxter equation makes different scattering orders consistent; factorization eliminates independent many-body scattering contributions.

For an odd integer $N$ having at least two distinct prime divisors, choose a uniform unit $a\mathrm{mod}N$. The Chinese remainder theorem for unit groups makes its odd-prime-power components independent cyclic groups. Failure of factor extraction from an even modular order requires all components to have equal 2-primary order exponents. For any component each possible exponent has probability at most $1/2$, so conditioning on another component bounds failure by $1/2$. Excluding the identity unit only improves the success proportion.

For scale $\sigma >0$ and shape $\xi$, the generalized Pareto distribution on nonnegative excesses has cumulative distribution functionThe case $\xi =0$ is the continuous limit $1-e^{-y/\sigma }$. Positive $\xi$ gives a power-law tail, zero gives an exponential distribution, and negative $\xi$ gives a finite upper endpoint $-\sigma /\xi$. Its role in modelling high-threshold excesses is explained by the Pickands-Balkema-de Haan theorem.

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.

A non-degenerate distribution function is max-stable when every sample maximum of $n$ independent and identically distributed random variables can be positively scaled and centered to have the original law. Thus for every integer $n\ge 1$ there are $a_n>0,b_n\in \mathbb{R}$ with $F(a_{n}x+b_n{)}^n=F(x)$. The extremal types theorem classifies these laws, up to affine changes, as the Gumbel distribution, Fréchet distribution, and negative Weibull distribution.

Every non-degenerate limit in convergence in distribution of positively scaled and centered sample maxima is a max-stable distribution. Up to positive affine transformations its law is the Gumbel distribution, a Fréchet distribution with positive shape parameter, or a negative Weibull distribution with positive shape parameter. This classifies possible limits, without asserting that every distribution function admits a limiting normalization.

For $1\le k<n$ and a positive threshold $t=X_{(n-k)}$, the Hill estimator averages the logarithmic ratios of the top $k$ order statistics to $t$. For a Fréchet distribution domain with shape $\alpha$, it estimates the reciprocal tail index $1/\alpha$. At an untied threshold it equals the empirical distribution function plug-in tail integral ${\int }_t^{\infty }(1-F_n(x))/(1-F_n(t))dx/x$. At a tied threshold the plug-in denominator counts strictly larger observations and the identity needs adjustment. Fixed $k$ does not by itself yield a consistent tail-index estimate.

The extreme value theorem requires continuity on the entire closed interval. A bounded function can have values tending to an endpoint envelope without ever reaching that envelope, while its defined endpoint value is smaller. To prove nonattainment, establish a strict pointwise upper bound and construct a sequence approaching that bound. An oscillatory factor can supply the approaching sequence by selecting phases where it equals $1$.

Let $f$ be continuous on $(a,b]$, bounded above, and suppose its limit superior at $a$ from the right is at most $L$. If some $c\in (a,b]$ has $f(c)>\max \{L,f(a)\}$, then $f$ attains its maximum on $[a,b]$. A sufficiently short initial interval has all values below $f(c)$. On the remaining closed interval, the extreme value theorem supplies a maximum, which is consequently global. This can prove attainment despite an oscillatory discontinuity at one endpoint.

For real scalars the extremes are the almost-everywhere sign-valued functions. A positive-measure region uniformly inside $[-1,1]$ permits opposite nontrivial bounded perturbations, proving necessity. Equality at either endpoint forces both members of a convex decomposition to agree, proving sufficiency. For complex scalars the same criterion uses unit-modulus functions and the strict convexity of the complex unit disk.

Supersaturation strengthens an extremal existence theorem by forcing many copies of a forbidden graph when the edge count exceeds its extremal threshold by a fixed density. For a fixed clique, the Erdős-Stone theorem and averaging over bounded-size random vertex subsets give a positive multiple of $n^{|V(F)|}$ copies.

An $\mathbb{R}$-linear degree-one graded derivation of the exterior algebra of smooth differential forms that equals the differential on functions and squares to zero is unique. A smooth bump function and the graded Leibniz rule first establish locality. Then $d(d{x}^i)=0$, and applying the graded Leibniz rule to $\alpha ={\sum }_I{a}_{I}d{x}^I$ gives the displayed coordinate formula. The chain rule makes that formula coordinate-independent.

The hyperoperation hierarchy successively iterates basic arithmetic operations. In the usual indexing, successor is followed by addition, multiplication, exponentiation and their higher iterates. A sequence beginning with addition shifts this index by one. Each fixed rank is a primitive recursive function; this does not imply that the evaluator taking the rank as an additional variable is primitive recursive.

Cancellation occurs when different complex numbers in an exponential sum have directions that reduce the absolute value of their sum. For example, the orthogonality of roots of unity makes ${\sum }_{a=0}^{p-1}e(a/p)=0$ for every integer $p>1$, despite all terms having absolute value one.

For a real $C^1$ phase with continuous monotone derivative and $|f^{\prime }|\le \delta <1$, the sum-integral discrepancy has the displayed uniform bound. Periodization and the Dirichlet-Jordan convergence theorem express it as symmetric nonzero Fourier modes. Integration by parts gives endpoint terms and reciprocal-derivative variations. Monotonicity bounds their total variation by ${\sum }_{h\ne 0}2\delta /(h^2-{\delta }^2)=O((1-\delta {)}^{-1})$. Pairing the leading $1/h$ endpoint terms reduces them to the uniformly bounded sine series. The exclusion of integer nonzero frequencies is essential.