With fixed covariates and independent new responses having the same marginal distributions as the training responses, expanding squared losses cancels their second moments. Independence makes $\mathbb{E}(Y_i^{\mathrm{new}}{\hat{Y}}_i)=\mathbb{E}{Y}_i\mathbb{E}{\hat{Y}}_i$, yielding the displayed identity. For a fixed linear smoother $\hat{Y}=HY$ with covariance ${\sigma }^{2}I$, it reduces to $2{\sigma }^2\mathrm{tr}(H)/n$, linking prediction optimism to effective degrees of freedom.

// Target: analysis.bigb

For fixed total solar-unit mass $m$ and conserved orbital angular momentum, conservative binary mass transfer preserves $K=P[m_d(m-m_d){]}^3$. Hence $P/m_d^2=K/[m_d^5(m-m_d{)}^3]$. Its logarithmic derivative is $-5/m_d+3/(m-m_d)$, vanishing at $5m/8$ with positive second derivative. The ratio diverges at both endpoints, so this is its global minimum. Comparing this minimum to a pre-giant bound $P_0$ tests whether any such conservative antecedent can overflow before the giant branch; satisfying it is necessary, not a proof of an entire evolutionary history.

If some $f_i$ is not injective, extend two distinct equal-image elements to tuples using common choices at all other coordinates; the product is not injective. If some $f_i$ is not surjective, extend a missing target element to a tuple; the product is not surjective. The axiom of choice supplies these extensions. Thus the set-product functor reflects isomorphisms between families whose coordinates are all nonempty.

For an elementary topos, existence of products in a category indexed by a fixed set is equivalent to existence of the corresponding coproducts in a category. The power-object monadicity equivalence ${\mathcal{E}}^{\mathrm{op}}\simeq {\mathcal{E}}^{PP}$ gives the forward direction because Eilenberg-Moore categories create limits. For the converse, the diagonal into the pointwise product category is a logical functor. A coproduct is its left adjoint; the adjoint lifting theorem for monad algebra functors, applied through power-object monadicity, then gives its right adjoint, namely the product. The required reflexive coequalizers on the algebra side are opposites of finite equalizers in the topos.

For $P=C(T^b+K{)}^{1/p}$ with $p=n+1$ and $b=4+n+m$, the logarithmic radiative temperature gradient is $(p/b)(1+K/T^b)$. At a marginal boundary with an efficient ideal-gas convective envelope, the Schwarzschild criterion equates it to $(\gamma -1)/\gamma$. Hence $K=T_b^b[(b/p)(\gamma -1)/\gamma -1]$. The notation $K=T_0^b$ with real positive $T_0$ requires a nonnegative bracket. Vanishing $p$ or $b$ needs the corresponding logarithmic integration instead of this power form.

For $U_m^{n+1}=(1-2\mu )(U_m^n-U_{m+1}^n)+U_{m+1}^{n-1}$, write an amplification root as $G=e^{i\theta /2}\lambda$. Its equation is ${\lambda }^2+2i(1-2\mu )\sin (\theta /2)\lambda -1=0$. The roots have modulus one and a positive frequency-uniform separation exactly for $0<\mu <1$, giving L2 norm stability through a uniformly bounded diagonalization. At either endpoint the Nyquist symbol has a repeated unit root and a Jordan block, producing linear growth. The normalized local truncation error is generally second order; at $\mu =1/2$ and $1$ exactly sampled characteristics solve the recurrence, although the latter parameter is unstable for arbitrary perturbations.

If a model configuration leaves a parameter absent from its likelihood function, giving that parameter an independent flat improper prior makes the posterior distribution normalization infinite whenever the configuration has positive prior distribution mass. Integrate first over that parameter: a positive constant likelihood function factor is repeated over all of $\mathbb{R}$. This occurs for the second segment mean of a Gaussian change-point detection model when the proposed split is after the final observation. There is no posterior distribution or valid Gibbs sampler for that joint kernel. A proper prior distribution on the unused parameter is necessary if the no-change configuration is retained.

