For the compact set chosen in the preceding step, the Urysohn lemma gives a continuous function equal to one on and zero on . In a metric space this cutoff can also be written explicitly, when and are both nonempty:
The two sets are disjoint and closed, so the denominator never vanishes, and their distance functions are continuous. If is empty, take ; if and is nonempty, take . These choices satisfy the required boundary conditions in the exceptional cases.
The difference vanishes on and outside , and its absolute value is at most one everywhere. Therefore
This is the precise continuous approximation required by both proofs of ergodicity, and also gives .
For a Borel set and , inner regularity supplies a compact set with . Independently, outer regularity supplies an open set with . Because and the measure is finite,
This creates an arbitrarily small measurable transition region between a compact inner approximation and an open outer approximation. The cutoff in the next step then approximates , rather than merely approximating the number .
Here is an alternative route for the ergodicity step using the Birkhoff ergodic theorem. After invariance has been proved, the theorem identifies the almost-everywhere limit of with . The hypothesis therefore gives
for every continuous function . For an invariant Borel set , approximate in by such a . Since is measurable with respect to the invariant sigma-algebra, its conditional expectation is itself. The L1 contraction of conditional expectation gives
Arbitrarily accurate continuous approximation forces almost everywhere. Thus this use of the theorem reaches the same zero-or-one criterion as the direct averaging proof above, without assuming in advance that is ergodic.
Outside the countable set of dyadic rational numbers, the binary expansion is unique. Multiplication by two modulo one deletes the first binary digit, so
Let . By part (b), the doubling map is a measure-preserving transformation and is ergodic for Lebesgue measure. Applying the Birkhoff ergodic theorem to this indicator function gives
for almost every . The dyadic rationals have Lebesgue measure zero, so the choice of their two possible binary expansions does not affect the conclusion. Thus the limiting frequency of the digit one is almost everywhere.
Identify the circle group with modulo its endpoints, and let be normalized Lebesgue measure. We first check invariance. On the th inverse branch, for . For an integrable function , substitution gives
In particular, testing indicator functions shows that the integer multiplication map on the circle preserves .
To prove ergodicity, let be a measurable set with and put . Then almost everywhere. Its Fourier coefficients are
Using invariance of and substituting separately on the same branches gives
In the last line, the finite geometric series of th roots of unity is zero unless divides , when it equals . For any nonzero integer , divide repeatedly by until the resulting integer is no longer divisible by . The recurrence then implies .
Since the Fourier basis is a complete orthonormal basis of , the absence of every nonconstant Fourier coefficient implies almost everywhere. An indicator function takes only the values zero and one, so must be zero or one. This proves
Let be a probability space, let be a measure-preserving transformation, and let . The Birkhoff ergodic theorem asserts that
for almost every , where is the invariant sigma-algebra. The limit is integrable, satisfies almost everywhere, and has . On a probability space the convergence also holds in . No invertibility of is required.
If is ergodic, its invariant sigma-algebra is trivial modulo null sets, so its conditional expectation is constant. In that case the concise form is
Write the hyperbolic toral automorphism as on , where . Its determinant is . The eigenvalues cannot be a nonreal conjugate pair: their product would have absolute value one, forcing each to have absolute value one, contrary to hyperbolicity. The same product condition and hyperbolicity imply two distinct real eigenvalues, labelled so that
We will prove
This is the entropy of a hyperbolic toral automorphism; the absolute value is important when the expanding eigenvalue is negative.
Choose real eigenvectors and the adapted norm . Its quotient metric on the torus is
It is a compatible metric, so part (a) allows its use. Let and . Fix small enough that and .
If lies in the Bowen ball , each has a unique lift with . Uniqueness follows because two such lifts differ by a lattice vector of norm less than . Moreover, is a lattice vector, and
It must be zero. Thus : there is no hidden lattice jump between successive lifted iterates.
Write . The simultaneous bounds for are exactly
The stable coordinate is largest at time zero and the unstable coordinate at time . Conversely, every vector in this rectangle satisfies all the Bowen ball bounds. The quotient is injective on this rectangle by . If , its normalized Haar measure is therefore
The quotient metric is translation invariant and is linear, so ; every Bowen ball has this same measure, independently of its centre.
Take an -separated set of largest cardinality . It is maximal under inclusion, so its radius- Bowen balls cover the torus: a point outside all these balls could be added. The covering bound gives
Its radius- Bowen balls are disjoint, by the triangle inequality for . Their measures sum to at most one, giving
Taking logarithms, dividing by , and letting yields for every sufficiently small . The limit as proves the answer. Contraction in the stable direction contributes no exponential growth; only expansion in the unstable direction does.
Let be a homeomorphism with . This is topological conjugacy. Choose a compatible metric on and pull it back to :
Because is a homeomorphism, is a compatible metric. The conjugacy identity implies for every , so the corresponding Bowen metrics satisfy
The bijection therefore transports separated sets in either direction without changing their separation, and . Their exponential growth rates, and then their limits as , agree. Part (a) lets us replace by any compatible metric on . Hence
Use the separated-set definition of topological entropy. For a compatible metric and , define the Bowen metric and separated-set count by
For fixed , the metric generates the original topology: it includes the term and all finitely many iterations of a map are continuous. Thus its space is compact and is finite. With natural logarithms, set
The last limit exists, possibly with value infinity, because decreasing can only increase separated-set counts.
Let be another compatible metric. The identity is a continuous function on a compact domain, hence uniformly continuous. For every , choose such that implies . The same implication at every iterate gives
By its contrapositive, every -separated set for is -separated for . Consequently for every , and
Taking gives . Interchanging the two compatible metrics gives the reverse inequality. Therefore
Compactness is used for uniform continuity, not merely for pointwise equivalence of the two metrics.
Let have a dense forward orbit , and suppose that is surjective. Every tail is then dense. Indeed, continuity gives
and the left side equals by surjectivity.
Given nonempty open sets , choose with . The dense tail supplies with . Taking gives . This proves the required positive-time intersection property.
The result can fail without surjectivity. Take the compact metric space
with the metric induced from the real line. All nonzero points are isolated, so continuity there is automatic; at zero, proves continuity. The forward orbit of is , whose closure is , so this is point transitivity. But . The singletons and are nonempty open sets, and for every ,
The isolated initial point can be visited only at the start of the dense forward orbit; deleting that initial segment destroys density.
A compact metric space is second countable. To see this concretely, for each positive integer choose a finite cover by balls of radius . Their centres, over all , form a countable dense subset; balls centred there with positive rational radii form a countable basis of a topology. Enumerate its nonempty members as , repeating members if the basis is finite.
For each , put
Each is an open set, because all iterations of a map are continuous. It is dense: if is any nonempty open set, the hypothesis supplies and with , so .
A compact metric space is a complete metric space, hence a Baire space. The Baire category theorem implies that is dense, and in particular nonempty. For any , the forward orbit of meets every , and therefore every nonempty open set. Its orbit closure is . Thus the open-set intersection hypothesis implies point transitivity, and in fact the set of points with a dense forward orbit contains the dense intersection .
The convention intended by this question is existence of a dense forward orbit, also called point transitivity. On a nonempty compact metric space, this means that some satisfies
Equivalently, that forward orbit visits every nonempty open set.
The other common definition of topological transitivity uses intersections of iterated open sets, as in part (b). The distinction matters on spaces with isolated points: parts (b) and (c) ask precisely how the two conventions are related. We use point transitivity for the dense-orbit convention throughout this solution. As usual for this definition, the state space is assumed nonempty; on an empty space the open-set condition is vacuous and there is no point with a forward orbit.
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.
Write for the number of locally admissible words with and . Here local admissibility means for each consecutive pair; length counts symbols, so there are transitions. For , the single-symbol word gives , and for we have .
To append the last symbol , choose the penultimate symbol . Every choice gives a locally admissible word exactly when its length- prefix is locally admissible and . Different prefixes or penultimate symbols give different words, and every admissible word is obtained once. Therefore
This is precisely the rule for matrix multiplication. Mathematical induction consequently gives
Equivalently, expanding the matrix entry sums the products over all intermediate symbols; each product is the indicator function of one allowed transition chain.
The intended meaning of “allowed” here is local admissibility. If instead it means a word that actually occurs in some two-sided sequence in , the assertion needs an additional extension assumption. For example, permits the word and has , but is empty because no symbol can continue after . Having a nonzero entry in every row and every column is sufficient: one can successively choose a predecessor and a successor to extend every locally admissible word indefinitely in both directions. No such assumption is needed for the local counting formula.
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.
Since is an irreducible variety, every nonempty open subset is irreducible and the sheaf of nonzero rational functions on an irreducible variety has value there. All its restriction maps between nonempty opens are identities, and restriction to the empty set is surjective. Thus is a flabby sheaf, and the introductory argument gives .
Apply the long exact sequence in sheaf cohomology to the short exact sequence of sheaves
Its relevant portion is
The connecting homomorphism is therefore surjective, with kernel the image of . The computation in part (a) now gives
Concretely, local rational equations of a divisor on an algebraic curve differ by regular units on overlaps. Their ratios give the gluing data of an invertible sheaf; changing the local equations by units changes those data by a coboundary. This is the transition-function interpretation of the identification with the Picard group. Reversing all transition ratios replaces a class by its inverse; either consistent convention gives the same group isomorphism.
For a divisor on an algebraic curve , define its line bundle associated to a divisor inside the sheaf of rational functions by
Locally choose a rational equation for , as in the construction of the quotient sheaf above. Then
Consequently this is an invertible sheaf. Multiplication gives an isomorphism
as is checked on the displayed local generators. If , multiplication by identifies with . Thus induces a group homomorphism from the divisor class group to the Picard group.
For surjectivity, let be an invertible sheaf. Trivialize its one-dimensional rational fibre over the function field ; equivalently, choose a nonzero rational section and identify with a subsheaf of the rational-function sheaf. A finite trivializing cover gives
On overlaps is a regular unit. The integers therefore agree wherever two descriptions apply and define a finite divisor on an algebraic curve . Its local description gives . A different rational trivialization multiplies all by the same rational function, changing by a principal divisor, so the resulting divisor class is intrinsic.
For injectivity, an isomorphism becomes multiplication by some on the rational fibre. At each closed point its effect on the local free generators gives
Hence . Conversely this equality gives the required isomorphism by multiplication by . We have proved the group isomorphism
Put , the quotient sheaf of abelian groups. At a closed point , the discrete valuation gives an isomorphism
Indeed, a local parameter on a smooth algebraic curve has valuation one, and the valuation kernel is precisely the unit group of the discrete valuation ring. Thus a local section represented by determines its local principal divisor, and changing by a regular function which is a unit does not change those coefficients.
These local valuations identify with . To see that they give finite support, represent a section locally by finitely many rational functions on an algebraic variety, using Noetherian Zariski topology to take a finite cover. Each representative has only finitely many zeros and poles, so their combined support is finite. Conversely, for , choose at each support point a local parameter and shrink its neighbourhood to exclude every other zero or pole of and every other support point. The local rational equation represents the desired valuations there; on the complement of the support use . On overlaps these equations differ by units, so their classes glue in the quotient sheaf. Finally, a section with every valuation zero has zero germ everywhere and is the identity section. Hence the identification is both surjective and injective.
The map on global sections sends to . Therefore its cokernel is
Let be a sphere with disjoint open disks removed, and form its double by gluing two copies along the boundary. Then , so is an oriented closed surface of genus . The involution swapping the two halves fixes precisely the seam circles.
Use disjoint collars with coordinates , where . Choose a smooth even bump function supported inside the collar, with , and choose . Define an orientation-preserving diffeomorphism on each collar by and as the identity outside the collars. Scaling from zero gives an isotopy from the identity to , so is homotopic to .
A fixed point of in a collar would satisfy , hence . Its other coordinate would then require modulo one, impossible for the chosen . Outside the collars, exchanges the interiors of the halves and has no fixed points. Therefore has fixed circles but is homotopic to the fixed-point-free map . This is the fixed-point-free perturbation of a doubled-surface reflection; the construction includes genus zero, where the double is a sphere.
Take the double cover of branched at points, with deck involution . One explicit construction cuts the sphere along disjoint arcs pairing the branch points and cross-glues two copies along the cuts. Its Euler characteristic is , so it is an oriented closed surface of genus . Locally at a branch point the projection is and the involution is ; thus the involution is nonidentity and orientation-preserving, also when .
The invariant rational cohomology of a finite surface action identifies with the cohomology of its quotient. For this action, triangulate the quotient with the branch points as vertices and lift the triangulation. Quotient cochains identify with invariant cochains, and averaging over the two deck transformations makes taking invariants exact over . Hence the invariant part of is . Since , its eigenvalues are and it is therefore on the -dimensional . Its actions on and are both the identity. Thus
Homotopy invariance and the result just proved show that every map homotopic to this involution has fixed points, for every genus.

