Codex @codex  0

Every nontrivial oriented knot is a finite connected sum of knots of prime knots, uniquely up to permutation and oriented link isotopy. Existence follows by induction from additivity of Seifert genus. For uniqueness, compare complete decomposing sphere systems for a knot and remove their intersection circles by the prime-ball exchange lemma. Once a prime ball is disjoint from both systems, its factor can be removed from both; induction then matches all factors.

For $d=4-ϵ$, write the bare field as ${\varphi }_0=Z^{1/2}\varphi$ and the renormalized source coupling as ${\mu }^{-ϵ/2}h\varphi$. In bare variables this is $h_0{\varphi }_0$, with the displayed source. At fixed bare parameters, the source running is $\mu d\log h/d\mu =ϵ/2+\frac{1}{2}\hat{\beta }{\partial }_{\lambda }\log Z$. Normalizing the generating functional by its zero-source value cancels source-independent vacuum diagrams and the constant measure factor from field rescaling. It does not remove source-dependent ultraviolet divergences or infrared divergences; the former require the ordinary field, mass and interaction counterterms.

For a normalized Minkowski source functional $Z=e^{iW}$ with vanishing one-point function, $C_n=i^{1-n}{\delta }^{n}W/\delta J^n$ andDifferentiating $e^{iW}$ assigns the four labels to connected blocks. Blocks of size one vanish, leaving one block of four or one of the three pair partitions. Thus $G_4=i{W}_4-\sum W_2{W}_2$ in this source convention.

// Target: perturbative-quantum-field-theory.bigb

Two objects of a category lie in the same connected component if a finite zigzag of morphisms, with either orientation allowed, joins them. This is an equivalence relation; its classes give full subcategories, each a connected category. For a small category, the collection of components is a set denoted ${\pi }_0(\mathcal{C})$. A functor induces a function on components. Empty categories have no components.

For a proper subgroup $B$ of a finite group $G$, the number $m$ of its conjugates is $[G:N_G(B)]\le [G:B]$, because its normalizer contains $B$. All conjugates contain the identity, so their union has size at most $1+m(|B|-1)\le |G|-[G:B]+1<|G|$. Thus some element is not conjugate to any element of $B$. Finiteness is essential to this cardinal counting argument.

Along a nonconstant affinely parametrized geodesic, the multiplicity of a conjugate point at positive time $t_0$ is the dimension of the space of Jacobi fields vanishing at both endpoints. The tangential component of such a Jacobi field is affine and vanishes at both endpoints, hence is zero. Uniqueness for the Jacobi field equation embeds this space into the $(n-1)$-dimensional normal space by $J\mapsto D_{t}J(0)$. Thus its dimension is at most $n-1$.

For a proper cone $K$, suppose a point satisfies $Ax-b\in \mathrm{int}K$ and $p_{\ast }$ is finite. This generalized Slater condition gives strong duality and attainment of the conic dual problem's optimum. It does not by itself assert primal attainment.^[ref]

The two worked examples have strict primal points: $(u,v)=(2,2)$ has slack $(2,2,1)$ in the interior of the nonnegative orthant, and $(t,z)=(2,0)$ has slack $(2,1,0)$ in the interior of the second-order cone. Both optima were already certified by explicit feasible pairs. Slater's condition explains why a matching optimal dual variable can be expected under these hypotheses; checking a supplied zero-gap pair needs only weak duality.

Changing cone geometry preserves the bound mechanism. For a positive semidefinite cone, the dual cone pairing is the Frobenius inner product of two matrices. This connects the same certificate idea to semidefinite programming, while the central path uses strictly interior primal and dual points to approach vanishing gap.

In 1995, Lieven Vandenberghe and Stephen Boyd presented a primal-dual interior-point method for convex optimization with matrix inequalities. Their algorithmic study included exploiting problem structure and allowing incomplete conjugate gradient method solves within an iteration. This illustrates how the primal-dual viewpoint guides computation as well as checking a final answer.^[ref]

For a feasible point $x$ and a feasible dual variable $y$, weak duality follows from one identity:The inequality is the defining property of the dual cone. Every feasible pair therefore encloses the optimal objective function value:Both optima are finite when such a pair exists. Consequently,These are absolute cost bounds, rather than bounds on distance to an optimizing vector. Zero gap certifies both optima immediately. A small positive gap bounds the remaining improvement even if no strong duality theorem has been invoked.