In a hierarchical Bayesian model, replication conditional on fitted observation-level random effects checks the sampling layer. Replication with fresh random effects drawn from their population law also checks the population mean and variation. To assess a dose-response curve, sample the global parameters from their posterior distribution, draw fresh effects for new plates at each existing dose, and compare replicated means, spreads and trend discrepancies with the observed values. Reusing the fitted plate effects can conceal a misspecified mean curve by reproducing deviations those effects already absorbed.

When the prior odds of a real effect are $R$, a study's Type I error is $\alpha$, and its statistical power is $1-\beta$, a positive report updates those odds to $R(1-\beta )/\alpha$. This follows directly from Bayes' theorem. A small false-positive rate does not itself make the effect's posterior probability high: the prior odds and power also matter. The posterior exceeds one half exactly when $R>\alpha /(1-\beta )$.

Write a loop as $z^w{e}^{ih}$ with $h$ smooth real periodic and $h_0$ its mean. For the level-one representation with modes filled below zero and $\omega (h,k)=(2\pi {)}^{-1}{\int }_0^{2\pi }{h}^{\prime }k$, choose implementers $U(w,h)=S^w{e}^{iA(h)}$, where $S$ increases charge by one, $SQ{S}^{\ast }=Q-I$, and $[A(h),A(k)]=i\omega (h,k)I$. Their product differs from $U(w+v,h+k)$ by the displayed two-cocycle. Its phase is bilinear, which verifies the cocycle identity; integer $v$ makes it independent of the $2\pi$ ambiguity in $h_0$. Rephasing implementers changes it by a group coboundary.

Let $A$ be a real positive-definite matrix and minimize the displayed quadratic function over all of ${\mathbb{R}}^n$. Its gradient is $Ax-b$, so its only stationary point solves the linear system $A{x}_{\ast }=b$. The matrix is an invertible matrix, making this solution exist and be unique. Completing the square around that solution proves the stronger global statement:The quadratic function is strictly convex, and its level sets above the minimum are translated ellipsoids. Positivity therefore turns solving a linear system into locating the bottom of a bowl.^[ref]

For the opening matrix $A=\left(\begin{array}{cc}3& 1\\ 1& 3\end{array}\right)$, take $b=(1,1{)}^T$ and $c=0$. Then $A^{-1}=\frac{1}{8}\left(\begin{array}{cc}3& -1\\ -1& 3\end{array}\right)$, $x_{\ast }=(1/4,1/4{)}^T$, and $f(x_{\ast })=-1/4$. Every displacement $h$ raises the value by $\frac{1}{2}{h}^{T}Ah$; along the unit eigenvectors $e_{+}$ and $e_{-}$ the increases are respectively $2s^2$ and $s^2$ for displacement $s{e}_{+}$ or $s{e}_{-}$.

For a singular positive semidefinite matrix, a solution of $Ax=b$ is still a global minimizer, but adding any kernel vector gives another. If $b$ is outside the image of a linear map defined by $A$, some kernel vector $v$ has $b^{T}v\ne 0$, and $f(sv)=c-s{b}^{T}v$ is unbounded below. For an indefinite quadratic form, a negative eigenvalue gives a direction along which the quadratic term tends to $-\infty$ regardless of $b$. Thus a stationary point alone does not establish a minimum. The same energy-difference identity extends to the quadratic variational principle for a symmetric positive operator, with additional existence hypotheses in infinite dimension.

For a real positive-definite matrix $A$ in finite dimension, write $A=Q\Lambda Q^T$ by the spectral theorem for real symmetric matrices. In the coordinates in an orthonormal basis $w=Q^{T}x$, the positive level set $q(x)=k$ becomesThis is an ellipsoid, with semi-major and semi-minor axes in two dimensions forming an ellipse; each semi-axis has length $r_j=\sqrt{k/{\lambda }_j}$ and direction given by the corresponding eigenvector. In the opening example, the shorter semi-axis is $\sqrt{k}/2$ along $e_{+}$, while the longer is $\sqrt{k/2}$ along $e_{-}$. A stiffer direction, meaning a larger eigenvalue, reaches the same energy at a smaller displacement. The ratio of longest to shortest semi-axis is $\sqrt{{\lambda }_{\max }/{\lambda }_{\min }}$, the square root of the spectral condition number of a positive-definite matrix.^[ref]

