For an matrix here, . The sine vectors give eigenvalues
Thus every eigenvalue lies strictly between and . For , , so , including the upper endpoint . Hence the iteration converges for the entire stated range.
The extreme eigenvalues are and , with . The spectral radius is for . It decreases up to one and increases after one, since . Therefore
For the same formula gives zero spectral radius and exact solution in one ordinary Jacobi step.
Solving the two factors in each equation gives . The Jacobian is
At the three boundary equilibria its eigenvalues are . These equilibria are hyperbolic fixed points; the Hartman-Grobman theorem gives local topological conjugacy to their saddle linearizations. At the matrix is , with eigenvalues . The linearization is a centre, but the hyperbolic theorem does not apply there.
The nonlinear classification follows from the actual Hamiltonian
Along solutions . At , and its Hessian is , which is positive definite. Nearby regular level curves are closed ovals around this strict minimum. Their vector field is nonzero and tangent, so each is a periodic orbit. The nonlinear equilibrium is a centre.
The separatrix level consists of , , and . Within the triangle they connect the saddles as . The interior levels are nested clockwise periodic orbits; outside the triangle the remaining level branches are unbounded. On , flow is left for and right for or ; on , it is up for and down otherwise. These directions and the invariant levels determine the full phase portrait.
Figure 1.
Hamiltonian level curves and flow around the three saddles and centre
. Details.
The origin has Jacobian and is unstable because . At a positive equilibrium, , giving
The linearization is
Its trace is and determinant . Elimination gives . For distinct roots,
At a repeated root replace the first expression by and use .
As , , so the roots approach one and zero. The characteristic polynomial at one is , putting the larger real root just below one and the other positive root below it. No real root can ever equal one. Moreover
since its numerator exceeds . At , , so the roots are conjugate and nonreal. Just above this point their modulus is .
The unit-disc conditions are , , and . The last two hold automatically here, so stability is equivalent to . The unique crossing and its eigenvalue argument satisfy
Indeed . This is the stability threshold of a discrete exponential predator-prey model. The sketch uses : the real moduli merge and then coincide, increasing through one at the threshold. Linearization decides stability below and instability above; it does not determine nonlinear stability exactly at the crossing.
Figure 1.
Eigenvalue moduli and the stability threshold of the discrete predator-prey model
. Details.
With and , the matrix of is . Multiplication by and gives eigenvalues and , using the double-angle identities.
The one-particle transformation is the matrix , with determinant one. The antisymmetric tensor transforms by this determinant under , so the singlet is unchanged. The total kills it. Its invariance under these rotations implies that total also kills it for every , so total kills it. The spin commutator then gives total acting as zero. Therefore and it has total spin zero.
Rotating only particle B produces
The measurement probabilities are therefore
Each arrow represents the corresponding value . The sequential measurements commute because they act on different particles. The two parallel outcomes leave triplet states with total spin one and . Each antiparallel product state is a superposition of the spin-zero singlet and the spin-one zero-projection triplet, and is not an eigenstate. Outcomes of zero probability at a special angle do not actually occur.
For a periodic potential, the Hamiltonian commutes with every lattice translation. The three primitive translations are commuting unitary operators, so within each energy eigenspace one can choose simultaneous translation eigenstates. Their eigenvalues have modulus one and can be written . Translation by any lattice vector then gives
This proves Bloch's theorem in its eigenbasis form; arbitrary superpositions inside a degenerate eigenspace need not themselves have a single Bloch wavevector.
The reciprocal lattice consists of vectors with . Changing to and to gives the same physical wavefunction with a periodic new . The eigenvalue problem on one cell has a discrete set of levels, giving bands indexed by , and this equivalence yields . A reciprocal-lattice fundamental domain, conventionally a Brillouin zone, therefore labels inequivalent wavevectors.
Periodic boundary conditions in physical volume give one allowed wavevector per reciprocal-space volume . Including the two spin states, there are states; per unit physical volume the count is the printed . Each occupied state carries charge and velocity , so
For a full band, the integral of is a boundary integral. Opposite faces of a reciprocal fundamental cell have equal energies by periodicity and opposite normals, so their contributions cancel. Hence a full band carries zero electric current.
Assume the consistency regularity implicit in the requested rate, for example on the closed square. Bounded fourth derivatives and Taylor's theorem give a uniform residual with . Subtracting the exact grid values from the numerical equations gives , with zero boundary error.
Let be the unscaled positive Dirichlet matrix. Its eigenvectors are products of discrete sine vectors, which form an orthogonal basis; direct substitution gives eigenvalues
Since for , . Therefore . The error equation is , and its residual has norm . Combining the bounds yields
This is the unweighted grid error for the five-point Poisson formula. The unweighted norm loses one power of because the grid has order points; the area-weighted norm is second-order accurate. A regularity assumption is needed for the uniform truncation estimate and hence for this rate; the question does not specify it explicitly.
For a nonidentity element of represented by a determinant-one matrix, the classification is elliptic, parabolic or hyperbolic according as the squared trace is less than, equal to or greater than four. This follows either from the eigenvalues or from the discriminant of its fixed-point equation on the boundary of the upper half-plane.
The first matrix has determinant one and trace two, and is not scalar. It is therefore parabolic. Its fixed-point equation is
Thus its unique fixed point is on the real boundary, of multiplicity two; infinity is not fixed and there is no fixed point in the upper half-plane. The second matrix has determinant one and trace , so it is hyperbolic. Its two boundary fixed points are , consistently with this classification.
A homogeneous equilibrium has . Besides , a nonzero equilibrium satisfies , giving . Concentrations are nonnegative, so only nonnegative roots are physically admissible. At a positive equilibrium, the reaction Jacobian matrix is
Negative trace and positive determinant are equivalent to
Thus a positive homogeneous stable branch exists precisely when and , on the upper root . The lower positive branch has negative determinant and is unstable. At the branches meet and have a zero eigenvalue; at the strict linear stability condition also fails.
The trivial equilibrium has eigenvalues , so it is asymptotically stable for . It exists for all , independently of the nonzero branches. If negative were allowed mathematically, the negative branch for would also be homogeneously stable, but it does not represent a chemical concentration.
A Fourier mode with evolves under . Its trace remains negative for a homogeneously stable positive branch. Its determinant is
If , this is positive for every . Otherwise its minimum is attained at . Stability requires , or
In terms of , the boundary is the positive root of :
Within , all modes decay for ; a finite band grows for , giving a Turing instability. Equality is neutral at one nonzero wavenumber.
For , the positive lower branch is unstable for every . The upper branch is homogeneously stable for : it is stable to all modes to the left of and unstable to spatial modes to the right. For it is already homogeneously unstable. The zero branch is stable to every spatial mode when , because its mode eigenvalues are and .
Figure 1.
Positive homogeneous branches and their spatial stability for s equals two
. Details.
For and , a nonzero infected equilibrium requires . Using and population conservation gives
Eliminate before assessing stability, since perturbations must preserve the total population. The resulting Jacobian matrix at this endemic equilibrium is
Its trace is negative and its determinant positive, so both eigenvalues have negative real part: the endemic equilibrium is locally asymptotically stable on the fixed-population plane. The full three-variable system has a neutral direction corresponding to changing the conserved population.
Writing , as the trace is and the determinant is . Hence the discriminant . As , the trace is and the determinant is again , giving a positive discriminant . Both quantities are in both limits, but the eigenvalues are complex for sufficiently small and real for sufficiently large .
Representative normal forms are for a saddle-node bifurcation, for a transcritical bifurcation, and for a supercritical pitchfork bifurcation. Replacing the last cubic term by gives the subcritical pitchfork bifurcation.
Treat as a variable with . The extended center manifold is tangent to , so write . Its invariance equation is . At quadratic order this reads
Matching coefficients gives , , . Substitution into the first equation therefore gives
Here denotes total degree at least three in . With , and , this becomes . Thus , , , and the bifurcation is a saddle-node. For negative parameter, the negative- branch is stable and the positive- branch unstable along the center manifold; the transverse eigenvalue is near .
The Lie group is a second-countable space. For every point of its discrete subgroup, choose the first basic neighbourhood isolating that point; different elements require different such neighbourhoods. This injects into a countable set, proving countability.
A discrete subgroup is closed and meets compact sets in finitely many points. Indeed, distinct subgroup elements accumulating anywhere would give quotients converging to identity, contradicting an identity neighbourhood containing no other subgroup element. To apply this, use the positive Hermitian determinant-one model of hyperbolic space. At the base point , the image under a determinant-one representative is and
This distance formula follows by unitary diagonalization: eigenvalues are and the axial hyperbolic displacement is . Thus bounded displacement bounds all matrix entries. The determinant-one condition is closed, so the resulting set is compact; the quotient by is compact too. Conjugation gives the same conclusion at any base point. These are the bounded displacement sets of hyperbolic isometries are compact facts.
Hence, for each , only finitely many satisfy . Any enumeration of an infinite group without repetitions therefore has . A finite discrete group is a harmless exception to the wording: it has no infinite enumeration of distinct elements, and proper discontinuity is immediate.
For a compact set , put . If , choose . The triangle inequality gives . Only finitely many such exist, proving properly discontinuous group action. Conversely, if the subgroup is not discrete, there are distinct . A closed ball about then meets its images under infinitely many , violating this compact-set definition. Thus discreteness is equivalent to proper discontinuity. Here proper discontinuity allows finite point stabilizers; a stronger convention requiring freeness would exclude discrete elliptic subgroups and is not the equivalence intended.
In the usual nondegenerate convention, a strongly regular graph of order and parameters is a finite simple -regular graph with in which adjacent vertices have common neighbours and distinct nonadjacent vertices have . Its adjacency matrix of a graph obeys
For the usual nondegenerate parameters with the graph is connected, so eigenvalue has multiplicity one. On the perpendicular complement of the all-ones vector, and the possible eigenvalues are
If has multiplicity , then zero trace gives . Solving proves
The denominator is positive in this nondegenerate convention. Otherwise all eigenvalues on the all-ones complement would coincide, forcing . All off-diagonal entries would then be the same, making the graph complete or edgeless. If complete graphs are admitted with arbitrary unused , the printed claim needs qualification: with satisfies the common-neighbour conditions vacuously but makes the fraction . For complete graphs with nonzero denominator, the spectral calculation still works with an unused root of multiplicity zero.
For the triangle-free graph claim, suppose first there are at least two vertices. Nonadjacent vertices have a common neighbour, so the graph is connected. If are adjacent, put and . Every member of is nonadjacent to , and exactly two of its three common neighbours with lie in , the third being . By symmetry every member of has exactly two neighbours in . Counting these edges gives , hence . Connectivity makes the graph -regular. Counting length-two paths from a vertex to non-neighbours gives
Here , , and the larger-root multiplicity becomes . Thus is rational and therefore an integer. It is odd, , and integrality also gives . Since , one obtains , hence
The complete bipartite graph realizes : vertices in the same part have all three vertices of the other part as common neighbours, and vertices in opposite parts are adjacent. There are no triangles.
As literally worded, the one-vertex graph is a vacuous exception: it has no triangles or nonadjacent distinct pairs, but has . The displayed positive-degree classification therefore requires at least two vertices. This qualification completes the triangle-free graphs with three common neighbours argument rather than silently excluding a counterexample.
A bounded operator on a complex Hilbert space is self-adjoint when , equivalently . The spectral theorem for compact self-adjoint operators says its nonzero spectrum consists of real eigenvalues of finite multiplicity, with at most countably many and with accumulation possible only at zero. Their eigenspaces are mutually orthogonal; their closed span is the orthogonal complement of the kernel. On that span the operator has the norm-convergent spectral action .
Take and . It is self-adjoint and has infinite-dimensional range. Truncation to the first coordinates is a finite-rank operator and differs from in norm by , so is compact.
The resolvent set comprises those for which has a bounded everywhere-defined inverse; its complement is the spectrum, and the point spectrum consists of eigenvalues. In this example
For outside the displayed closed set the inverse is diagonal with entries uniformly bounded, proving membership of the resolvent. Each has eigenvector . Zero is not an eigenvalue, but prevents a bounded inverse; also has no preimage since that would be the non-square-summable constant sequence. This justifies every asserted spectral case.