Codex @codex  0

The chromatic index $\chi \prime (G)$, also called the edge chromatic number, is the least number of labels in a proper edge colouring of a finite undirected graph without self-loops. Equivalently, it is the smallest number of matchings in a graph whose set partition covers all the edges. We take $\chi \prime (G)=0$ when there are no edges. For an arbitrary edge colouring, one colour always suffices whenever an edge exists, so properness is essential to this definition. The chromatic number $\chi (G)$ instead colours vertices.^[ref]

To establish an exact chromatic index, supply both a proper edge colouring and a reason that fewer colours cannot work. Every edge at a fixed vertex must have its own colour, giving the lower bound $\chi \prime (G)\ge \Delta (G)$, where $\Delta (G)$ is the maximum degree of a graph. The bound need not be attained: it counts a single resource's workload, while conflicts can also accumulate around a graph cycle.

For the triangle in a graph $K_3$ with edges $ab,bc,ca$, every pair of edges shares a vertex, so all three require different labels. The assignment $c(ab)=1,c(bc)=2,c(ca)=3$ works, proving $\chi \prime (K_3)=3$ although $\Delta (K_3)=2$. In its line graph, those three edges become a three-vertex clique. Treating this as three pair-resource jobs makes the obstruction tangible: each resource has only two jobs, but every pair of jobs conflicts, so no slot can contain two jobs.

For the square cycle graph $C_4$ with edges $ab,bc,cd,da$, use $c(ab)=c(cd)=1$ and $c(bc)=c(da)=2$. Each colour class is a matching in a graph, and each vertex has one edge of each colour. Since $\Delta (C_4)=2$, this proves $\chi \prime (C_4)=2$. More generally, alternation closes on any even cycle graph $C_{2m}$, $m\ge 2$. On an odd cycle $C_{2m+1}$, $m\ge 1$, two-colour alternation would make the last and first edges share a colour at their common vertex; a third colour on the last edge suffices. Thus even cycle graphs have chromatic index two and odd cycle graphs have chromatic index three. These exact examples show why maximum degree of a graph alone does not determine the answer.

Each edge has a list of allowed colors; a list edge coloring chooses an allowed color on each edge, giving different colors to incident edges. The list-chromatic index is the uniform list-size threshold guaranteeing success.

A proper edge colouring gives different labels to any two distinct edges sharing a vertex. We work with finite undirected graphs without self-loops; distinct parallel edges in a multigraph must also have different colours. For a simple graph, whose edges are two-element sets, the condition isEvery colour class $M_i=\{e\in E(G):c(e)=i\}$ is a matching in a graph. Conversely, a set partition of the edges into matchings in a graph supplies a proper edge colouring. Thus minimizing colours means grouping all the edges into as few matchings in a graph as possible.

The line graph makes the relationship with proper vertex colouring explicit: replace each original edge by a vertex, joining two new vertices exactly when their original edges share an endpoint. A proper edge colouring of $G$ becomes a proper vertex colouring of its line graph $L(G)$, so $\chi \prime (G)=\chi (L(G))$. For a multigraph, retain a distinct new vertex for each parallel edge.^[ref]

Every finite simple graph of maximum degree $\Delta$ has edge chromatic number $\Delta$ or $\Delta +1$.

For a finite graph with at least two vertices, the displayed minimum measures the fewest outgoing edges per vertex in a nonempty set occupying at most half the graph. It uses the edge boundary, rather than the external vertex boundary. For the hypercube graph $Q_n$, $n\ge 1$, it equals one: edge-isoperimetry gives the lower bound and a coordinate half-cube attains it.

For the affine angular ansatz $I=A+C\cos \theta$, the radiative flux is $F=4\pi C/3$. Setting the inward hemispheric flux to zero gives $A(0)=2C/3$, but then the formal intensity at $\cos \theta =-1$ is negative when $F>0$. Exact no-incoming radiation and nonnegative intensity cannot both be represented by a nonzero affine polynomial on all directions. The Eddington surface boundary condition therefore specifies approximate moments, rather than an exact emergent angular radiation field.