Strict positivity matters because ${\lambda }_{\min }>0$ givesHence a fixed positive level set cannot extend arbitrarily far. The Cholesky decomposition $A=L{L}^T$ gives another view: $q(x)=\Vert L^{T}x{\Vert }^2$, so the ellipsoid is the inverse image of a sphere under an invertible linear map. A singular positive semidefinite matrix has a nonzero kernel; adding a kernel vector preserves its quadratic form, so any nonempty positive level set is unbounded. These statements concern finite dimension; the positive definite symmetric operator entry explains why strict positivity alone need not give a uniform lower bound on an infinite-dimensional Hilbert space.

Vary the coupling in the opening example. The eigenvectors $e_{+}=(1,1{)}^T/\sqrt{2}$ and $e_{-}=(1,-1{)}^T/\sqrt{2}$ form a fixed orthonormal eigenbasis, with eigenvalues $3+t$ and $3-t$. Writing a vector as $u{e}_{+}+v{e}_{-}$ givesFor $|t|<3$, both directions cost energy and $A_t$ is a positive-definite matrix. At $t=3$, the quadratic form is $6u^2$: the entire line spanned by $e_{-}$ has zero energy, and $A_t$ is a singular positive semidefinite matrix. At $t=-3$, the flat line is instead spanned by $e_{+}$. For $|t|>3$, the quadratic form is an indefinite quadratic form; one direction lowers the energy without bound as its displacement grows. At $t=4$, for instance, $q_t(e_{+})=7$ while $q_t(e_{-})=-1$.

The geometric transition is precise. For $|t|<3$, $q_t=1$ is an ellipse. At $t=3$, it consists of the two parallel lines $u=\pm 1/\sqrt{6}$, extending freely in the zero-energy direction. For $t>3$, it is a hyperbola. The boundary case retains nonnegative energy but loses both the bounded positive level sets and the unique zero-energy vector.

For a real symmetric matrix $A=\left(\begin{array}{cc}a& b\\ b& c\end{array}\right)$, completing the square gives, when $a\ne 0$,Thus $A$ is a positive-definite matrix exactly when $a>0$ and $\det A=ac-b^2>0$. For necessity, test $(1,0)$ first, then $(-b/a,1)$; for sufficiency, the displayed two positive squares give the result. These are the first two leading principal minors in Sylvester's criterion. A positive determinant alone is insufficient: $-I_2$ has determinant $1$ but is a negative-definite matrix.

The eigenvalues provide an equivalent test under the same real-symmetric hypothesis:The spectral theorem for real symmetric matrices supplies coordinates in an orthonormal basis in which $q={\lambda }_{+}{u}^2+{\lambda }_{-}{v}^2$. More generally, a complex Hermitian matrix has an orthonormal eigenbasis and $q(z)={\sum }_j{\lambda }_j|w_j{|}^2$, so it is a Hermitian positive-definite matrix exactly when every eigenvalue is positive. This is a short proof outline: test the eigenvectors for necessity, and sum the positive squared absolute values for sufficiency.^[ref]

For a real positive semidefinite matrix, the condition is instead $q(x,y)\ge 0$ for all vectors, equivalent here to $a\ge 0$, $c\ge 0$, and $ac-b^2\ge 0$. If $a>0$, the same completing the square proves this; if $a=0$, nonnegativity forces $b=0$ and leaves $c{y}^2$ with $c\ge 0$. Merely replacing the strict inequalities on the leading principal minors by nonstrict ones fails: $\mathrm{diag}(0,-1)$ has both leading principal minors zero yet gives $q(0,1)=-1$. An indefinite quadratic form takes both positive and negative values; its real symmetric matrix has eigenvalues of both signs.

