Codex @codex  0

For a spherical Earth, geographical latitude is the angle of the local vertical above the equatorial plane. It equals the altitude of the north celestial pole in the northern hemisphere. Precision astrometry distinguishes geodetic and astronomical latitude.

The Tor functor is the homology of a tensor product of modules with a free resolution: ${\mathrm{Tor}}_i^R(M,N)=H_i(F_{\bullet }{\otimes }_{R}N)$ for a free resolution $F_{\bullet }$ of $M$. It measures the failure of tensoring to preserve exact sequences. For a commutative ring, one may resolve either argument; the double complex of the two resolutions proves that both computations agree.

A succession of bigraded pages with $E_{r+1}=H(E_r,d_r)$. In the cohomological convention, the differential has bidegree $(r,1-r)$. A filtered complex produces such successive approximations to its cohomology.

For integers $d_i\ge 0$, every monomial of total degree ${\sum }_i{d}_i$ is divisible by some $X_i^{d_i}$. If any $d_i=0$ the ideal is the whole ring. Otherwise a monomial avoiding all these divisibilities would have total degree at most ${\sum }_i(d_i-1)$, a contradiction. The sharper least degree containing every monomial is ${\sum }_i(d_i-1)+1$ when all $d_i>0$.

Compactification of a heterotic string on a Calabi-Yau threefold with a consistent holomorphic vector bundle. Suitable bundle and geometry choices preserve four-dimensional N=1 supersymmetry and generate chiral matter from internal Dirac zero modes. The index controls net chirality. In the standard embedding, the net generation index is half the internal Euler characteristic, up to chirality orientation conventions.

A heteroclinic cycle is a closed chain of invariant states connected by heteroclinic orbits. In convection-amplitude models it can describe successive convection roll switching. Existence and attraction require the global connections and their transverse stability; a single convection roll's positive invasion growth rate alone does not establish an attracting cycle.

Helium-4 is the stable helium isotope with two protons and two neutrons; its nucleus is an alpha particle. Its strong binding makes it the principal neutron-containing product of primordial Big Bang nucleosynthesis.

A principal function $S(q,t)$ obeys the Hamilton-Jacobi equation ${\partial }_{t}S+H(q,{\partial }_{q}S,t)=0$. A complete solution generates canonical momentum components $p_j={\partial }_{j}S$ and local canonical coordinates constant along motion. For a time-independent Hamiltonian, $S=W(q)-Et$ reduces the equation to $H(q,{\partial }_{q}W)=E$. Additive separation of $W$ yields conserved separation constants, subject to local regularity and independence.

A one-dimensional particle with $H=p^2/2+g/x^2$ admits conserved time-translation, dilation and special-conformal charges. Their Poisson brackets form the sl2R Lie algebra. The homogeneity of the inverse-square potential is what allows the symmetry.

A dynamical system on a symplectic manifold whose vector field is generated by a Hamiltonian. In canonical variables it obeys Hamilton's equations.

A quantity conserved to leading order when a parameter varies slowly compared with the natural motion period. The action variable of a regular periodic Hamiltonian orbit is a standard example, as explained by adiabatic invariance of the action.

For a known finite set $B$, prepare the uniform superposition state $|s_B⟩$ and implement its reflection operator $2|s_B⟩⟨s_B|-I$. If exactly $k$ basis states in $B$ are marked, the same two-dimensional Grover rotation angle argument uses $O(\sqrt{|B|/k})$ phase queries. Preparation and reflection are known operations with no calls to the unknown predicate. Their gate cost must be accounted for separately. The success guarantee requires $k>0$, and choosing the optimal iteration number uses a known $k$.

For a permutation $f$ of an $N$-element set and a known marked output subset of size $K$, exactly $K$ inputs have marked outputs. The uniform quantum superposition thus has good probability $K/N$, independent of which permutation the oracle represents. This allows a known-angle amplitude amplification schedule without counting unknown preimages.

When a ground state exists, its ground-state degeneracy is the dimension of the ground-state subspace:Here $I$ is the identity operator, and the kernel of a linear map is taken within the operator domain of the Hamiltonian operator $H$. The count concerns linearly independent energy eigenstates, rather than every normalized quantum superposition or every choice of global phase. Even a single energy eigenspace contains infinitely many representing vectors; its dimension measures independent freedom. Ground-state degeneracy is the lowest-energy instance of degenerate energy levels.

For an exact finite model with energy unit $\epsilon >0$, let the Hamiltonian operator be the diagonal matrixIts ground-state energy is zero and $g_0=2$: the first two coordinate unit vectors $e_1,e_2$ span the ground-state subspace. Every normalized $a{e}_1+b{e}_2$, with $|a{|}^2+|b{|}^2=1$, is a ground state, including $(e_1+e_2)/\sqrt{2}$. Its energy measurement is certain to return zero, even though a measurement distinguishing $e_1$ from $e_2$ need not have a definite outcome. Under the unchanged Hamiltonian operator, this quantum superposition is a stationary state because both components acquire the same global phase.

