The lower mass has coordinates . Its squared speed is . Adding the bead's kinetic energy gives the kinetic part of the supplied Lagrangian. Equal spring prestresses give spring energy up to a constant: the two squared extensions are proportional to . The gravitational potential is . Thus has exactly the stated form, with constant energy offsets discarded.
Since has no explicit time dependence, the conserved energy is
The two Euler–Lagrange equations are
At equilibrium, and . There are two geometrically distinct positions, modulo . The downward one has positive potential Hessian and is stable; the inverted one has a negative angular curvature and is unstable.
Keeping only quadratic terms about the downward equilibrium gives
For unit parameters, the mass and stiffness matrices are and . The equation is . Therefore the normal angular frequencies are
Multiplying the Vandermonde matrix by a coefficient vector evaluates the polynomial at all nodes. If the result is zero, part (a)'s uniqueness for the zero interpolation data forces every coefficient to be zero. Thus the square matrix has trivial kernel and is invertible. Equivalently the interpolation map is a linear bijection between two spaces of dimension .
Proceed column by column. At stage , consider the entries below the diagonal in column , indexed . If this tail is nonzero, part (c) provides a Householder matrix sending it to a multiple of its first coordinate vector. Embed this matrix as an orthogonal matrix acting identically on coordinates , and apply the similarity transformation . The tail's entries below row become zero. Symmetry is preserved, so the corresponding entries in row vanish too. If the tail is already zero, use the identity transformation.
Earlier reduced columns remain unchanged in their required zero positions: all their entries in the newly mixed tail coordinates were already zero, and the first coordinates are fixed. Thus each stage preserves the previous zeros while creating the next ones. After stages, all entries at distance greater than one from the diagonal vanish. With the product one has and
This constructive reduction uses only reflections on successive trailing subspaces.
Write each unrestricted coordinate as with . Then the primal has nonnegative variables , constraint matrix , and objective coefficients . Its dual constraints are and , hence equality. Therefore
The removed sign restriction on the primal variables becomes equality of the dual column constraints.
Compose the second map first. Direct substitution gives
The result is affine because the product matrix is invertible. The identity is and the inverse is . Associativity follows from composition of maps, or by expanding this product three times. Distinct pairs give distinct maps, since evaluating at zero gives and evaluating the difference on basis vectors gives all columns of . Thus these pairs faithfully describe a group.
Every pair factors as , and a linear map which is also a translation fixes zero and has linear part , hence is the identity. Thus and . The conjugation formula in (c) says that the action needed for reconstruction is simply the usual matrix action on the additive group . Therefore
The transition matrix is , where . It is row-stochastic: and for each . Initial states of zero probability can be specified by the chain's transition mechanism, so the matrix describes the chain from any starting state.
The chain rule at the specified point is
In standard coordinates this becomes
The matrix dimensions are respectively , , and , matching the composition of the two linear derivative maps.
The -th partial derivative is the vector limit
when it exists. The total derivative is a linear map such that
The Jacobian matrix is . When the total derivative exists, all partial derivatives exist and is its matrix in the standard bases; its -th column is . Existence of partial derivatives alone does not guarantee total differentiability.
For nonzero , the Householder transformation is
The rank-one matrix is symmetric and satisfies . Consequently and . Thus the matrix is symmetric and orthogonal; geometrically it reflects the component along and fixes its perpendicular hyperplane.
Compare every complete row with the given vector, returning as soon as a match is found. The length check prevents recycling of the vector; seq_len also handles an empty matrix correctly. This implementation treats a missing comparison as a nonmatch and always returns a Boolean.
row.match <- function(X, y) {
  stopifnot(is.matrix(X), length(y) == ncol(X))
  for (i in seq_len(nrow(X))) {
    eq <- X[i, ] == y
    if (all(!is.na(eq) & eq)) return(TRUE)
  }
  FALSE
}
For the integer-coordinate matrices used below there are no missing values, so this is ordinary exact row equality.
The Holstein–Primakoff transformation converts a spin algebra into bosonic operators while retaining the finite physical spin Hilbert space. With , write
The Holstein–Primakoff occupation constraint is . Acting on , the raising matrix element is and the lowering element is . Their squared difference is , reproducing . Operator ordering inside the square roots is essential. For low boson occupation relative to , expand them to obtain and . Keeping quadratic terms gives the linear spin-wave approximation; higher terms describe magnon interactions. Large helps control the expansion, but a low-dimensional infrared divergence can invalidate it even at large finite .
For the ferromagnet choose , , with unit lattice spacing and . Expand around the all-up state. A longitudinal bond contributes , and the transverse exchange contributes . After a Fourier transform,
These are ferromagnetic magnons. The polarized vacuum is an exact ground state of the full ferromagnetic Hamiltonian: every bond is in its maximum total-spin sector, minimizing that bond energy. It therefore has no quantum zero-point reduction of its magnetization. The one-magnon dispersion is also exact, although interacting many-magnon states need not be free bosons. Rotating the polarization generates the maximum-total-spin ground-state multiplet. Selecting a definite direction in a thermodynamic symmetry-breaking description breaks to ; the two transverse spin components form a canonical pair, producing a single quadratic type-B Goldstone boson. A small aligning field gaps it by the Zeeman energy.
At nonzero temperature the one-dimensional ferromagnet is different: its thermal magnon number contains , with infrared behaviour . The divergent magnetization reduction signals the absence of finite-temperature long-range order in an infinite short-range isotropic chain, consistent with the Mermin-Wagner theorem. It does not disallow the polarized zero-temperature ground states just constructed.[ref]
For the antiferromagnet use , still , on an even bipartite chain. The classical reference state alternates up and down. Rotate one sublattice through so that both local quantization axes point along their reference spins. In unrotated physical components, to leading order , , and . Choosing Fourier phases using the actual site positions gives
The reduced Brillouin zone has momenta and length . The pair creation and annihilation terms express the fact that an antiparallel reference product state is not an eigenstate. A bosonic Bogoliubov transformation with , , diagonalizes each two-mode block. With the sign convention and , the result is
Thus the harmonic antiferromagnetic modes have linear, rather than quadratic, long-wave dispersion. In an unfolded Brillouin-zone description the same result is represented by zeros at both zero and the antiferromagnetic wavevector; these are not extra independent degrees of freedom beyond the two-sublattice accounting.
The Bogoliubov vacuum has no or excitations but contains original spin bosons, with . Its staggered magnetization is . This quantum depletion of Néel order diverges logarithmically at small in one dimension. Linear spin-wave theory therefore does not establish a stable ordered antiferromagnetic ground state for this chain. Its nominal gapless dispersion is a result of expanding around an invalid ordered reference, not a general proof of the exact excitation spectrum. For the nearest-neighbour isotropic chain, integer-spin systems have a Haldane gap, whereas half-integer-spin systems are gapless; the spin-one-half chain in particular has fractional spin excitations rather than a simple dilute gas of ordered-state magnons. This distinction requires physics beyond the harmonic expansion, including the topological term in the continuum theory.[ref]
Figure 1.
Original harmonic chain dispersions; the antiferromagnetic curve is a spin-wave approximation, not the exact spectrum for every spin
. Details.
Every positive-energy Dirac spinor obeys . Therefore the fermion spin sum satisfies
Since and , the trace of each outer product is its contracted scalar. The prescribed normalization and the two spin states yield
Now make exactly the stated polynomial assumption and apply polynomial reduction of a slashed vector. By a, on the mass shell write . Then
The matrices and are linearly independent for a physical nonzero , so . The gamma matrix trace identities, and , give
Thus and
No explicit representation of the Dirac spinors has been used. The same reasoning covers provided .
Set , and , with . The ordered vectors are normalized but nonorthogonal, since . Their coordinate Gram matrix is therefore
An operator matrix in this basis is obtained from the coefficients in the images of its basis vectors, not by treating those vectors as orthogonal measurement outcomes. Directly applying the two reflection operators gives
Their columns are consequently
These are physical unitary operators even though the coordinate matrices are not unitary in the ordinary Euclidean coordinate norm: they preserve , so .
The Grover iteration in a nonorthogonal basis is
It has determinant one and trace , hence eigenvalues . For example, the invertible matrix of eigenvectors
satisfies
This diagonalization is exact for ; no large- approximation is needed.
To extract an actual probability using the Born rule, introduce the orthonormal unmarked superposition . In the ordered basis , the same iteration is the rotation
After iterations,
Equivalently the original coordinates are . The overlap with is the first coordinate plus times the second, recovering the same amplitude. Squaring just the first coordinate would be incorrect in a nonorthogonal basis.
For large , , and dropping the initial angle gives the requested approximation . The first near-unit success occurs at the integer closest to :
One can choose , with either neighbor equivalent in a tie. Further iterations overshoot and reduce success rather than monotonically improving it. The special problem needs no search and the two-vector coordinate construction becomes singular.
Figure 1.
Grover search success: exact initial-angle offset and overshooting the first maximum
. Details.
For an unstructured search, a reversible Boolean quantum oracle implements a phase change on the marked entry, while the diffusion reflection about a uniform state is known. Repeating the pair of reflections amplifies the marked amplitude and measurement yields a candidate that can be checked by another oracle query. The bounded-error query count is for one marked item, compared with classical queries. It is a quadratic oracle-query speedup: state preparation, the cost of implementing the oracle and access to a classical database still matter. The method does not reveal an unknown marked value without the promised query access.[ref]
For a nonzero quantum state and a self-adjoint operator , the expectation value and standard deviation of its measurement are
The squared deviation is also called the variance of the observable. All displayed products are understood on quantum states for which the relevant moments exist. Self-adjointness gives , so is real. Expanding the squared norm gives the variance expression. A norm is nonnegative and is zero exactly for the zero vector, hence precisely when . Thus zero dispersion is equivalent to being an eigenstate.
For bounded , the operator exponential is the norm-convergent power series
For a general unbounded self-adjoint Hamiltonian operator, the spectral theorem defines the same notation by
This definition does not require the power series to converge on every quantum state. complex conjugation of the spectral multiplier gives , and multiplication of the phases gives . Thus is unitary, preserves the quantum state norm, and has .
For initial data in the domain of , differentiating the spectral expression yields . Consequently
solves the Schrödinger equation with the prescribed initial quantum state. Uniqueness follows by differentiating : the two terms cancel, leaving the constant .
In the two-dimensional energy basis, expand the initial quantum state as . Each energy eigenvector receives its own phase under the operator exponential, giving
This is the general solution because every initial vector has a unique basis expansion.
In that orthonormal basis the other observable has the real symmetric matrix
Its conjugate transpose equals itself, so it is self-adjoint. Also and , giving eigenvalues and . Direct substitution gives the normalized orthogonal eigenvectors
An irrelevant global phase may multiply either vector. With the chosen lower eigenstate initially,
The Born rule says that the probability for the higher eigenstate is . Its amplitude is . Using gives
This is the transition probability for a rotated two-level observable. Its time dependence comes from the relative phase between two energy eigenstates. If their energies coincide, or if the measured observable has the energy eigenvectors as its eigenvectors, this transition probability is zero at all times.
Use an expansion for the eigenstate continuing the nondegenerate level, with intermediate normalization :
Insert these expressions into the eigenvalue equation. At first order,
Taking the inner product with eliminates the left side by self-adjointness. Thus
For , projection onto instead gives
At second order, projecting the eigenvalue equation onto gives . Expand in the orthonormal energy basis and use self-adjointness of :
Nondegeneracy ensures the denominators for this level do not vanish; convergence and validity of the expansion are among the assumed perturbation-theory hypotheses.
For the cosine perturbation of the ground level in a one-dimensional box, write . The product-to-sum identity gives
so, with the given common normalization of the sine eigenfunctions,
The diagonal matrix element is , and the only nonzero off-diagonal matrix element out of the ground state is . Let . Since , the ground energy is
The second-order term is negative, as expected for a nondegenerate ground level: every excited-quantum state denominator is negative. The first-order shift is also negative for positive , because the ground-quantum state density is largest near the center, where this perturbing potential is negative.
Use the Dirac notation convention that the inner product is linear in the ket. Orthonormality of the computational basis gives
The finite geometric sum satisfies if in , and zero otherwise: in the second case it equals . Therefore
There are such orthonormal vectors in an -dimensional space, so they form a basis. The inverse expansion is verified by the same sum:
This is the unitary discrete Fourier transform and its inverse.
For the basis-copying isometry, the images are orthonormal, so is a linear isometry, with . Its matrix elements give
Applying the definition of the adjoint operator, the coefficient of in is exactly this expression. Thus
Equivalently . The adjoint of basis copying acts as pointwise multiplication of coefficient functions.
For the Fourier transform of a basis-copying isometry, the normalization matters:
Hence . Taking adjoint matrix elements, or expanding both output factors in the inverse Fourier basis, yields
The printed formula is missing the factor . There are mutually orthogonal terms in its sum, so without that factor its right side has norm , whereas its left side has norm one because is an isometry. The formula above is the normalized identity consistent with all the preceding definitions. For the distinction disappears, but the no-cloning assertion is substantive for .
The normalized output is not . Its coefficient matrix pairs every Fourier label with ; tracing out either factor gives . Thus it is a maximally entangled state, while two clones of a pure Fourier quantum state would have pure reduced quantum states. A copier for the computational basis therefore does not copy the Fourier basis.
More generally, suppose a linear isometry with a fixed blank input could clone every normalized quantum state. Its restriction to would define a linear map with on every computational basis quantum state. Linearity forces , which has just been shown to fail on Fourier quantum states. This proves the no-cloning theorem in the pure-quantum state isometric setting.
The inner-product proof makes the obstruction independent of the chosen basis. If an isometry cloned two quantum states with overlap , preservation of inner products would give , or, allowing irrelevant output phases, . Distinct nonorthogonal rays have , which is impossible. Even allowing an output environment does not help: unitary evolution would give , the same contradiction. Arbitrary unknown quantum states cannot be cloned, although any fixed orthonormal basis can be copied and a one-dimensional quantum state space is trivial.
A density operator is a positive self-adjoint trace-class operator with . A finite expectation is . It represents a pure state exactly when for a unit vector, equivalently or .
For a finite-dimensional spectral decomposition , introduce an auxiliary space with orthonormal vectors and use the enlarged space . Define
Then and . This purification shows that subsystem mixedness can arise from entanglement with an unobserved environment even when the total state is pure. Subsystem measurements alone cannot distinguish these two descriptions.
A nonzero pure bipartite vector is entangled when it cannot be written as a tensor product of two vectors; equivalently its Schmidt rank exceeds one. For mixed bipartite states, entanglement means absence of a convex decomposition into product density operators.
For the nonorthogonal expansion in the question, the unnormalized reduced operator is
Indeed . Positivity follows because , and . Thus is a density operator; if is already normalized, . The Gram factors cannot be dropped merely because the vectors are called bases. For unnormalized , physical expectations likewise divide its raw quadratic form by .
For the Schmidt decomposition diagonalize in an orthonormal basis with its positive eigenvalues . Expand with . The reduced matrix gives . Therefore are orthonormal and
Zero-eigenvalue components vanish because their squared norms are zero. This proves the decomposition for an arbitrary nonzero vector; the zero vector uses the empty sum. For a unit vector .
In the numerical example the coefficient matrix in the two product bases is . Taking the first-subsystem trace yields
The vector is in its nullspace, so rank is at most two; its leading minor has determinant one, so . This is the rank of and the Schmidt rank, proving entanglement. The displayed source ket has norm squared , and the displayed reduced matrix has trace . The physical density operator is ; its nonzero eigenvalues are , since . The raw matrix is correct for the unnormalized quadratic form actually printed.
Put and , with nonnegative integer so the register exists. The geometric sum satisfies
Consequently the matrix with entries has . This proves unitarity and
For a binary output string , expansion of the printed tensor product gives coefficient
Thus the printed product is exactly . It is a correct product decomposition of a Fourier phase state, but the printed recovery identity has inconsistent signs:
by the square of the quantum Fourier transform. To recover instead, use , replacing every product phase by its complex conjugate. Equivalently one may reverse the sign in the definition of . The discrepancy is visible for by taking concentrated at : the printed expression returns the basis vector at . The recovery display also uses as the summation variable on its right while its summand uses ; that dummy variable should be .
For factorization first check . Successive residues are
The first return is . Its half power is , which is neither nor modulo . Therefore
In Shor's algorithm prepare a uniform exponent register of size , conveniently , and reversibly compute into a second register. Measuring that second register, or tracing it out, leaves periodic exponent correlations of period . Conditional on one measured residue, the first register is a superposition over an arithmetic progression of exponents separated by . The quantum Fourier transform converts this periodic structure into peaks near . Continued fractions recover ; when is coprime to , its denominator is . Verify by modular exponentiation and repeat when the reduced denominator is insufficient. For this example is suitable, and useful peaks include those near and . Either transform sign gives the same period information, so the source's inverse-sign error does not invalidate the order-finding mechanism.
In the ordered basis , the transverse magnetic field produces
The off-diagonal complex exponentials follow directly from . This matrix is Hermitian at every time.