The examination used separately emailed files. For this question a public Guerry data archive and its CSV mirror permit a documented reconstruction: retain the 85 records with a recorded region and select the specified columns. All six printed records match exactly, and each of the five regions has 17 departments. The numerical results below refer to that reconstruction; the remaining rows cannot be checked against the unavailable emailed file.
Treat department identifiers as labels and region as a categorical variable. The following summaries show the scale and spread of the quantitative variables:
VariableMeanStandard deviationMedianInterquartile rangeRange
CrimePers19960.947299.241878514790–262215883–37014
CrimeProp7881.343048.6276245990–91901368–20235
Literacy39.1417.433825–5212–74
Donations6723.324863.2449643446–92421246–27830
Wealth rank43.5825.114422–651–86
A larger population-per-crime value means a lower crime rate, and a smaller wealth rank means greater recorded wealth. Donations are markedly right-skewed, as the large gap between mean and median and the upper tail indicate; rank is an ordinal measure rather than a monetary difference. For the ratio analysed next, the median is , the interquartile interval is , and the range is .
Regional median ratios are in C, in E, in N, in S, and in W. The regional box plots and wealth-versus-log-ratio scatter plot in the figure expose this geographical contrast and an inverse association with wealth rank. North has the highest typical property-to-person crime ratio and South the lowest in the reconstructed data. These summaries are descriptive departmental comparisons, not causal or individual-level conclusions.
As in the intended independent-mark construction, take the entire sequence independent of the Poisson process, not merely independent of one fixed count. Then is a Compound Poisson process. For deterministic , its increment is independent of . To justify this carefully, first condition on . The past of uses only the counting history up to and marks among . The future count has independent rate- Poisson process increments, and future marks are fresh with the common law. Their joint conditional law is the same for every and every past history, so the increment is independent even of this larger marked history, hence of . Marks equal to zero do not cause a problem: may then reveal less than the full counting history.
By part (b), with Poisson parameter ,
The proposed process is adapted to , nonnegative, and
In particular, no finite expectation of a mark is required. Also , and
is independent of and has mean one. Therefore the exponential Laplace martingale of a compound Poisson process satisfies
This proves every condition for a continuous-time martingale in the requested filtration. When , and the same conclusion reduces to the constant martingale .
Conditional on , the summands are independent with the common Laplace transform of a nonnegative random variable . The empty sum for is zero. Therefore the compound Poisson distribution has
and applying the probability generating function from part (a) gives
If , differentiating at zero from the right gives and . Hence
The differentiation is justified by and the dominated convergence theorem. No finite moment was assumed in the question, so the formula must also be interpreted when . For any nonnegative random variable , the monotone convergence theorem gives
Apply this to and , and use as , with ; it yields the same formula with value when . If , nonnegativity makes all marks zero almost surely and the result is immediate.
For the second method, condition on the count rather than differentiating a transform. For finite , the tower property of conditional expectation gives , and gives . More generally, Tonelli's theorem and independence give
For , already the term is infinite since . Thus the two methods agree, including in the extended-valued case.
From the masses of the Poisson distribution, its probability generating function is
At , the term is interpreted as one, so this also gives .
One constructive definition of a rate- Poisson process uses independent and identically distributed exponential random variables of rate . Set , and
The strong law of large numbers gives almost surely, so the maximum is finite at every finite . The process starts at zero, has right-continuous nondecreasing integer paths, and jumps by one at the arrival times.
For , exactly arrivals by means . Integrating the first exponential gaps and the survival probability of the next gap gives
The last factor is the volume of the -dimensional simplex, obtained for example by iterated integration. For , directly . Thus
At a fixed time , conditional on the counting history, the residual time until the next arrival has rate- exponential distribution, independently of that history, by the memoryless property. After that arrival all subsequent gaps are fresh independent exponentials. Thus the process of future counts has the same law as and is independent of the past. This proves stationary independent increments, the equivalent usual defining properties of the Poisson process, and gives
Use the positive-integer convention for the geometric distribution:
Conditional on , independence gives . Taking expectations gives
This is the convention required below because a chain starting at makes at least one visit to . If instead counts failures on , its mean is , and the corresponding answer for that different random sum is .
For the chain of part (b), let count visits to , including the initial visit, before absorption. After a departure to , gambler's ruin on gives probability of reaching zero before returning to . After a departure to , the analogous probability of reaching before returning is . The departure is equally likely in either direction, so the probability of absorption before a return is
At every return to , the Strong Markov property resets these alternatives. Hence the geometric return count before absorption gives on positive integers. One may construct the chain from its embedded jump chain and a separate sequence of fresh independent exponential clocks. Then its successive holding times at are independent and identically distributed rate- exponential random variables, independently of , and
Using the first calculation gives the occupation time at an interior state of a variable-rate symmetric walk:
For , and the only visit is the initial one; the degenerate positive-integer geometric distribution at one handles this case. Other states' rates affect the time of each excursion, but not its probability of return, which explains why only appears in this expectation.
For , the total rate out of is . The holding time of the continuous-time Markov chain and its next state satisfy
The holding time is independent of the direction of this jump: the conditional probability of destination is the rate divided by the total rate , independently of the elapsed holding duration. This is the exponential-clock construction of a continuous-time Markov chain with the given infinitesimal generator matrix.
At or , all rates out are zero. These are absorbing states; the path remains at its initial endpoint and almost surely. There is no next visited state, so is not a finite-time jump value at either endpoint. If one separately uses for the limiting state, that limit is the same endpoint.
The embedded jump chain in the interior is a simple symmetric random walk on , stopped at the endpoints. From any interior state it has probability at least of hitting a boundary in the next jumps, by following successive leftward choices. Thus its number of jumps before absorption is finite almost surely. Each of this finite number of holding times is finite almost surely, so absorption also occurs in finite continuous time. The finite set of positive interior rates causes no explosion; in particular their maximum bounds the total jump rate. When , the chain starts at an already absorbing endpoint.
The rates alter the clock but not the sequence of visited states. The gambler's ruin calculation from part (a), translated to an initial state between endpoints , therefore gives
This includes probability one at zero and probability zero at .
Let for the simple symmetric random walk. From any interior point, successive increments force exit through . The conditional probability of this block is , so a blockwise geometric tail bound from a uniform escape probability gives almost surely.
Apply the bounded optional stopping theorem to . Since is a martingale, . The stopped positions lie in , so the bounded convergence theorem gives . If , nearest-neighbor jumps ensure on that event and otherwise. Thus
Next apply the bounded optional stopping theorem to the square-minus-time martingale of a simple symmetric random walk:
Again the right side converges by the bounded convergence theorem, while the left side increases to by the monotone convergence theorem. Therefore
This argument justifies passage to the unbounded stopping time rather than applying optional stopping without an integrability check.
The printed hitting-time formula is false for the stated transition probabilities. For example, take and , put , and write . A first step gives
so . The printed expression gives , not . This discrepancy is present in the original PDF, not just in its converted text. The quantifier mentioning every positive integer must also be restricted to positive starting states ; states larger than are not in .
Here is the exact solution for the chain as specified. Until , only is visited. From any such state, a sequence of downward steps reaches zero within steps with probability at least ; the forced step at only increases that probability. The Markov property therefore gives
Thus is finite almost surely and has finite expectation, without needing the supplied transience assumption. Set . The first-step analysis gives
Put , , and . The equations become
Backward iteration, or substitution into this recursion, gives
Summing from to gives the corrected hitting time of a downward-biased walk reflected at an upper barrier:
and in particular
These values also supply the appropriate test function for part (b): , , and at every state before absorption. The finite-state stopped argument is applied on , with zero made absorbing.
For , the printed hint cannot produce constant drift by choosing its single constant . With for and , the expected downward drift is at ordinary interior states, at , and at . Making the top drift requires , but then the drift at is , not . For there is no ordinary interior state; a different constant drift can be arranged, but still gives rather than the printed formula. This identifies precisely the missing correction at the neighboring state for the intended drift ; the geometric term in the correct test function repairs it throughout the interval.
The global drift hypothesis as printed is impossible on a finite state space. Indeed, let minimize . Every possible value of is at least , so
contradicting a decrease by . Equivalently, its formal iteration would give , whereas is bounded on the finite state space. This is the constant nonzero drift is impossible on a finite Markov chain obstruction. Thus there is no genuine chain satisfying all the literal premises.
The meaningful intended version imposes the drift only on , and stops at . In the natural filtration , the Markov property then gives, on ,
The correct stopped martingale is
It is adapted and integrable, since is bounded and . Its increment equals
whose conditional expectation is zero. Taking expectations yields
Since almost surely and , the bounded convergence theorem gives . The monotone convergence theorem gives , without presupposing its finiteness. Consequently the constant-drift hitting-time identity is
For , both sides are zero. Under the repaired hypothesis the unstopped need not be a martingale after hitting ; it is the displayed stopped martingale that proves the result.
A discrete-time martingale relative to a filtration is an adapted process with and
Iterating conditional expectation also gives for . It is bounded in when each is square integrable and
This is a uniform bound on the second moments, not a pathwise bound on all sample values.
The optional stopping theorem for bounded stopping times says that, if for a deterministic finite , then
Here is the stopping-time sigma-algebra. The second assertion follows by taking and then expectations. An bound is not needed: integrability at the finitely many deterministic times suffices.
For a proof, both stopped values are integrable since . Expand
If , then by the definition of the stopping-time sigma-algebra, and because is a stopping time. Thus the indicator of is -measurable. Multiplying the sum by , taking expectations, and conditioning each summand on gives zero, by the martingale increment property. Therefore for every . Since is -measurable, this is exactly the claimed conditional expectation identity.
Write . If , then for either possible sign,
as long as . Thus the process stays above , is strictly increasing, and induction gives . If , the symmetric argument makes the process strictly decreasing to . This proves the first assertion pathwise, with the strict sufficient threshold .
For an arbitrary starting point, a proof is needed that the process actually reaches such a region. Fix and choose an integer so
At a block starting at time , if , the next signs all equal to give . If , all signs instead give . Conditional on the current natural filtration, the selected block has probability , by independence of future signs. If , iterated conditional expectation gives
This is a geometric tail bound from a uniform escape probability, so almost surely. Once outside, the sign is preserved and, for every future noise sequence,
Consequently the explosive affine recursion with symmetric bounded noise has
The block argument closes the gap between escape from a large initial value and escape from an arbitrary one; no assertion about the absence of atoms in an infinite random series is necessary.
Every is integrable: induction gives . Since the innovation has expectation zero, the recursion implies
Starting from , induction therefore gives
This holds for every , including . The independence of the signs also identifies this as an autoregressive process of order one, although zero mean of each sign already suffices for the displayed expectation recursion.
This is the simple symmetric random walk on the integers, starting at zero. It is recurrent: it returns to zero infinitely often almost surely, and in fact visits every integer infinitely often. To see the two-sided unboundedness explicitly, gambler's ruin gives, for positive integers ,
Letting shows that is hit with probability one; the analogous argument hits every negative integer. From any state the same argument gives return to zero with probability one. Repeated use of the Strong Markov property then gives infinitely many returns and visits. Therefore
In particular has no limit almost surely, and does not tend to infinity because of the returns to zero. In contrast, the strong law of large numbers gives almost surely, while the central limit theorem gives . These distinguish oscillation of the path from scaling limits of its probability distribution.
The exponential distribution has no atoms, so all sample values are distinct almost surely, and is the th order statistic. Set and . Part (b) gives .
To justify induction and the required independence, let be the label attaining the minimum. Conditional on its time and label, the remaining clocks are fresh independent rate- exponential random variables, by the memoryless property. This conditional claim can be checked directly: for a specified label , first ringing time , and residual lifetimes for , the joint probability density is
Thus the first minimum, its uniform winning label and the surviving residual clocks are independent. Repeat this argument after each minimum. At the th step there are clocks, so the independent exponential order-statistic spacings satisfy
Since has rate whenever , summing the gaps proves
In particular the maximum is . By variance additivity for independent random variables and the Laplace transform of an exponential distribution, its requested quantities are
The product follows from independence of the gaps, not merely from their marginal probability distributions.
For , independence factors the survival function of the minimum:
The minimum is nonnegative, and this is exactly the survival function of an exponential distribution. Hence
The parameter here is the rate, rather than the mean. The calculation is the simplest example of competing exponential clocks.
For the central limit theorem, let be independent and identically distributed random variables with expectation and finite positive variance . Then
Thus the centered, normalized sum has convergence in distribution to the standard normal distribution. The positive-variance assumption is needed for this normalization; if , each summand equals almost surely and the centered sum is identically zero.
Here is a characteristic function proof using only the finite second moment. Put , so and . The elementary integral remainder identity gives for real . Consequently
By the dominated convergence theorem, the characteristic function satisfies as . For a fixed real , independence therefore gives
The allowed complex-number limit makes this tend to , the characteristic function of the standard normal distribution. It is continuous at zero, so the Lévy continuity theorem proves the asserted convergence in distribution. No third moment or boundedness of the summands was used.
Take complex-valued functions. Pointwise multiplication is associative and commutative, with identity the constant function , whose norm is one. The product rule gives
To prove completeness, let be a Cauchy sequence in this norm. The functions and their derivatives converge uniformly to continuous functions . Passing to the limit in gives . The fundamental theorem of calculus yields , including the one-sided endpoint derivatives. Thus and in the stated norm. Consequently is a unital commutative Banach algebra.
Let . If , then belongs to . If , the function vanishes somewhere and cannot have a pointwise inverse. Thus . Every character of an algebra satisfies for some , by part (d), and therefore for every polynomial .
Polynomials are dense in this stronger norm, not just the supremum norm. By the Weierstrass approximation theorem, approximate the real and imaginary parts of uniformly by polynomials, combining them into . Put . Then is a polynomial and
Continuity of the algebra character now gives . Conversely each point evaluation is a continuous algebra character. Hence the character space of C1 on a compact interval consists exactly of the evaluation functionals, and part (c) gives
Distinct points give distinct maximal ideals, since the coordinate function separates them.
For every character of an algebra , the element cannot be invertible, so . Conversely, if , the principal ideal is proper: otherwise for some , which in this commutative algebra gives an inverse. Part (b) puts that ideal inside a maximal ideal , and the corresponding algebra character from part (c) has . Therefore
Here is the Gelfand transform. The spectrum equals character values in a commutative Banach algebra result does not require the Gelfand transform to be injective: the algebra need not be semisimple.
A character of an algebra is a nonzero multiplicative complex linear functional . Nonzeroness and multiplicativity force , so it is onto . Its kernel is an ideal, and the quotient is the field , making the kernel maximal.
Continuity is automatic. The element cannot be invertible, since applying to an inverse equation would give . On the other hand is invertible whenever , by the Neumann series. Hence , the automatic continuity of characters bound.
Conversely let be a maximal ideal. Its closure is an ideal, because multiplication is continuous. That closure is proper: otherwise there would be with , making invertible by the Neumann series and forcing . Maximality gives . The quotient is consequently a Banach algebra. It is a division algebra: for any , the larger ideal equals , so the class of has an inverse. By the Gelfand-Mazur theorem, , and its quotient map gives a continuous character of an algebra with kernel .
If two algebra characters have the same kernel, then lies in the second kernel, giving for every . Thus
is a bijection. This proves that maximal ideals of a commutative complex unital Banach algebra are character kernels.
The assertion requires a proper ideal. If , no proper ideal can contain it, so the literal statement without that restriction is false.
Let be proper, and consider the partially ordered collection of proper ideals containing . It is nonempty. The union of a chain is an ideal, because any two of its elements belong together to some member of the chain. It is still proper: if it contained , some member of the chain would contain and equal . Thus every chain has an upper bound in the collection. The Zorn lemma gives a maximal member, and any proper ideal containing it still belongs to the collection. Hence this is a maximal ideal of .
Therefore every proper ideal is contained in a maximal proper ideal. This algebraic argument only needs a nonzero unital commutative ring; the Banach algebra assumptions become important for closedness of maximal ideals in part (c).

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