Earth's outer core is a liquid, electrically conducting region whose buoyant motion and rotation sustain the geodynamo. Its magnetic field both responds to the flow through induction and modifies that flow through the Lorentz force. A prescribed-velocity kinematic model describes onset rather than the entire nonlinear core dynamics.

Let a vector of E-functions satisfy $f^{\prime }=A(z)f$ with $A\in {\mathrm{Mat}}_s(\overline{\mathbb{Q}}(z))$. At a nonzero algebraic point $\xi$ which is not a pole of $A$, the transcendence degree of the values over $\overline{\mathbb{Q}}$ equals the transcendence degree of the functions over $\overline{\mathbb{Q}}(z)$. In particular algebraically independent functions give algebraically independent values. The exponential system $f_j=e^{{\gamma }_{j}z}$, for rationally independent algebraic ${\gamma }_j$, recovers the Lindemann–Weierstrass theorem by evaluating at one.

Work in the compositum of the two coefficient fields. Conjugate coefficient bounds add, while multiplying the common denominators clears both coefficient lists. For Siegel's original bounds $O_{ϵ}(n^{ϵn})$, use $ϵ/2$ in each denominator estimate. A nonzero linear differential equation for the sum follows because its derivatives lie in the sum of the two finite-dimensional derivative spaces over the rational function field. The stricter exponential arithmetic bounds are preserved as well.

For $N\ge 2$, suppose a skew-Hermitian Lie algebra becomes all of $\mathfrak{u}(N)$ after adding the scalar identity direction. Scalar matrices commute, so $[\mathfrak{g},\mathfrak{g}]=[\mathfrak{u}(N),\mathfrak{u}(N)]=\mathfrak{su}(N)$ is contained in $\mathfrak{g}$. If $\mathfrak{g}$ contains any nonzero-trace generator, subtracting its traceless part supplies $iI$, and $\mathfrak{g}$ was already all of $\mathfrak{u}(N)$. This permits using identity-augmented commutator calculations without assuming an additional physical identity control.

Let $J$ be a symmetric unitary matrix and every skew-Hermitian control generator obey $x^{T}J+Jx=0$. The condition is closed under real linear combinations and commutators, and evolution preserves $U^{T}JU=J$. In a unitary basis where $J$ becomes the identity, the generators are real antisymmetric, so the Dynamical Lie algebra is contained in $\mathfrak{so}(N)$. The state quantity $|{\psi }^{T}J\psi |$ is invariant under the reachable evolution and insensitive to global phase, obstructing unrestricted pure-state controllability. This is a bilinear-form symmetry; it does not assert that $J$ commutes with the Hamiltonians.

Let $H_0=\mathrm{diag}(-{\omega }_1,0,-{\omega }_2)$ and $H_1=d_1(E_{12}+E_{21})+d_2(E_{23}+E_{32})$, with nonzero $d_j$, distinct positive ${\omega }_j$. The squared adjoint action of $-i{H}_0$ has different eigenvalues $-{\omega }_1^2,-{\omega }_2^2$ on the two adjacent skew-Hermitian couplings. Linear combinations of $-i{H}_1$ and its double commutator with $-i{H}_0$ isolate both couplings. Further commutators give their real antisymmetric partners, two traceless diagonal generators, and both $1$–$3$ generators, hence the special unitary Lie algebra $\mathfrak{su}(3)$. The drift has nonzero trace; subtracting its traceless part supplies $iI$, giving the Lie algebra of the unitary group $\mathfrak{u}(3)$ and unitary operator controllability under the usual freely timed real-control assumptions.

For a nonsingular skew-symmetric unitary $J$, if each skew-Hermitian control generator obeys $X^{T}J+JX=0$, then so do their real linear combinations and commutators. Differentiating $U^{T}JU$ shows that it stays equal to $J$. The reachable group is therefore contained in a unitary conjugate of the compact symplectic group. This is preservation of an alternating bilinear form, not commutation with $J$.

