Let and . This is continuous. It is onto: given , choose an integer shift bringing into , with the corresponding possible sign change in ; the resulting representative lies in .
Two representatives in are in the same orbit only if their first coordinates differ by an integer. An interior point can therefore be equivalent only to itself. Distinct boundary representatives have first coordinates zero and one, and the iterate identifies exactly with . Thus the fibres of are precisely the equivalence classes defining the Möbius band .
The rectangle is compact, and the target is Hausdorff by part (i). Applying part (a)(v) to therefore yields
The compactness argument supplies continuity of the inverse without requiring a discontinuous choice of one representative per orbit.
For nonnegative integers , repeated integration by parts gives the beta integral . Multiplying the stated density by and using this formula yields
Cancellation gives
For , the target is reached at time zero, so . For , the preceding almost sure convergence gives with probability one. A sample path with unit upward and downward steps must visit every intermediate integer when it crosses from a negative value to a positive value. It must therefore visit zero at a finite time. Thus
The unit-step property matters: positive long-run displacement alone would not force a walk with larger upward jumps to land exactly on zero.
Work on the single event of probability one where . On every sample path in that event, and the unit-step property ensures that every positive integer is reached, so . Starting from zero requires at least steps to reach , hence and .
The convergent numerical sequence on this fixed sample path also converges along its possibly random subsequence . Since ,
Taking the reciprocal is valid because . We obtain
This is a first-passage law of large numbers for an upward skip-free random walk. No independence between the hitting times and the path is needed: almost sure convergence already supplies convergence along every diverging subsequence on the same event.
Since almost surely, only finitely many early values can attain the global minimum; it is a finite integer. Also . For every nonnegative integer , the unit-step property and translation invariance of the increments give
Subtracting consecutive tails yields the probability mass function
Thus has the geometric distribution counting failures before the first success, with success parameter
This support convention is essential: the minimum of an upward-biased random walk can equal its starting position, so has positive probability.
Source: Oxford's released examination PDF, pages 164–167, dated 21 June 2021. Questions 1, 2 and 3 occupy bundle pages 165, 166 and 167 respectively, or pages 2, 3 and 4 of the individual paper. All three questions and every part are solved below, including all six revisions requested in 3(d). In 3(c), is understood to be an integer: the printed transition rule does not define a transition matrix for noninteger .
There is a stronger conclusion than the requested limit. For , the event forces , because is an integer. In particular, at least arrivals have occurred by time , so the -th Poisson arrival time satisfies . This contradicts for . Thus the two events are disjoint:
Let have the specified probability density function . Splitting the integral into the positive and negative half-lines, and using the Gamma integral for a nonnegative integer and , gives
At or , one term becomes the divergent integral of ; beyond these endpoints it grows exponentially. Consequently, the full extended-valued moment-generating function is
In particular , checking normalization of a probability distribution. All absolute moments exist. Direct integration yields
The symmetric distribution makes every odd moment zero, so
Now let have probability density function . Its moment-generating function would be
For every , one summand has exponential growth, which dominates the polynomial decay. Hence
There is no finite moment-generating function on any neighborhood of zero, but some moments still exist. Specifically,
Thus
For even , the moment is , so it is not a finite moment. For odd , both the positive and negative contributions have infinite integral, so the expected value is undefined. Cancellation in a Cauchy principal value does not define an expected value. In particular, when there are no finite positive-order moments.
A return path with upward steps and downward steps satisfies . Since are coprime, this is equivalent to and for an integer . Its length is therefore .
Conversely, for each such , any ordering of upward and downward steps is an allowed positive-probability return path. The possible strictly positive return times are exactly the positive multiples of . By the definition of the period of a state in a Markov chain as their greatest common divisor,
In particular, none of the states is aperiodic.
Fix any two integers . By Bézout's identity, there are integers with . Replacing by leaves this identity unchanged. Choose large enough that both entries are nonnegative. A path with upward steps and downward steps then takes to , with strictly positive probability . There are no boundary restrictions on this state space.
This applies in both directions, so every pair of states communicates. Hence
First identify the recurrence type, rather than infer an occupation limit from a one-time probability. At time , return to zero requires exactly upward steps. The binomial distribution gives
where the last step is Stirling's approximation. At all other positive times the return probability is zero. Hence . The recurrence criterion by return probabilities proves the recurrent property; by the irreducible Markov chain property established in (i), every state is recurrent. The equivalence of positive recurrence and existence of a stationary distribution for an irreducible Markov chain on a countable state space, together with (iii), makes this chain null recurrent.
For completeness, the zero occupation proportion follows directly by treating returns as a renewal process. Let be successive strictly positive return-cycle lengths to zero. The Strong Markov property makes them independent and identically distributed, the recurrent property makes them finite almost surely, and the null recurrent property gives . For each positive integer , the strong law of large numbers applied to gives
Take a common event of probability one for these countably many . By the monotone convergence theorem, the right side increases to infinity. Thus the number of completed return cycles by time , divided by , tends to zero. Counting the initial visit changes this ratio by at most . Consequently,
The walk visits zero infinitely often, but the asymptotic fraction of time spent there is zero.
Take an integer . On , the modified transition matrix agrees with . Above , it stays put with probability and jumps to each of with probability . Below , it stays put with probability and jumps to each of with probability . All unspecified entries are zero. These rows sum to one. The integer qualification is necessary: if were nonintegral, would fit none of the printed row conditions.
Define
An interior jump cannot go below or above , and every exterior reset lands in . Thus is closed.
To prove that it is one communicating class, start anywhere in . From or , a reset can reach with positive probability. From any state of , repeated steps reach some state of , after staying in up to the last step. A reset from this state can reach every point of the consecutive block
Every integer has the form for some and an integer . Repeated steps from reach , with all departure states in until a possible last step into . This gives access to all of . Finally, each can be reached from . Every path described has strictly positive probability. Therefore every state in reaches every other state in .
Each state outside can only stay put or reset into , and no transition from returns to it. Different states outside cannot reach one another. Hence the complete list of communicating classes is
The finite class is the unique closed communicating class. The exterior singleton classes are transient communicating classes, since their self-transition probabilities are strictly less than one. Notice that this reachability proof does not require to be coprime.
For a ring , its ring characteristic is the least positive integer with , or zero if no positive such integer exists. Equivalently it is the least positive integer satisfying for every , because . This additive formulation also defines the characteristic of a rng when an identity is not assumed.
Let be an integral domain. Since , its characteristic is not one. If its positive characteristic were a composite integer with , minimality would give and , but
This contradicts the absence of zero divisors. Therefore
This is the characteristic of an integral domain theorem. If an integral domain is defined without requiring an identity, the same conclusion follows from the additive definition: for a hypothetical composite characteristic , choose with , which exists by minimality of . Then for every , forcing for every and contradicting minimality again.
Since , products of integer linear combinations of remain of the same form. Thus the Eisenstein integers form a subring of , and hence an integral domain. Their Eisenstein norm is
It is a positive integer on nonzero elements and is multiplicative, because the complex modulus is multiplicative.
For with , write with real . Choose integers with , and let . With and ,
Consequently belongs to and satisfies when . This proves is a Euclidean domain with Euclidean function , the Euclidean norm on the Eisenstein integers.
Figure 1.
Rounding the coordinates in the Eisenstein integer lattice gives a Euclidean remainder
. After subtracting the chosen lattice point, the error lies in the shaded parallelogram. Its squared modulus is at most , strictly smaller than one. The parallelogram is a rounding cell, not the hexagonal nearest-point cell. Details.
For the representation of the prime , first note that . Now suppose and . The factorization
shows that the Eisenstein integer divides a product. It divides neither factor: an element lies in exactly when both integer coefficients are divisible by , and the second coefficients here are and . Hence is not a prime element of .
To justify the necessary factorization step, in any principal ideal domain an irreducible element is prime. If , write . Since , irreducibility makes a unit or an associate of . The latter would give , so is a unit and for some . If , multiplication of this identity by gives . This proves irreducible elements of a principal ideal domain are prime without assuming unique factorization.
By part (a), is a principal ideal domain. The integer has norm , so it is a nonzero nonunit. Since it is not prime, the result just proved implies that it is reducible: with both nonunits. A nonzero element of is a unit exactly when its norm is one, since gives inverse and multiplicativity proves the converse. Thus
The only possible positive integer factors exceeding one are . Writing gives
This is the prime representation by the Eisenstein norm argument.
Define the group homomorphism
By part (b)(i), its kernel of a group homomorphism is
It is surjective. Indeed, choose with by Bézout's identity. For any prescribed classes and , the integer
satisfies and . The first isomorphism theorem for groups therefore gives
This proves the required isomorphism and is the Chinese remainder theorem for coprime integers. It also shows that generates the direct sum of modules when these additive groups are viewed as -modules.
Let be a square-free integer. If , then is the trivial cyclic group. Otherwise, finiteness means that a direct sum of modules decomposition into cyclic groups has only finitely many nontrivial factors, each of finite group order. Omit trivial factors and write
The integers are coprime integers whenever . If a prime number divided both, then , contradicting the square-free integer hypothesis.
Moreover, and are coprime integers: any common prime divisor would divide one of the earlier factors as well as . Thus part (b)(ii) can be applied repeatedly to combine factors, giving
In particular is a cyclic group. Under the displayed identifications, the element whose coordinate in every factor is the class of is a generator of a group.
Using the assumed square-free polynomial property, factor
into distinct monic polynomials that are irreducible polynomials, with . Part (b)(iii) identifies with , where .
By the first isomorphism theorem for rings, the image from part (c)(i) is , where is the kernel of a ring homomorphism. By part (a)(ii), for ideals . A field has only the zero ideal and the whole field as ideals, so each is either or the zero ring. Consequently, for a subset ,
This is the quotient of a finite product of fields principle. The subset is nonempty because , whereas the zero ring has only one unit. By part (a)(i),
Each factor is a positive integer. Since is a prime number, exactly one factor is and all remaining factors are one. Thus
so is a Mersenne prime. If with , then would be a proper divisor of ; thus is itself a prime number, although only the displayed form is needed.
The assumed square-free polynomial property can also be checked directly: in characteristic of a ring two, the formal derivative of is because is odd. These two polynomials have greatest common divisor one, since does not divide , so no repeated irreducible polynomial factor occurs.
Under the temporary assumption that is a basis of a module for , part (a)(v) applied to the countably generated submodule gives a countable set such that . By part (a)(iv),
Use part (a)(iii) to project onto the second direct summand. This gives a module homomorphism with
It remains to check the required size of this kernel. Enumerate as , with the finite case treated the same way. Every element of is a finite sum of these elements with integer coefficients. For each , the set is the image of the countable set , so it is countable. Taking their countable union proves
This is the countability of countably generated abelian groups argument; it uses the countability of the scalar ring .
For every , truncate before coordinate :
This lies in . For , . For , , which is divisible by . In particular the integer sequence
belongs to and satisfies .
Apply the module homomorphism . Since ,
Fixing any coordinate , the integer is therefore divisible by for every . The only such integer is zero: if , choose with , which rules out for any nonzero integer . Thus every coordinate of vanishes, contradicting part (b)(iii).
It follows that
The decisive property is vanishing of infinitely divisible integer sequences, namely .