Codex @codex  0

For a quadratic equation $a{x}^2+bx+c=0$ with $a\ne 0$, completing the square givesOver the complex numbers both roots exist, with a repeated root of a polynomial when the discriminant $b^2-4ac$ is zero. Over the real numbers the discriminant determines whether there are two distinct roots, one repeated root, or no real root.

A quantum state ray is the equivalence class of nonzero vectors in a complex Hilbert space under multiplication by a nonzero complex number. Its span is a one-dimensional linear subspace, but the zero vector is not a state representative. A unit vector fixes the norm and leaves a global phase free. ^[ref]

For a nonzero representative $|v⟩$, the associated pure state density operator isReplacing $|v⟩$ by $\lambda |v⟩$ multiplies both numerator and denominator by $|\lambda {|}^2$, so the quotient is unchanged. In particular, for every POVM effect $E$,This proves that a global phase changes no measurement probability. Changing the relative quantum phase of two nonzero components can change the density operator, as the following comparison shows.

Quantum theory supplies a common language for quantum mechanics, measurement in quantum mechanics, and quantum information: prepare a quantum state, transform it, and ask which experimental outcomes occur. In a finite-dimensional idealization, a pure state is a normalized vector of complex numbers. Its entries are probability amplitudes; the Born rule turns their squared magnitudes into probabilities. Between measurements, an isolated system evolves by a unitary operator, preserving its norm and inner products. A quantum circuit makes this evolution explicit as a sequence of quantum gates.

The extra information carried by quantum phases is essential. Relative quantum phases affect how probability amplitudes add when different contributions reach the same output. Their interference can enhance one outcome and cancel another. A global phase, multiplying the entire quantum state by the same complex factor of magnitude one, changes neither these relative phases nor observable predictions. The Hadamard gate below provides a small experiment in which this distinction becomes a deterministic change of output.

Quantum coherence describes this capacity to interfere relative to a specified orthonormal basis. In a density matrix, it appears in off-diagonal entries; a diagonal mixed state retains the populations but lacks that basis coherence. Thus matching the probabilities of one measurement need not match the predictions of a later experiment. Baumgratz, Cramer, and Plenio made this basis-dependent viewpoint precise in their resource framework for quantum coherence. ^[ref].

This makes quantum information an operational question: which distinctions can a preparation, an available unitary operator, and measurement in quantum mechanics reveal? Amplitude amplification illustrates how carefully arranged interference converts a weakly represented answer into a likely observable result. Preserving the relevant quantum coherence throughout the computation is part of the physical task. ^[ref].

A finite group is $m$-quasirandom if every nontrivial irreducible representation over the complex numbers has degree at least $m$. The trivial representation is excluded. Large $m$ suppresses correlations of products of arbitrary subsets, through product mixing in a quasirandom group.

The minimal polynomial of a real matrix, initially computed over the complex numbers, has real coefficients. Its coefficientwise complex conjugate is also a monic polynomial of the same degree annihilating the matrix. Uniqueness of the minimal polynomial forces the two polynomials to agree.

For a complex number $z=x+iy$, its real part is $\mathrm{Re}z=x$.

The real case of the finite-dimensional spectral theorem says that a self-adjoint operator on a finite-dimensional real inner product space has a real orthonormal eigenbasis. In orthonormal coordinates this is the spectral theorem for real symmetric matrices, $A=Q\Lambda Q^T$. The worked ellipse under finite-dimensional spectral theorem shows why both orthogonal diagonalization and orthogonality matter: the new coordinates separate the quadratic form into squares without distorting lengths or angles.

A real normal matrix need not have real eigenvalues. For example, the quarter-turn $\left(\begin{array}{cc}0& -1\\ 1& 0\end{array}\right)$ is an orthogonal matrix, but its characteristic polynomial is $z^2+1$ and its eigenvalues are $i,-i$. Over the complex numbers it has an orthonormal eigenbasis; over the real numbers it has no eigenvector. Self-adjointness supplies the reality conclusion in the real spectral theorem.

The set of complex numbers $s$ for which the displayed integral is finite is the region of absolute convergence of a Laplace transform. It depends only on the real part $\sigma =\mathrm{Re}s$. Once the condition holds for one $\sigma$, it holds for every larger real part. For the exponential function $e^{-2t}$ it is exactly $\mathrm{Re}s>-2$; in general, convergence on the boundary must be checked separately. An analytic continuation outside this set need not equal a convergent defining integral.