Take a separated Boolean decomposition $f(x,y)={⨁}_{\ell }{u}_{\ell }(x)v_{\ell }(y)$. Feed $(u_{\ell },v_{\ell })$ to one independent PR box, obtaining outputs with $a_{\ell }\oplus b_{\ell }=u_{\ell }{v}_{\ell }$. Alice forms $A={⨁}_{\ell }{a}_{\ell }$, Bob forms $B={⨁}_{\ell }{b}_{\ell }$, and their parities satisfy $A\oplus B=f$. Sending the single bit $A$ lets Bob compute the answer with certainty. The truth-table decomposition needs at most $2^{\min (m,n)}$ boxes for input lengths $m,n$. Each box's local output is uniform, so Bob's uncommunicated output string carries no information about Alice's input; the final parity bit is essential for a general function depending on that input.

The dual Haar measure is the scale of Haar measure on the Pontryagin dual group compatible with Fourier inversion on a locally compact abelian group. It can be constructed without first assuming inversion: for a compactly supported test function $\psi$, choose a finite sum of convolution squares $p$ with $\hat{p}>0$ on its support and define $J(\psi )=\int \psi /\hat{p}d{\mu }_p$. The Bochner consistency identity for convolution squares makes this independent of the choice. Modulation by a character shows $J$ is invariant under dual translation; the Riesz representation on compactly supported continuous functions gives the measure. It satisfies $d{\mu }_p=\hat{p}d{m}_{\hat{G}}$ and scales reciprocally when $d{m}_G$ is rescaled.

Evaluation $(x,\chi )\mapsto \chi (x)$ is jointly continuous for the compact-open topology on the dual of a locally compact group. One proof uses $\overline{\chi (x)}=\widehat{T_{x}a}(\chi )/\hat{a}(\chi )$ near any character where the denominator is nonzero, together with norm-continuity of translations. A finite neighbourhood cover of a compact family $C$ then gives the displayed uniform convergence. This justifies compact-set-and-integrable-tail estimates even when the group is not metrizable and approximation is indexed by a net.

With independent prior distributions $\beta \sim N(\mu ,\Sigma )$ and $s\sim \mathrm{IG}(a,b)$ in a normal distribution regression model, the conditional posterior distribution of $\beta$ has covariance matrix $V=(X^{T}X/s+{\Sigma }^{-1}{)}^{-1}$ and mean $V(X^{T}y/s+{\Sigma }^{-1}\mu )$. The conditional posterior distribution of $s$ is inverse-gamma distribution $\mathrm{IG}(a+n/2,b+\Vert y-X\beta {\Vert }^2/2)$. The shape contains no half-dimension contribution from $\beta$, since its prior distribution is independent of $s$. These conditionals give a two-block Gibbs sampler.

For a compact connected Riemannian manifold with nonnegative Ricci curvature, its finitely generated fundamental group acts freely and properly discontinuously on the complete universal cover. The preceding polynomial growth of properly discontinuous isometry groups bound applies. The degree-one Hurewicz theorem identifies first integral homology with the abelianization of the fundamental group. If its free rank is $b_1(M)$, this group maps onto ${\mathbb{Z}}^{b_1(M)}$. Choosing lifts of a basis gives at least a constant times $m^{b_1(M)}$ distinct elements in a word ball of radius a constant times $m$. The upper bound of order $m^{\dim M}$ forces the displayed inequality.

Expand the isotropic angular factor as $\sin (kr)/(kr)=1-k^2{r}^2/6+O(k^4{r}^4)$. For a polymer scattering function and finite fourth pair moments, the constant double sum gives $g(0)=N$, and the quadratic sum is determined by the radius of gyration:In the range $k{R}_g\ll 1$, this is also approximated by $e^{-k^2{R}_g^2/3}$. The coefficient follows from isotropy and the definition of $R_g$ and does not require a Gaussian chain.