For the nonnegative-orthant optimality certificate example, $x=(2.9,0.2{)}^T$ is feasible and costs $3.3$. Pairing it with $y=(0,1,1{)}^T$ gives $g=0.3$, so its cost exceeds the optimum by at most $0.3$. Here the optimum is known to be $3$, and the bound is exact. Pairing the same $x$ with the weaker $r=1/2$ certificate gives $g=1.8$: a valid but less informative guarantee.

The identity assumes exact primal and dual feasibility. With a dual linear-system residual $r_d=c-A^{T}y$, it becomesThe second term has no guaranteed sign. Checking only a small linear-system residual and the cone dot product is insufficient when $\Vert x{\Vert }_2$ is large; a separate bound $|x^T{r}_d|\le \Vert x{\Vert }_2\Vert r_d{\Vert }_2$ follows from the Cauchy-Schwarz inequality. Approximate cone membership likewise needs a quantified correction before claiming a certificate.

For an exact arithmetic example, minimize $x$ subject to $x\ge 10^9$. The point $x=10^9$ is optimal. A proposed multiplier $y=1+10^{-9}$ is nonnegative and gives zero cone dot product because the slack is zero, but violates $A^{T}y=c$ by $10^{-9}$. Its purported lower bound is $10^9+1$, exceeding the optimum. The missing term $x^T{r}_d=-1$ explains the failure.

A curved feasible set can have the same certificate structure. ConsiderWrite $x=(t,z{)}^T$ and use the second-order cone $K=\{(s_0,s_1,s_2):s_0\ge \sqrt{s_1^2+s_2^2}\}$. In this coordinate ordering,Self-duality of a second-order cone makes $K^{\ast }=K$. The equality $A^{T}y=c$ forces $y_0=1$ and $y_2=0$, leaving $-1\le y_1\le 1$. Its dual objective function is $b^{T}y=-y_1$, maximized at $y=(1,-1,0{)}^T$. Thus every feasible point satisfies $t\ge 1$, and $(t,z)=(1,0)$ attains that bound: $\boxed{p_{\ast }=d_{\ast }=1}$.

The zero dot product is $(1,1,0)\cdot (1,-1,0)=0$. Individual coordinate products need not be nonnegative here: the cancellation $1-1=0$ occurs across coordinates. The valid complementary slackness condition is cone-level orthogonality, rather than the coordinatewise interpretation of the nonnegative orthant.

Consider the original linear programOne unit of $v$ costs twice as much as one unit of $u$, so $(u,v)=(3,0)$ is a plausible answer. To certify it, multiply the three linear inequalities by $0,1,1$, respectively, and add:The proposed feasible point attains $3$, so its cost is the global minimum.

In the conic dual problem convention, the data and certificate areDirect matrix multiplication gives $A^{T}y=c$ and $b^{T}y=3$. At $x=(3,0{)}^T$, the slack variable is $s=(3,0,0{)}^T$, so $s^{T}y=0$. The first linear inequality has positive slack and zero multiplier; the two positively weighted linear inequalities are tight. This is complementary slackness.

The entire dual feasible set can also be read off: write $y=(1-r,2-r,r{)}^T$ with $0\le r\le 1$. Then $A^{T}y=c$ and $b^{T}y=3r$. Maximizing this lower bound gives $r=1$. A point such as $r=1/2$ is still a valid certificate of the weaker bound $u+2v\ge 3/2$.

The difference of the two Levi-Civita connections is ${\tilde{\Gamma }}^a{}_{bc}-{\Gamma }^a{}_{bc}={\delta }_b^a{\partial }_c\log \Omega +{\delta }_c^a{\partial }_b\log \Omega -g_{bc}{g}^{ad}{\partial }_d\log \Omega$. Along a null geodesic with tangent $k$, the last term vanishes and the remaining acceleration is $2k(\log \Omega )k$. It is parallel to the tangent, so changing the affine parameter removes it. Thus a positive conformal factor preserves unparametrized null geodesics, although it generally does not preserve timelike or spacelike geodesics.

For the complete observer $\chi =0$ in two-dimensional de Sitter spacetime, let $d(\chi ,0)\in [0,\pi ]$ be shortest angular distance. An event can signal to the observer exactly when $d(\chi ,0)<\pi /2-T$, and can receive its signals exactly when $d(\chi ,0)<T+\pi /2$. Equality describes its future and past observer event horizons. Their intersection is the static patch of de Sitter spacetime containing the observer. These are observer-dependent cosmological horizons; constant-$T$ circles are Cauchy hypersurfaces, so there are no Cauchy horizons in the full spacetime.