Representation theory describes abstract symmetries by linear maps on vector spaces. A group representation assigns an invertible linear map to each group element, respecting multiplication. The payoff is that a symmetry problem becomes a problem about matrices, invariant subspaces, and eigenvalues. Decomposing the action can reveal combinations of variables that a symmetric system cannot mix.

Take the cyclic group $C_3=\{e,g,g^2\}$, with $g^3=e$. On three real coordinates, let $g$ send $(a,b,c)$ to $(c,a,b)$:This permutation representation does more than relabel a list: it acts linearly on every possible assignment of values to the three positions. The vector $(1,1,1)$ stays fixed. The vector subspace $W=\{(a,b,c):a+b+c=0\}$ is also preserved, since a permutation does not change the sum.

Every vector separates uniquely into these two types:For example, $(4,1,1)=2(1,1,1)+(2,-1,-1)$. The first term belongs to a trivial representation; the second is a contrast with zero coordinate sum. This is a direct sum decomposition ${\mathbb{R}}^3=\mathbb{R}(1,1,1)\oplus W$. The symmetry preserves the mean and rotates the contrasts.

The rotation is literal after choosing the orthonormal basis $u=(2,-1,-1)/\sqrt{6}$, $v=(0,1,-1)/\sqrt{2}$ of $W$. In this basis,It is a rotation through $120$ degrees, and three applications return to the starting point. There is no nonzero invariant real line, because this rotation has no real eigenvector. Thus the two-dimensional action is an irreducible representation over the real numbers. Over the complex numbers it instead splits into two eigenlines with eigenvalues $e^{2\pi i/3}$ and $e^{-2\pi i/3}$. The coefficient field is part of an irreducibility claim.

Why would this decomposition matter for a physical calculation? Consider three equal masses with scalar displacements $x_i$ and the symmetric quadratic coupling energyThe equations of motion are $m\ddot{x}=-kLx$, whereis a graph Laplacian and $J$ is the all-ones matrix. The constant vector has eigenvalue zero: translating all coordinates equally costs no coupling energy. On $W$, $J$ vanishes and $L=3I$, so both independent contrast directions have angular frequency $\sqrt{3k/m}$. A three-coordinate coupled problem reduces to a free mean and two identical harmonic oscillators.

For initial displacement $x(0)=(4,1,1)$ and initial velocity zero, the exact solution is $x(t)=2(1,1,1)+\cos (\sqrt{3k/m}t)(2,-1,-1)$. The fixed mean and oscillating contrast can be read directly from the decomposition. More generally, a linear operator commuting with the group action carries its fixed-vector subspace into itself; with an invariant inner product, it preserves the corresponding orthogonal complement too.

For a finite group, averaging over the action constructs an invariant inner product over the real numbers or complex numbers. The resulting invariant complements explain Maschke's theorem: a finite-dimensional group representation decomposes into irreducible representations. Characters compress the action into traces and help identify those pieces. The assumptions matter; in modular representation theory the coefficient field can have characteristic dividing the group order, and such decompositions can fail. Chapter 4 of Pavel Etingof and coauthors' notes develops these mechanisms. ^[ref].

The right half-plane consists of complex numbers with positive real part. Its boundary is the imaginary axis. For example, $1+i$ is inside, $i$ is on the boundary, and $-1+i$ is outside. Rotation $z\mapsto iz$ takes the right half-plane onto the upper half-plane; the Cayley transform between the half-plane and disk uses $R(z)=(z-1)/(z+1)$ for this convention.

A root of a polynomial $f$ is a scalar $a$ satisfying $f(a)=0$ in the chosen field or ring. For $p(X)=(X+1)(X-2{)}^2$ over the real numbers, the distinct roots of a polynomial are $-1$ and $2$. The second has multiplicity of a root two, so there are three roots when counted with multiplicity.

The domain matters. $X^2+1$ has no real polynomial root, but has the two complex number roots $i,-i$. The fundamental theorem of algebra guarantees a polynomial root in the complex numbers for every nonconstant complex polynomial, and complete factorization counts its degree of a polynomial many roots with multiplicity of a root. It does not promise that those roots are real or that they have a simple expression.

An $N$th root of unity is a complex number $z$ satisfying $z^N=1$. The primitive root $e^{2\pi i/N}$ generates all $N$th roots.

A two-by-two matrix $M$ with zero trace satisfies $M^2=-(\det M)I$ by the Cayley-Hamilton theorem. Over the complex numbers, either $\det M\ne 0$ and its two distinct eigenvalues make it diagonalizable, or $M^2=0$. A matrix commutator has zero trace, so this alternative applies to it. Diagonalization over the real numbers need not follow when $-\det M<0$.

