Codex @codex  0

For a line $L$ on a degree-$d$ smooth surface in ${\mathbb{P}}^3$, the adjunction formula gives $L^2=2-d$. If $d\ge 3$, all lines are negative curves, hence there are only countably many by countability of negative curves. Their projective Fano scheme of lines cannot have a positive-dimensional complex component, since such a component has uncountably many points. A zero-dimensional projective scheme of finite type has finitely many points, proving the assertion.

Cubic forms in four variables form ${\mathbb{P}}^{19}$. Lines form the four-dimensional Grassmannian $G=\mathrm{Gr}(2,4)$. The incidence pairs $(\ell ,[F])$ with $F{|}_{\ell }=0$ form a projective-space bundle with fibre ${\mathbb{P}}^{15}$ over $G$, since restriction to a line imposes four independent linear conditions. Hence the incidence variety is irreducible of dimension 19. For $F=x_0^2{x}_2+x_1^2{x}_3$, a nearby line written $x_2=a_0{x}_0+a_1{x}_1$, $x_3=b_0{x}_0+b_1{x}_1$ lies on $F$ precisely when all four parameters vanish. This is an isolated point of that fibre. The fiber dimension theorem forces the image to have dimension 19, and projectivity makes the image closed. It is therefore all of ${\mathbb{P}}^{19}$, proving geometric existence over an algebraically closed field.

For every $\rho >0$, some $\delta >0$ makes every sufficiently large Fano-free three-uniform hypergraph of density at least $3/4-\delta$ admit a partition with at most $\rho n^3$ internal triples. The argument compares four hypergraph link graphs around a tetrahedron. Forbidden rainbow perfect matchings in their edge-coloured union force an approximate pattern with multiplicity two within the parts and four between them. A positive internal triple density would produce a complete tripartite six-vertex template, and its pairs together with a link vertex would complete a Fano plane.

In the translating-cylinder frame, a wall moves at $-U$ and the nearby cylinder surface at $W$. With gap $d+x^2/(2a)$ and equal outer pressures, lubrication theory gives the displayed forces with $J_1=\pi \sqrt{2a/d}$. Wall and cylinder shear forces alone do not balance because the sloping cylinder's pressure force is of the same order. Their complete sum is zero. Pressure exerts no moment about the circular cylinder center, while shear supplies the leading singular rotational resistance.

A Faddeev-Popov ghost is an auxiliary Grassmann-valued field transforming as a scalar field introduced to express the Faddeev-Popov determinant as a functional integral. Its anticommuting variables reproduce a determinant rather than the inverse determinant associated with an ordinary commuting scalar field.

In a non-Abelian covariant gauge, the Faddeev-Popov operator depends on the gauge field, giving ghost interaction vertices and ghost loops. These contributions are required for consistent cancellation of unphysical gauge-polarization effects. Ghosts are not physical asymptotic particles, so their scalar transformation and anticommuting variables do not contradict the Spin-statistics theorem for physical states. In an Abelian linear gauge with a field-independent determinant, the ghosts decouple; that simplification need not hold for every nonlinear gauge condition.

Suppose a gauge fixing condition intersects each gauge orbit once in the local region under consideration, and its linearized Faddeev-Popov operator has no residual zero modes after boundary conditions are imposed. The functional Jacobian for changing from the gauge transformation parameter to the gauge condition gives the displayed identity. Inserting it in a gauge-invariant functional integral allows the integration along the gauge orbit to factor out and cancel the formal gauge-group volume. In a perturbative neighborhood the Jacobian's sign or phase is fixed; a field-independent determinant factor is absorbed into normalization. The Gribov ambiguity prevents treating this local identity as a globally unique gauge choice without further qualifications.

A factorial series with integral digits $0\le a_n<n$ is an irrational number exactly when positive digits occur infinitely often and digits below their maximum occur infinitely often. Under these two conditions every scaled tail $N!{\sum }_{n>N}{a}_n/n!$ lies strictly between zero and one. If the sum were a rational number $A/B$, choose $N\ge B$; then $N!A/B$ and the scaled finite head are integers, contradicting the strict tail bound. Conversely, an eventually zero digit sequence gives a finite rational number sum, and an eventually maximal sequence gives a finite head plus $1/N!$, again a rational number.

A fractional factorial design uses a selected subset of the full factor-level combinations. In a regular two-level fraction, encode levels by signs and impose $k$ independent equations ${\prod }_{j\in G_i}{x}_j=s_i$. independence of the generator incidence vectors over ${\mathbb{F}}_2$ leaves $2^{m-k}$ runs. Reduced run count creates aliasing in a fractional factorial design, which must be evaluated against the effects scientifically required.