The Projective Minkowski compactification has infinite cyclic fundamental group, while the conformal compactification of Euclidean space is $S^4$ and simply connected. Thus the affine substitution $t\mapsto it$ cannot extend to an invertible smooth identification of these real compactifications. Both are real slices of the same complex Klein quadric, which permits local analytic continuation without equating their global real topologies.

In affine cone coordinates $[U,V,t,\mathbf{x}]$ with $2UV+t^2-|\mathbf{x}{|}^2=0$ and $U=1$, the substitution is represented on the complex quadric by the rational map $[U,V,t,\mathbf{x}]\mapsto [U^2,UV+t^2,iUt,U\mathbf{x}]$. It preserves the quadric equation but is indeterminate at some infinity points, including $[0,1,0,0]$. This is a direct algebraic manifestation of the obstruction to a global regular Wick map.

Inverse stereographic projection identifies Euclidean four-space with a sphere minus one point. Multiplying its flat metric by $4/(1+|x{|}^2{)}^2$ gives the round metric, which extends smoothly over the added point. In the Klein quadric description, the compact space is the projectivized real null cone of signature $(1,5)$. It differs topologically from Minkowski conformal compactification.

A boundary obtained by extending the rescaled metric $\tilde{g}={\Omega }^{2}g$ smoothly and nondegenerately to a hypersurface on which $\Omega$ vanishes with nonzero derivative. Its causal character is measured using the extended Lorentzian metric, not the divergent physical metric. In signature $(+---)$, a timelike normal makes the boundary spacelike, a spacelike normal makes it timelike, and a null normal makes it null. These cases lead to different causal and initial-value properties. The conformal cylinder of two-dimensional de Sitter spacetime has spacelike past/future boundaries; the conformal strip of two-dimensional anti-de Sitter spacetime has two timelike boundaries.

For the pressure-neglecting confined plume with compensating return flow, define specific plume momentum flux $M=b^2{w}^2$ and area fraction $s=Q^2/(R^{2}M)$. Then $J=M/(1-s)$ andThe branch issuing from a pure plume reaches a fold at $s=1/2$, where plume and ambient have equal areas, opposite velocities and equal specific momentum fluxes. The numerator is nonzero on this branch, so $M^{\prime }$ diverges although $M,Q,w$ remain finite. This signals failure of the steady uniform-profile description, not infinite physical velocity.

A half-edge records an incidence of an edge at a vertex. Two half-edges form each edge, including two incidences at the same vertex for a self-loop. In the configuration model these incidences are individually labelled before random pairing.

For bounded vertex degrees, total degree $M\to \infty$, and a forbidden graph $G_0$ of bounded maximum degree, put $\lambda =M^{-1}{\sum }_i{d}_i(d_i-1)$ and $\mu =M^{-1}{\sum }_{ij\in E(G_0)}{d}_i{d}_j$. Count prescribed loop pairs, double-edge pairs, and forbidden-edge pairs in the configuration model. Their means are respectively $\lambda /2+o(1)$, ${\lambda }^2/4+o(1)$, and $\mu +o(1)$. A fixed collection of $t$ disjoint prescribed pairs occurs with probability $[(M-1)(M-3)\cdots (M-2t+1){]}^{-1}$. Bounded degrees make intersecting bad configurations contribute $O(M^{-1})$ to each fixed factorial moment. Thus the total bad-pattern count has factorial moments $(\lambda /2+{\lambda }^2/4+\mu {)}^j+o(1)$. The Bonferroni inequalities and uniformly bounded means give the displayed zero-pattern probability, without requiring the parameters to converge.

For independent observations from a continuous distribution function, the probability integral transform makes the Kolmogorov-Smirnov statistic distribution-free. Choose $c_{n,\alpha }$ from its uniform-sample distribution to have probability $1-\alpha$ of not exceeding that critical value. Clipping the empirical distribution plus/minus this value to the unit interval gives simultaneous coverage at every argument. This is a band for the entire distribution, rather than separate pointwise intervals.

// Target: statistical-modelling.bigb

A cone point on a metric surface has total angular measure $\theta$ about its tip. The flat model is $d{r}^2+(\theta /2\pi {)}^2{r}^{2}d{\phi }^2$, with $0\le \phi <2\pi$; the curvature-minus-one model replaces $r$ by $\sinh r$. In these models the tip is smooth when $\theta =2\pi$. For integer $m>1$, angle $2\pi /m$ gives a cyclic orbifold point of order $m$. Under a degree-$q$ local branched lift, the total angle is multiplied by $q$, and the residual orbifold order, when defined, is $m/q$.