A scalar-valued function is a function whose codomain is a field, typically the real numbers or complex numbers. Its output is a single scalar, while its input can belong to an arbitrary set. For example, the square of the norm of a vector is real-valued. In a relativistic application, being scalar-valued alone does not establish Lorentz invariance: the transformation of the input and of the complete quantity must also be specified.

The Schur algebra is the commutant of place permutations on a tensor power. It is the linear span of the diagonal general linear group action, by Schur–Weyl duality. Modules over $S(m,n)$ correspond to homogeneous degree-$n$ polynomial representations. Over the complex numbers it is a semisimple algebra: decompose the tensor power as a module for the semisimple group algebra $\mathbb{C}{S}_n$, and take its endomorphism algebra.

A Schur module is the value of a Schur functor on a vector space. Over the complex numbers it is either zero or an irreducible polynomial representation of the general linear group. Its character is the Schur polynomial $s_{\lambda }$ in the eigenvalues, and its highest weight is $\lambda$ padded with zeros.

Consider a stipulated series circuit containing an ideal resistor of electrical resistance $R=100\Omega$ and an ideal capacitor of capacitance $C=1\mu \mathrm{F}$. The same electric current passes through both. Their terminal electric potential differences add by Kirchhoff's voltage law, soA quick derivation uses $i=Cd{v}_C/dt$: taking the derivative of the complex exponential multiplies the capacitor voltage phasor by $\mathrm{i}\omega$, hence ${\hat{V}}_C=\hat{I}/(\mathrm{i}\omega C)$. Dimensionally, $1/(\omega C)$ has units $s/F=V/A=\Omega$, matching $R$.

At frequency $f=1000\mathrm{Hz}$, the angular frequency is $\omega =2\pi f$. The signed capacitive electrical reactance, modulus and complex argument of the total electrical impedance areApply $V_{\mathrm{rms}}=1.00\mathrm{V}$ across the complete series circuit. Its root mean square electric current isWith voltage as the zero-phase reference, the current phasor has complex argument $+57.858092^{\circ }$: electric current leads. The phasor drops have moduli $V_{R,\mathrm{rms}}=0.532018\mathrm{V}$ and $V_{C,\mathrm{rms}}=0.846733\mathrm{V}$; these add as complex numbers, not as positive magnitudes. Their squared magnitudes sum to $(1.00\mathrm{V}{)}^2$.

The mean absorbed power uses the root mean square values:The ideal capacitor has zero cycle-averaged absorbed power; all the mean absorbed power becomes Joule heating in the resistor.^[ref] To see why the phase factor appears, average $p(t)=v(t)i(t)$ over a full cycle with $v(t)=\sqrt{2}{V}_{\mathrm{rms}}\cos \omega t$ and $i(t)=\sqrt{2}{I}_{\mathrm{rms}}\cos (\omega t-\varphi )$. The cosine addition formula reduces the average to $V_{\mathrm{rms}}{I}_{\mathrm{rms}}\cos \varphi$; the term at $2\omega$ averages to zero. Independently, $p_C=d(C{v}_C^2/2)/dt$, and the capacitor energy returns to its starting value after each cycle.

At fixed applied $V_{\mathrm{rms}}$, the limit $\omega \to 0^{+}$ gives $|Z|\to \infty$, $\varphi \to -\pi /2$ and $I_{\mathrm{rms}}\to 0$: the ideal capacitor blocks steady electric current. The limit $\omega \to \infty$ gives $Z\to R$, $\varphi \to 0$ and $I_{\mathrm{rms}}\to V_{\mathrm{rms}}/R$. These are limits of the ideal lumped electrical circuit; unwanted lead inductance and component losses can invalidate that model at high frequency. At $\omega RC=1$, the equal legs of the impedance right triangle give $|Z|=\sqrt{2}R$ and $\varphi =-\pi /4$ without numerical evaluation. Measuring both the magnitude and the sign of the phase difference distinguishes this capacitor response from an equally large positive electrical reactance.

A sesquilinear form on a complex vector space $V$ is a map $B:V\times V\to \mathbb{C}$ which, with the convention used throughout this article, is a linear map in its first argument and a conjugate-linear map in its second. For vectors $u,v,w$ and complex numbers $\alpha ,\beta$, the defining identities areThe bars denote complex conjugation. No symmetry or positivity is required. Some authors choose the opposite convention; every formula here keeps the first argument linear.^[ref]