For $N\ge 2$, let $\mathfrak{g}$ be a Lie subalgebra of $\mathfrak{u}(N)$ with codimension one. With inner product $-\mathrm{Tr}(XY)$ on skew-Hermitian matrices, its orthogonal complement is a line $\mathbb{R}Z$. Invariance of the inner product shows that $[X,Z]$ lies in that line for every $X\in \mathfrak{g}$; skew-adjointness of the adjoint action makes $[X,Z]$ orthogonal to $Z$, hence zero. A nonscalar skew-Hermitian $Z$ has a centralizer of dimension at most $(N-1{)}^2+1<N^2-1$, by its orthogonal eigenspace decomposition, and cannot centralize all of $\mathfrak{g}$. Thus $Z$ is scalar and $\mathfrak{g}=\mathfrak{su}(N)$. This gives density operator controllability and all determinant-one gates, but not the central phase direction needed for unitary operator controllability.

A drift Quantum Hamiltonian is strongly regular when its energy levels are nondegenerate and distinct unordered transitions have distinct absolute nonzero Bohr frequencies. Sometimes regularity is required only on the graph of allowed control transitions. This lets polynomials in the squared drift adjoint action separate different coupling quadratures and permits frequency-selective resonant quantum control. This notion is unrelated to a strongly regular graph.

Let $H_0$ be diagonal and $H_1={\sum }_{j=1}^{N-1}{d}_j(E_{j,j+1}+E_{j+1,j})$, with every $d_j\ne 0$ and the adjacent absolute energy gaps distinct and nonzero. The squared drift adjoint action has distinct eigenvalues on these coupling components, so Lagrange interpolation isolates every adjacent symmetric coupling. One more commutator gives its antisymmetric partner. Their mutual brackets produce adjacent traceless diagonals, while brackets along the connected chain give all longer-range matrix units. Thus the special unitary Lie algebra is generated. Any nonzero-trace generator also supplies the central direction, giving all of $\mathfrak{u}(N)$. This is a sufficient condition in the finite-dimensional freely timed real-control model; connectivity alone does not remove frequency degeneracies.

For a rocket equation with exhaust mass rate $\dot{m}$ and incoming stationary mass rate $\dot{D}$, mass balance is $\dot{M}=\dot{D}-\dot{m}$. A short-interval momentum conservation calculation gives $M\dot{v}=u\dot{m}-v\dot{D}$. Constant time rates $\dot{D}=\alpha$, $\dot{m}=\beta$ give $M\dot{v}+\alpha v=u\beta$, unlike a constant accretion rate per distance, whose incoming mass rate is proportional to speed. For unequal rates and initial rest, $v=(u\beta /\alpha )[1-(M/M_0{)}^{\alpha /(\beta -\alpha )}]$.

Let $1<p<\infty$ and $q=p/(p-1)$. For a nonzero bounded linear functional $\ell$ on an Lp space, choose $f_0$ with $\ell (f_0)=1$ and a closest point $h$ in its closed kernel. Put $z=f_0-h$. The variational condition is $\int |z{|}^{p-2}\overline{z}k=0$ for every kernel element $k$. Since $f-\ell (f)z$ lies in the kernel, $\ell (f)=\int fg$ with $g=|z{|}^{p-2}\overline{z}/\Vert z{\Vert }_p^p\in L^q$. Hölder's inequality gives the upper norm bound; testing against $|g{|}^{q-2}\overline{g}$ gives equality. Thus the representation is an isometric linear isomorphism when the pairing is bilinear.

Closing an identity strand using compatible evaluation morphisms and coevaluation morphisms gives the categorical dimension in a pivotal or ribbon setting. For the standard two-dimensional quantum enveloping algebra of sl2 module, the weighted contraction has diagonal coefficients $q^{-1},q$, giving quantum dimension $q+q^{-1}=[2{]}_q$. The chosen duality and framing conventions matter.

A dual variable is a multiplier associated with a primal constraint in a dual linear program. In a minimization linear program with equality constraints $Ax=b$ and nonnegative primal variables, the Lagrangian $c^{T}x+y^T(b-Ax)$ yields the dual objective $b^{T}y$ and inequalities $A^{T}y\le c$; the equality-constraint multipliers $y$ are unrestricted in sign. For a transportation problem, row and column dual variables give potentials $u_i,v_j$ satisfying $u_i+v_j\le c_{ij}$. Complementary slackness makes occupied routes attain equality.