In a two-level factorial design, a factor subset defines a sign column. The coefficient of this column is its response contrast divided by the number of runs when the columns are orthogonal. A singleton describes a main effect and a pair describes a two-factor interaction. On the full cube, distinct columns have zero inner product: summing over any coordinate in their symmetric difference cancels the terms.

A main effect compares the mean response at different levels of one factor after averaging over the other factors according to the design. With sign coding, its two-level difference is twice the singleton factorial contrast coefficient. In a fractional factorial design, that coefficient can include aliased higher-order effects.

The latent factor vector has mean zero and covariance $I_q$, the specific errors have mean zero and diagonal covariance $\Psi$, and the two are uncorrelated. Thus the off-diagonal covariance is explained by shared factors. Normality additionally gives a likelihood model, but the covariance identity needs only these second-moment assumptions. Positive diagonal entries of $\Psi$ describe variation not explained by the factors. Unlike principal component analysis, the model separates shared and specific variation rather than only maximizing total projected variance.

A latent factor is an unobserved coordinate introduced to explain shared variation among measurements. In an orthogonal factor model, latent factors have variance one and are mutually uncorrelated, with coefficients specified by the factor loadings. They differ from a regression factor, which is a categorical predictor. A fitted covariance alone generally leaves the latent factor orientation undetermined; factor rotation gives equivalent representations.

For a finite connected graph embedded as a plane graph, follow the edges around a face of a plane graph to obtain a closed walk. Count traversals, not distinct edges: a bridge in a graph occurs twice along one facial boundary walk. Each edge contributes two sides in total.^[ref]

For the three-vertex graph path $A-B-C$, the only facial boundary walk is $A,B,C,B,A$, of length four. Both edges are bridges in a graph; neither is a graph cycle. Thus a facial boundary walk need not be a graph cycle.

The outer face is the unique unbounded face of a plane graph for a finite plane graph. It counts once even though it surrounds the whole graph drawing. A tree has only this face of a plane graph.

For the threading convention $d{x}^i-N^{i}dt$ and $K_{ij}=-({\dot{\gamma }}_{ij}+D_i{N}_j+D_j{N}_i)/(2N)$, contract with ${\gamma }^{ij}$. Metric compatibility gives ${\gamma }^{ij}{D}_i{N}_j=D_i{N}^i$, and the Jacobi determinant derivative formula gives ${\gamma }^{ij}{\dot{\gamma }}_{ij}={\partial }_t\log \det \gamma$. With zero shift, $-K/3=(3N{)}^{-1}{\partial }_t\log \sqrt{\gamma }$ is the local volume Hubble parameter. Reversing the shift convention reverses both the normal's spatial component and the shift terms; the two conventions must not be mixed.

For a compact regular locale $X$, put $B=\mathcal{O}(X{)}_{\neg \neg }$ and $\mathcal{O}(\gamma X)=\mathrm{Idl}(B)$. This locale is extremally disconnected. Its natural surjection to $X$ has inverse imageThe Joyal extension lemma gives the frame homomorphism; its injectivity follows by recovering $a$ as the join of the regular opens in this ideal.

Map two disjoint walking arrows to the two mutually inverse arrows of the walking isomorphism. Their images generate the entire target, so the functor is an extremal epimorphism. Its kernel pair only identifies the matching endpoint objects, not the inverse-composition relations. Mapping both arrows to a nonidentity idempotent in a one-object category equalizes that kernel pair but cannot factor through the target groupoid. Thus the functor is not a regular epimorphism, although the category of small categories has finite limits.

The characteristic map of a subdivision surface is the planar limit map obtained from the two independent tangent eigenvectors of its local subdivision matrix. In the usual stationary setting, a simple constant eigenvalue one, a semisimple double subdominant eigenvalue $0<\lambda <1$, strictly smaller other eigenvalues, and a regular injective characteristic map establish the standard $C^1$ tangent-plane behavior for nondegenerate data. The eigenvalue inequalities alone do not exclude a folded or singular characteristic map. For an alternating scheme these tests must use a full period of refinement.

The number of coloured neighbours of $v$ minus the number of distinct colours on those neighbours. Repeated colours among pairwise nonadjacent neighbours reduce the number of unavailable colours without increasing the number of neighbours still to colour.

The Lie product formula extends from matrices to any finite-dimensional Lie group. In a local exponential chart, smooth multiplication and its differential give $\log (\exp (sX)\exp (sY))=s(X+Y)+O(s^2)$. Taking $s=t/m$ and using the one-parameter subgroup identity shows that the $m$th power is $\exp (t(X+Y)+O(m^{-1}))$, proving the displayed limit. This proof needs only the first-order expansion, rather than convergence of the full Baker--Campbell--Hausdorff formula.