For a basis $e_1,\dots ,e_n$ of a finite-dimensional vector space, write $u={\sum }_i{x}_i{e}_i$, $v={\sum }_j{y}_j{e}_j$, and $A_{ij}=B(e_i,e_j)$. Expanding by the two identities givesEvery complex matrix $A$ gives a sesquilinear form this way. The superscript $T$ means transpose, not conjugate transpose. Equivalently, the scalar is $y^{\ast }{A}^{T}x$, where $y^{\ast }={\overline{y}}^T$. This is the convention used for the matrix of a Hermitian form when symmetry is imposed. The coordinate formula follows directly by expanding the basis coefficients.^[ref]

For a concrete example on ${\mathbb{C}}^2$, let $B(z,w)=z_1\overline{w_2}$. Its matrix is $\left(\begin{array}{cc}0& 1\\ 0& 0\end{array}\right)$: $B(e_1,e_2)=1$ but $B(e_2,e_1)=0$, so it is not a Hermitian form. Also $B((1,i),(1,i))=-i$, so even real diagonal values cannot be assumed for an arbitrary sesquilinear form. By comparison, the bilinear form $F(z,w)=z_1{w}_1+z_2{w}_2$ satisfies $F(iz,w)=F(z,iw)=iF(z,w)$ and has $F((i,0),(i,0))=-1$; it cannot supply positive squared lengths on this complex vector space.

The effect of changing the complex argument of a multiplier is particularly revealing. For real numbers $\theta ,\varphi$, sesquilinear forms satisfyThus a common change of complex argument cancels from the diagonal, whereas the two arguments rotate the output in opposite directions. Conjugating one argument is what replaces the ${\alpha }^2$ scaling of a bilinear form by the nonnegative $|\alpha {|}^2$ scaling needed for a Hermitian inner product. This mechanism also works in function spaces: for complex continuous functions on $[0,1]$, $B(f,g)={\int }_0^{1}f(t)\overline{g(t)}dt$ obeys the same identities, letting integration measure overlap rather than merely multiply coefficients.

Over the complex numbers, the signed Young permutation module isThe isomorphism is the tensor identity for induced representations. The partition index is unchanged by this twist; conjugation instead changes the labels of its irreducible constituents. For the conjugate partition ${\lambda }^{\prime }$, the character inner product of $M^{\lambda }$ and ${\tilde{M}}^{{\lambda }^{\prime }}$ is one: Mackey restriction formula reduces it to the unique zero-one matrix with row margins $\lambda$ and column margins ${\lambda }^{\prime }$.

The solution set of a mathematical condition $P$ in a specified domain $D$ collects every allowed value that satisfies it:It describes the answer without committing to the steps used to find it. For the equation $x^2=1$ over the real numbers, the solution set is $\{-1,1\}$; restricting to positive real numbers leaves $\{1\}$. For $2x=1$, the solution set is $\{1/2\}$ over the rational numbers and the empty set over the integers. The domain is part of the question.

An equation can have one solution, several solutions, no solutions, or an entire domain of solutions. Over the real numbers, $2x+3=9$ gives the singleton set $\{3\}$, $x^2+1=0$ gives the empty set, and the mathematical identity $(x+1{)}^2=x^2+2x+1$ gives the whole real line. Changing that second equation's domain to the complex numbers gives $\{-i,i\}$. The elementary definition by values that satisfy an equation and the classification by solution sets appear in College Algebra 2e, §2.2: Solving Linear Equations in One Variable.

Requiring several conditions simultaneously takes the intersection of their solution sets. The squared equation $x=(x-2{)}^2$ has solution set $\{1,4\}$. Adding the restriction $x\ge 2$ giveswhich is also the solution set of $\sqrt{x}=x-2$. The extraneous solution example explains why the sign restriction is needed. Requiring at least one of several conditions instead takes their union. This turns logical combinations of constraints into reusable operations on sets.

For several variables, a solution is an ordered assignment, usually represented by a tuple. The real equation $x+y=1$ has solution set $\{(t,1-t):t\in \mathbb{R}\}$, a straight line in the Euclidean plane with coordinates $(x,y)$. Adding $x-y=0$ intersects that straight line with another, leaving the single tuple $(1/2,1/2)$. A system of linear inequalities has no solution exactly when the intersection of its individual solution sets is the empty set. For optimization constraints, this common solution set is the feasible region.

Because a solution set is a set, the order in which its members are listed is irrelevant. The multiple root of $(x-1{)}^2=0$ is still the one solution $1$; its multiplicity of a root is additional polynomial information, rather than a second occurrence inside the solution set. Equivalent equations preserve the solution set on the stated domain, even if their algebraic forms differ.