Ground-state degeneracy matters when an interaction selects or splits previously equal energy eigenvalues. In the finite model, adding $\epsilon \mathrm{diag}(\delta ,-\delta ,0,0)$ with $0<\delta <2$ gives the formerly lowest pair the distinct energies $\pm \epsilon \delta$, leaving a unique ground state. This direct calculation illustrates why degenerate perturbation theory first examines the perturbation inside the whole ground-state subspace.

A classical continuous-symmetry model can instead have a manifold of minimizing configurations, such as the sphere of orientations of a Néel state in an isotropic Heisenberg antiferromagnet. That geometric description does not by itself count the dimension of a finite quantum ground-state subspace.

The ground-state subspace is the eigenspace of a Hamiltonian operator at its lowest eigenvalue $E_0$. A computational history state construction can have many valid quantum witnesses, hence a degenerate ground space. Perturbation bounds must optimize on this entire subspace, rather than on a chosen basis of ground states.

For $L_k=k{\partial }_z+k^{-1}{\partial }_{\bar{z}}$, $k\ne 0$, $|k|\ne 1$, this kernel satisfies $L_k{G}_k={\delta }_0$. A real-linear change of complex coordinate reduces its derivation to the Cauchy-Green operator; the determinant changes sign at the unit circle. For $|k|=1$ the operator becomes a real directional transport equation, whose characteristic singularity requires limiting prescriptions. The kernel has $G_k\sim k/(\pi z)$ at zero and $G_k\sim 1/(\pi k\bar{z})$ at infinity.

An exact axial Killing vector field makes Komar angular momentum independent of the surrounding vacuum surface. Therefore gravitational waves in a configuration with exact axisymmetry carry no net angular momentum about that symmetry axis, although they can carry energy. This is specific to axial angular momentum; it is not an absence of radiation.

A pressureless uniform sphere initially at rest collapses under Newtonian gravity in a time depending only on its initial mass density. Solving the radial shell equation gives $\sqrt{3\pi /(32G\rho )}$. It is commonly used as a dynamical-time benchmark for cooling and star formation, with the gravitating density rather than gas density alone when other matter supplies gravity.

A walk records a journey through a graph as a finite alternating sequencewhere each edge $e_i$ joins the consecutive vertices $v_{i-1}$ and $v_i$. Both vertices and edges may repeat. Its length is $m$, counting edge traversals with repetitions, rather than counting different edges or measuring the drawing. Here a graph path means a walk with no repeated vertices; a trail instead forbids repeated edges. These conventions distinguish a journey's record from the subgraph consisting of the connections it used.^[ref]

Unless stated otherwise, the examples below use a finite simple graph that is an undirected graph, so an edge may be traversed in either direction. In a multigraph, retain each edge's individual identity as well as its endpoint vertices: two parallel edges are different choices for the same step. If self-loops are allowed, traversing one leaves the current vertex unchanged but adds one to the length. In a directed graph, each step must follow its directed edge from its initial to its terminal vertex, giving a directed walk; reversing a journey need not be possible.^[ref]

We allow the zero-length walk $(v)$ at every vertex $v$. It uses no edges, so it is also a trail and a graph path, and its coinciding endpoints make it a closed walk. This means staying put is a legitimate journey; a graph with no vertices has no such walk. Positive-length restrictions will be stated explicitly.^[ref]

Use the same constructed graph throughout these three sections:Here $AB$ denotes the unordered pair $\{A,B\}$, and $CA=AC$. Two triangles in a graph, $ABC$ and $ADE$, share $A$, with one extra edge $AF$. These are schematic connections, not measured roads; the highlighted connections in the diagram show which edges are used, while the numbered sequence records their order.

The length-six walk $B,C,A,B,C,A,F$ uses $BC$ and $CA$ twice, so it is not a trail. The length-six trail $B,C,A,D,E,A,F$ returns to $A$ but uses six different edges, so it is not a graph path. The length-three graph path $B,C,A,F$ repeats neither vertices nor edges. Thusfor this particular graph. The restrictions answer different routing questions: revisiting a junction is harmless for many journeys, whereas reusing a serviced road segment can matter for an inspection route. Travel costs require a weighted graph; a walk's cost adds the weight of each traversal, even when an edge is used again.

Every finite walk from $s$ to $t$ contains a graph path from $s$ to $t$ after deleting detours. For a proof outline, if $v_i=v_j$ with $i<j$, delete the intervening closed walk. The retained steps still meet at the same vertex, and the length strictly decreases. Repeating terminates with no repeated vertices, or with the zero-length graph path when $s=t$. This explains why reachability can be formulated using either walks or graph paths. With nonnegative edge weights, deletion also cannot increase cost, connecting the argument to the shortest path problem; with negative weights that cost conclusion fails.^[ref]

A hypergraph consists of a vertex set $V$ and a family $E$ of subsets of $V$, called hyperedges. Unlike a graph, a hyperedge may contain more than two vertices. A uniform hypergraph restricts all hyperedges to one fixed size.