Represent the Riemann sphere by the complex projective line, with finite represented by and infinity by . An invertible matrix acts by , giving the stated fractional map on finite points. Applying and then is exactly matrix multiplication , including at poles and infinity. Therefore
so is a group homomorphism from the special linear group to the Möbius group.
Every Möbius transformation has an invertible complex matrix representative . Choose with . Such a nonzero square root exists in , and has determinant one while representing the same projective map. This proves surjectivity. If the map is the identity, fixing zero and infinity forces , and fixing one forces . The determinant-one condition gives . Conversely both scalar matrices and act trivially. Hence
For the normal forms, use the fact that a complex matrix has a Jordan normal form: either it is diagonalizable or it has one nontrivial Jordan block. For a determinant-one representative, distinct eigenvalues are . Diagonalizing gives , whose projective action is . Distinctness means , so is neither zero nor one.
If the eigenvalue is repeated, the determinant condition gives . A diagonalizable representative would be and would give the identity, excluded here. A nontrivial Jordan block is similar to , giving . Any invertible conjugating matrix gives a Möbius transformation; rescaling it to determinant one does not change that map. Thus these matrix similarities are genuine conjugacies in the Möbius group, proving the requested Möbius conjugacy normal forms.
Conjugacy preserves fixed points bijectively. A nonidentity scaling has exactly the two fixed points zero and infinity, while either translation has exactly one, infinity. The identity fixes every point. This proves all three possibilities and excludes any further finite number of fixed points.
Finally, suppose , with and . Then for every finite in the topology of the Riemann sphere; infinity remains infinity. Since is continuous on that sphere,
This is iteration of a one-fixed-point Möbius transformation. The limiting statement includes the unique fixed point itself and uses spherical convergence, which also handles intermediate iterates equal to infinity.
Let denote the generation- type-count vector, and let from a single type- ancestor. Every type- child independently has probability of having descendants in generation . For a Poisson random variable with mean , . Independence across child types therefore gives
The events of nonempty successive generations decrease. Each individual has finitely many children almost surely, so the total tree is infinite precisely when no generation is empty. Consequently , the actual survival probability of a branching process. Continuity of yields
The map is coordinatewise increasing on nonnegative vectors. Every nonnegative fixed point automatically lies in , since its coordinates equal with finite . Hence and, by induction, . Taking limits proves in every coordinate, so is the greatest nonnegative solution, not merely some fixed point. This argument applies without irreducibility assumptions to the multitype Poisson branching process.
The necessary and sufficient condition is
where is the spectral radius of the nonnegative matrix. No irreducibility is required. We use the given nonnegative-vector characterization of its Perron eigenvalue.
For necessity, suppose is the survival fixed point and let . Since for every , its equation gives for every . There are finitely many such coordinates, so
Outside the inequality still holds, because its right side is zero and its left side is nonnegative. The provided Perron–Frobenius theorem characterization therefore gives . In particular survival is impossible at for this Poisson offspring law.
Conversely suppose . The given characterization supplies a nonzero with ; normalize it so . For sufficiently small ,
For example any works. Coordinates with satisfy the inequality automatically. Starting at , iterate . Monotonicity makes the sequence increase, and takes nonnegative vectors into , so it converges to a fixed point . Part (a) gives , proving survival from at least one type. This proves the spectral survival criterion for multitype Poisson branching for reducible as well as irreducible reproduction matrices.
A fixed point of the left shift satisfies for every , so its entire two-sided sequence is constant. The constant sequence with value belongs to the subshift of finite type precisely when : this is exactly the requirement that its repeated transition be allowed by the symbolic transition matrix. There is one such fixed point for each diagonal entry equal to one. Thus
This also covers an empty subshift of finite type, for then no permitted constant sequence exists.
The equation says for every . Thus a solution is determined uniquely by the block , repeated in both directions. It belongs to the subshift of finite type exactly when all transitions inside the block, and the closing transition from to , are allowed. Hence these fixed points of the th iteration of a map are in bijection with the closed transition chains of steps with a specified symbol at time zero. By the counting argument in part (b), the number starting at is . Summing over proves the trace formula for periodic points of a subshift:
Every closed transition chain extends by periodic repetition, so the extension issue in part (b) does not affect this formula. We count points, not periodic orbits: a least-period- periodic orbit contributes its distinct points.
Here period means fixed by , so the least period may divide . If denotes the number of points of least period exactly , division with remainder shows that a point is fixed by exactly when its least period divides . Consequently
where is the Möbius function and the second equality is Möbius inversion. For example, has one point fixed by every power but no point of least period two; interpreting the printed formula as an exact-period count would therefore be false.
The quadratic discrete predator-prey map equals the identity plus the vector field of part (a), so its admissible fixed points are the same . Their Jacobian matrices are the identity plus the corresponding continuous-time Jacobian matrices, but map stability requires eigenvalues inside the unit circle rather than the left half-plane.
At the multipliers are : it is a sink for and a saddle for . At they are and . Therefore
For , the prey multiplier is below : is a saddle when and a repeller when . For , makes it a saddle. The crossings at and are the two transcritical bifurcations already encountered. The crossing at is a prey period-doubling bifurcation.
At positive coexistence,
For clarity, derive the relevant Schur stability criterion directly: setting in gives
The open unit disk maps to . A real quadratic has both roots there precisely when all three displayed coefficients have the same positive sign. Since , the coexistence fixed point is a sink precisely when
This region exists only for . In the coexistence triangle , put . If , one root lies below and the other in , so is a saddle. If but , it is a repeller; if , it is a sink. These signs give the complete local fixed-point partition, including real and complex multipliers.
The coexistence period-doubling bifurcation lies at ; its segment adjoining the sink region has . The other multiplier there is and lies strictly inside the unit circle on this segment. This coexistence flip is subcritical on that segment. To calculate its direction, normalize the eigenvector by and the left eigenvector by . The symmetric quadratic derivative is given explicitly in part (d). Eliminating the quadratic term from the one-dimensional centre manifold map gives the effective cubic flip coefficient
For a scalar reduced map , its second iterate satisfies . Thus on the stable-fixed-point side , and the two-cycle multiplier is . An unstable coexistence two-cycle meets the stable fixed point as increases to the flip curve. The other multiplier remains inside the unit circle. The complex unit-modulus crossing lies at , with . The two curves meet at with a double multiplier . The prey flip and predator invasion curves meet at with multipliers .
The sketches mark the sink regions and all these local thresholds. They are a local atlas, not a claim that the map has only these global attractors. Indeed the full nonnegative quadrant is not invariant: becomes negative when . On the prey axis the logistic map already supplies new dynamics. Its nontrivial two-cycle, obtained by factoring after removing the fixed-point factors, is
Its longitudinal multiplier is , so it is stable on the axis for . The transverse multiplier is , making the cycle stable in the plane when additionally . Further flips and more complicated logistic dynamics show why the differential equation's three global regions cannot be transferred unchanged to its unit-step map.
Figure 1.
Local stability regions and fixed-point bifurcation curves of the quadratic predator–prey map
. Details.
On the coexistence fixed point has
For these give a nonreal conjugate pair on the unit circle. Nearby, while the pair remains complex, its modulus is ; increasing through one changes the modulus from greater than one to less than one. This is the candidate Neimark–Sacker bifurcation, and a nonlinear coefficient is needed to decide its direction.
Here that coefficient can be calculated explicitly. Let , , and normalize the right eigenvector and complex projection by
For deviations , the quadratic derivative is
Thus , and are the quadratic coefficients in . The quadratic coordinate change has
Substitution into the map and collection of yields
Using and simplifies the cubic radial coefficient of a quadratic planar map to
Consequently, away from strong resonances of a planar map, the bifurcation is supercritical: on coexistence is attracting, whereas on a small attracting invariant closed curve surrounds the unstable coexistence fixed point. If , its leading radius is , and its radial multiplier is . Motion on the curve can be quasiperiodic or frequency-locked into periodic motion; stability of the curve alone does not imply an irrational rotation.
Two interior values need qualification: is a 1:3 resonance, and is a 1:4 resonance. At the former is singular and the quadratic term must be retained. At the latter a cubic term remains. The resonant terms can be displayed explicitly in the same normalization. At , . The third iterate, near the resonance and after removing nonresonant quadratics, has
Here is the angular detuning. Its nonzero stationary solutions have and three phases; they constitute a saddle three-cycle. Indeed the two leading real exponents at these solutions are , of opposite signs. Therefore no ordinary attracting-circle conclusion follows arbitrarily close to the exact 1:3 point.
At , the cubic resonant normal form is
The extra coefficient follows from and . Its radial cubic damping is uniform since . The slow angular equation is , so fourfold phase locking must be considered. For example, varying at fixed gives . The locked branches satisfy and . For they form one attracting and one saddle four-cycle; the two branches alternate in phase. This is a resonant alternative to quasiperiodic motion on an invariant curve. The endpoints also fail the simple-complex-pair assumptions. This distinguishes the generic nearby dynamics from unjustified claims about every point on the printed interval.
The triangular-grid form is Sperner's lemma: subdivide a triangle into small triangles meeting edge to edge, label its vertices , and forbid label on the side opposite corner . The corner labels are thereby forced. An odd number of small triangles, in particular at least one, carry all three labels.
Here is the parity proof. Count incidences of a small triangle with an edge whose endpoint labels are . On the outer boundary these edges occur only on the side joining corners ; traversing that side begins with label one and ends with label two, so the number of changes of label is odd. Interior edges contribute twice to the incidence count. A small triangle with all three labels contributes once; a triangle having only labels one and two contributes twice if it has both, and all other triangles contribute zero. Reduction modulo two therefore proves the assertion.
To obtain the continuous Brouwer fixed-point theorem on the triangle, use barycentric coordinates and a continuous map from the triangle to itself. If a grid vertex is not already fixed, label it by an index with , which exists since both coordinate sums are one. A point on the side cannot receive label , so the discrete lemma applies. On successively finer grids take a fully labelled small triangle. Compactness gives a subsequence converging to one point ; all three vertices converge to it because the mesh tends to zero. Passing to the limit in the three label inequalities gives for every . Equal coordinate sums force equality throughout, hence .
A closed disk is homeomorphic to a triangle: radial coordinates from an interior point, scaled by the distance to the boundary in each direction, give such a homeomorphism. Conjugation therefore gives the same fixed-point assertion on the disk. If were a continuous retraction from the unit disk to its boundary, define . A fixed point would have , hence and , impossible on the unit circle. Thus no continuous disk-to-boundary retraction exists. The continuous conclusion has been deduced from the grid parity argument, not used to prove it.
In the hyperbolic-ball model, the limit set of a Kleinian group is the boundary accumulation set of an orbit of an interior point: . The choice of does not matter, since any two such orbits remain a fixed hyperbolic distance apart. It is closed and -invariant. The complicated/non-elementary hypothesis excludes relatively compact groups and elementary groups with at most two limit points; in particular the limit set is nonempty. Having no finite boundary orbit alone would not exclude a compact rotation group, whose interior orbits are bounded.
If were finite and nonempty, the orbit of any of its points would be a finite boundary orbit, contrary to the hypothesis. Thus it is infinite. In fact it cannot be countable. We give the essential minimality/perfectness argument. A sequence of Möbius transformations sending an interior point toward has a subsequence converging on the boundary away from one exceptional point to the constant . This follows by normalizing the representing matrices: a diverging sequence has a rank-one projective limit, with one kernel line and one image line. For any boundary point , the absence of a finite orbit allows choosing with different from that exceptional point; then . Hence the orbit of every is dense in .
If were an isolated limit point, density of every orbit would make every point belong to its orbit: each orbit must hit the open singleton . Every point would then be isolated by equivariance, making the compact set discrete and therefore finite, a contradiction. Thus is a nonempty perfect compact metric space. Repeatedly choosing two disjoint smaller neighbourhoods meeting this perfect set, with diameters tending to zero, associates distinct nested limits to all infinite binary sequences. The limit set is therefore uncountable.
Jorgensen inequality states that for a non-elementary discrete group generated by lifts ,
For a concrete failure of discreteness, take and with small. The fixed points of and of collectively include , so the group is non-elementary. Direct multiplication gives both summands equal to . Their sum is less than one when is sufficiently small, proving this two-generator group is not discrete.
For a connected-limit-set example, the modular group generated by and is discrete because its matrices have integer entries. It preserves the upper half-plane; its limit set is the extended real line, a circle. Indeed the orbit of the parabolic fixed point infinity consists of the rational points and infinity, dense in that circle. For a disconnected example, choose four pairwise disjoint round disks and two loxodromic maps pairing the exterior of each negative disk with the interior of its positive disk. The Schottky group generated by these maps is free and discrete by the disjoint-domain ping-pong construction. Successive reduced words give nested disjoint disks with shrinking diameters; their limiting points form a Cantor set. Thus its limit set is disconnected, unlike that of the modular group.
At a fixed point , and the first equation factors. The branches are
The three branches meet at , and the positive square-root branch meets the quadratic branch at . The Jacobian matrix at a general fixed point is
On , its trace is and determinant : the branch is attracting for and a saddle for or . On , the eigenvalues are and . The negative branch is always a saddle for ; the positive branch is a saddle for and attracting for . At the bifurcation values the zero eigenvalue requires the nonlinear analysis below.
For , , , the equations are
The extended centre manifold has with no linear terms. Since has degree at least three, its invariance equation to degree two is . Thus
The reduced quadratic factors as . Its two roots have reduced eigenvalues and , respectively, and the transverse eigenvalue remains negative. They exchange stability at , a transcritical bifurcation. The exact branches have and , consistent with this second-order evolution equation.
Near , the slow equation has leading form , so this is a subcritical pitchfork bifurcation with the parameter orientation displayed. For there is one nearby saddle, whose unstable direction is close to and stable direction close to vertical. For the central branch is attracting and the outer two equilibria near are saddles; their separatrices distinguish attraction toward the central equilibrium from departure outwards. The actual central location is , not exactly the origin away from .
Adding positive breaks the pitchfork symmetry. The leading equilibrium equation near zero is : the diagram unfolds into a single branch plus a saddle-node pair, with the latter appearing for positive of order . More precisely the fold is at , at leading order. Near one the reduced equation becomes . Its discriminant is ; the crossing is replaced by two saddle-node endpoints with a no-equilibrium gap for to leading order. Outside that gap, the lower reduced root is stable and the upper one unstable. These local approximations describe the sketch; the exact perturbed curves have higher-order corrections.
Figure 1.
Fixed-point branches, local phase portraits and the positive-forcing unfoldings of the pitchfork and transcritical bifurcations
. Details.
Figure 2.
Nearby planar flows on either side of the subcritical pitchfork, with exact equilibrium locations
. Details.