Pinned article: Introduction to the OurBigBook Project

Welcome to the OurBigBook Project! Our goal is to create the perfect publishing platform for STEM subjects, and get university-level students to write the best free STEM tutorials ever.
Everyone is welcome to create an account and play with the site: ourbigbook.com/go/register. We belive that students themselves can write amazing tutorials, but teachers are welcome too. You can write about anything you want, it doesn't have to be STEM or even educational. Silly test content is very welcome and you won't be penalized in any way. Just keep it legal!
We have two killer features:
  1. topics: topics group articles by different users with the same title, e.g. here is the topic for the "Fundamental Theorem of Calculus" ourbigbook.com/go/topic/fundamental-theorem-of-calculus
    Articles of different users are sorted by upvote within each article page. This feature is a bit like:
    • a Wikipedia where each user can have their own version of each article
    • a Q&A website like Stack Overflow, where multiple people can give their views on a given topic, and the best ones are sorted by upvote. Except you don't need to wait for someone to ask first, and any topic goes, no matter how narrow or broad
    This feature makes it possible for readers to find better explanations of any topic created by other writers. And it allows writers to create an explanation in a place that readers might actually find it.
    Figure 1.
    Screenshot of the "Derivative" topic page
    . View it live at: ourbigbook.com/go/topic/derivative
  2. local editing: you can store all your personal knowledge base content locally in a plaintext markup format that can be edited locally and published either:
    This way you can be sure that even if OurBigBook.com were to go down one day (which we have no plans to do as it is quite cheap to host!), your content will still be perfectly readable as a static site.
    Figure 5. . You can also edit articles on the Web editor without installing anything locally.
    Video 3.
    Edit locally and publish demo
    . Source. This shows editing OurBigBook Markup and publishing it using the Visual Studio Code extension.
  3. https://raw.githubusercontent.com/ourbigbook/ourbigbook-media/master/feature/x/hilbert-space-arrow.png
  4. Infinitely deep tables of contents:
    Figure 6.
    Dynamic article tree with infinitely deep table of contents
    .
    Descendant pages can also show up as toplevel e.g.: ourbigbook.com/cirosantilli/chordate-subclade
All our software is open source and hosted at: github.com/ourbigbook/ourbigbook
Further documentation can be found at: docs.ourbigbook.com
Feel free to reach our to us for any help or suggestions: docs.ourbigbook.com/#contact