Use the displayed formula as a right group action: applying and then gives . It is transitive since sends the identity to . An element fixing every must have by evaluating at the identity, and then for every . Its kernel is therefore , which is trivial by the center of a group hypothesis.
The identity stabilizer subgroup is . For every subgroup containing , set
Conjugation by diagonal elements makes normal in . Multiplying by shows , so
Conversely each normal subgroup gives such an . Thus the subgroups strictly between and correspond exactly to proper nontrivial normal subgroups of .
For a transitive action, blocks containing a chosen point correspond to subgroups containing its stabilizer subgroup: a block is the orbit of that point under its setwise stabilizer subgroup, and conversely the orbit under an intermediate subgroup gives a block. Therefore the diagonal action on a centerless group is primitive exactly when is simple. A nontrivial centerless simple group cannot be abelian, because an abelian group's center of a group is the whole group. Hence
This uses the usual nontrivial degree convention. If one allows a one-point action to count as primitive, is the additional degenerate exception.
For the requested order example use . Its simplicity follows from its conjugacy-class sizes : a normal subgroup is a union of classes containing the identity, and no proper nontrivial such sum divides 60. Set , a prime. The primitive diagonal action has
We prove the primitive three-cycle criterion through supports. First, suppose a subgroup contains , the alternating group on a set of at least three letters, and a three-cycle with support meeting .
If adds one letter, it has two letters in . The group is transitive on unordered pairs of : for three letters its cyclic action permutes the three pairs, and for at least four letters one can adjust the parity of a permutation sending one pair to another while preserving its target pair. Conjugating the new cycle, and using inverses, supplies every three-cycle on two old letters and the new letter. Together with , these generate .
If adds two letters, write its cycle as with . Choose and conjugate within to obtain . Then
The preceding case first adds ; applying it again to adds . This proves connected triple supports generate an alternating group, by successively merging the intersecting triples of a connected support hypergraph. We used that three-cycles generate alternating groups: pairs of transpositions with a common letter are three-cycles, while a pair of disjoint transpositions is a product of two three-cycles.
Now take all conjugates in of the given three-cycle. Their support hypergraph is -invariant, and its connected components form a block system. Transitivity makes their union the whole set. There is an edge, so a component has more than one vertex. A primitive group action forces a single component. The preceding merging argument proves
For the first family of counterexamples, let
Its elements are Möbius transformations , modulo nonzero scalar matrices. Any ordered triple of distinct projective points is the image of under exactly one such transformation: representatives of the first two target lines form a basis, and scaling the two columns sends their sum to the third target line. Thus the action is sharply three-transitive, hence two-transitive and primitive. Its degree is and order . It is divisible by , but
so it cannot contain .
For the second example take
The same projective-line construction over is sharply three-transitive. Its order is divisible by 7 and is less than , so it does not contain . For a concrete field one can use .
Use rightmost-first composition of permutations, and let
For , direct evaluation gives . Conjugating this transposition by powers of yields the transpositions between consecutive letters around the cycle, including .
Put . For ,
Thus the adjacent transpositions generate every transposition, and permutation cycle decomposition shows that transpositions generate the symmetric group. Therefore .
For the final lower bound, associate a graph to a family of transpositions: its vertices are the letters and its edges are the swapped pairs. Every generator preserves every connected component, so generation of requires that graph to be connected. A connected graph on vertices needs at least edges: adding an edge can reduce the number of components by at most one, starting from isolated vertices. The adjacent transpositions supply exactly edges. Equivalently, transpositions on a connected graph generate the symmetric group. Hence
For a subset of a finite p-group, its images span the Frattini quotient precisely when . By the generating property proved in part (ii), this is equivalent to .
If is a minimal generating set of a group, its images must be an irredundant spanning set in the vector space . A linear dependence would express one image using the others; those other images would still span, so the other elements would still generate , a contradiction. Thus the images form a basis. Conversely lifts of a basis generate , and deleting a lift destroys spanning and hence generation.
This proves the Burnside basis theorem, including equality of sizes for every inclusion-minimal generating set of a group:
Inclusion-minimal generating sets of a group need not have equal sizes in arbitrary finite groups; the elementary-abelian Frattini quotient is the essential p-group feature.
For a finite group, define the Frattini subgroup by
the intersection is when there are no maximal subgroups, which for a finite group happens only for . A second definition is the set of non-generators: an element such that always implies .
If and , put in a maximal subgroup . Then , so . Conversely, if , some maximal subgroup omits it; maximality gives , although . This proves equivalence.
Every group automorphism permutes maximal subgroups, so is a characteristic subgroup, in particular a normal subgroup. Also
a proper would lie in a maximal subgroup containing both factors.
Set and take a Sylow subgroup of . For , normality of makes a Sylow subgroup of . Conjugating inside therefore gives the Frattini argument factorization . The preceding generating property forces . Thus every Sylow subgroup of is normal, and part (i) shows that is a nilpotent group.
Now suppose is a finite p-group. The normalizer condition makes every maximal subgroup normal: and maximality force . The quotient has no proper nontrivial subgroup, hence is cyclic of prime order; its p-power order makes that prime . Consequently every such contains
where the two factors are the commutator subgroup and the subgroup generated by pth powers. Thus .
The quotient is an elementary abelian group, hence a vector space over . If , extend the nonzero vector to a basis and choose a linear functional nonzero on it. Its kernel pulls back to a subgroup of index , a maximal subgroup omitting . Therefore , proving
The two factors in the last formula are multiplied; the superscripted expression in the TeX aid is not the formula printed in the PDF.
A nilpotent group has a finite central series
Equivalently the upper central series, defined by , reaches .
We first prove the normalizer condition for nilpotent groups. If , choose the least with . Then , and an element satisfies . Thus normalizes , giving .
Let be a Sylow subgroup of a finite nilpotent , and write . If , the normalizer condition gives some . The subgroups and are both Sylow subgroups of , so Sylow theorem supplies with . But then , forcing , a contradiction. Therefore every Sylow subgroup is a normal subgroup of .
For normal Sylow subgroups at different primes, . They commute, have coprime orders, and their product has order . Multiplication consequently gives an isomorphism from their external direct product of groups onto .
Conversely, a nontrivial finite p-group has nontrivial center of a group: its class equation has every noncentral conjugacy-class size divisible by , so is a positive multiple of . Induction on order, applied to , gives a central series for . Finite direct products of these central series give a central series for the product, padding shorter series by the full factor. Thus the finite nilpotent group decomposition is
Let be the symmetric positive square root of the covariance matrix, and write with having the multivariate normal distribution . Bounded gradient makes globally Lipschitz, so has at most linear growth and is square integrable. This also justifies the permitted Gaussian integration by parts formula for each coordinate.
By the chain rule, . Applying Gaussian integration by parts gives
Thus the Gaussian quadratic hedge holds . Substitution into its initial capital formula yields
Only the hedge calculation is being used here; the Gaussian model need not possess a positive pricing weight for this least-squares identity.
The centered term in has zero mean, giving and hence . For the risky assets, symmetry of the covariance matrix gives
Therefore reproduces every asset's initial price.
For another square-integrable satisfying the price moment constraints, set . The bank equation and give , while the risky equations give . Since is an affine combination of and the coordinates of ,
The Pythagorean theorem in an inner-product space now gives
Equality holds exactly when almost surely. If a competing weight has infinite second moment, the inequality is immediate in the extended sense. The minimum itself is
Thus is the orthogonal projection of any feasible square-integrable pricing weight onto the linear span of the traded payoffs.
Put . The initial capital of the one-period quadratic hedge is
Define the minimum-norm one-period pricing weight
It is square integrable, and , so
The weight depends only on the asset prices and their first two moments, not on the claim. It can be negative, so this identity alone does not supply an equivalent martingale measure or a positive state-price density.
Write , and . The riskless gross return must be nonzero for the requested formulas; in the usual positive-bank-account model . If , the bank holding cannot affect the terminal payoff, and the later moment equation for pricing is impossible. We use the intended nondegenerate case .
The claim and asset prices are square integrable. Centering separates the bias from the stochastic error:
For fixed , the unique minimizing bank holding removes the bias. The invertible covariance matrix is positive definite, and completing the square gives
Consequently the unique one-period quadratic hedge is
Its minimum expected squared error is . This is a least-squares hedge, not necessarily exact claim replication.
Let . Boundedness of and integrability of the lognormal distribution variable justify differentiation under the expectation, by dominated convergence:
A differentiable increasing payoff has , and . Thus the delta hedge has
Moreover , so . At maturity the delta is . The admissible trading strategy already constructed therefore uses nonnegative stock holdings throughout replication. After maturity, liquidate the stock position and retain the proceeds in the bank account, so for if holdings are to be defined for all times.
Set . The positive density
has mean one, and the Girsanov theorem makes a Brownian motion under the equivalent measure . Hence
The Black-Scholes equation makes a local martingale. Bounded on the finite horizon makes it a true martingale, so its terminal condition gives the risk-neutral valuation
The geometric Brownian motion solution under is
The Brownian increment is independent of and equals in distribution, where has the standard normal distribution. Therefore
The expectation on the right is only an integral against the standard normal law; the physical drift has disappeared.
Use the Black-Scholes equation with the claim's terminal condition :
For , the Itô formula under the physical measure gives
Choose the delta hedge and its bank-account holding by
Their portfolio value is , and
Thus the portfolio is self-financing and, with initial capital , has terminal wealth .
Localizing to compact stock-price intervals and times below justifies these stochastic integrals from the classical smoothness of . The extension to maturity also follows from boundedness. Under the Risk-neutral measure for the Black-Scholes model, discounted is a bounded local martingale, hence a true square-integrable martingale. Its quadratic variation has finite expectation, so the stock-integral coefficient is square integrable through . Equivalence of measures preserves its almost-sure finiteness, and the physical drift integral is finite by Cauchy-Schwarz. The terminal limit is .
Finally, is bounded away from zero on this finite horizon, and bounded makes bounded below by a deterministic constant. The hedge is therefore an admissible trading strategy. The displayed holdings replicate the payoff admissibly, even if the bounded payoff can be negative.
Use the discounted wealth and the discounted dividend gains
The integral uses : the printed inside an integral indexed by is a differential typo. Since is a positive finite-variation process, the Itô product rule gives
The bank-account terms cancel using .
If is a -martingale, discounted self-financing wealth is a -local martingale. The admissible trading strategy lower bound makes it a supermartingale, exactly as in the previous no-arbitrage proof. A zero-cost portfolio with nonnegative terminal wealth must therefore have terminal wealth zero -almost surely and, by equivalence, physically almost surely. Hence an equivalent martingale measure for discounted dividend gains excludes arbitrage. It is the gains process, not just the ex-dividend price ratio, that must have zero martingale drift.
The holdings and are numbers of shares, so the marked-to-market portfolio value is
The stock prices are ex-dividend prices. Over the trading interval, existing holdings gain from the riskless account and from capital-price changes. In addition, shares of asset receive in cash dividends. If this cash remains in the portfolio and changes of holdings are financed internally, the self-financing portfolio equation is
Rebalancing does not add a separate source of wealth: the cost of purchasing one holding is paid by selling another or by using the cash account. This is why one must specify the gains equation, rather than infer self-financing solely by differentiating the marked-to-market identity. The dividends are reinvested rather than withdrawn as consumption.
On a fixed horizon , an arbitrage is an admissible trading strategy that is self-financing, has , and satisfies almost surely with . Here admissibility means that wealth in units of the strictly positive riskless numéraire has a deterministic lower bound throughout the horizon. An equivalent martingale measure is equivalent to the physical measure on and makes each discounted risky price a martingale.
For a predictable, stochastically integrable risky holding vector , the discounted self-financing identity is
Indeed, since the riskless account is a finite-variation process, its quadratic covariations vanish, and the Itô formula for , combined with and , gives .
Use two standard facts from stochastic calculus: a stochastic integral against a continuous local martingale is a local martingale, and a local martingale bounded below by a deterministic constant is a supermartingale. The latter follows by adding the constant to make the process nonnegative, stopping at a localizing sequence, and applying the conditional Fatou lemma. Thus admissible discounted wealth is a -supermartingale, and an arbitrage would satisfy
It follows that -almost surely, hence also physically almost surely by equivalence, a contradiction. Therefore an equivalent martingale measure rules out arbitrage among admissible self-financing strategies. The lower-bound restriction is essential to this argument; stochastic integrals need not be true martingales for arbitrary unbounded holdings.
The key convexity calculation is that the random-walk transition operator preserves convex functions. If is convex, then for ,
The pointwise maximum of convex functions is convex as well: the convexity inequality holds for each candidate and is bounded above by the convex combination of the two endpoint maxima. Thus the Bellman recursion proves convexity of a random-walk Snell value function by backward induction from .
To ensure that the functions in this argument are genuinely finite, rather than silently imposing a growth bound on , use integrability of translated convex random-walk rewards. Write for a sum of independent increments with the same law. For , the assumptions give integrability of and . The negative part of a finite convex function is Lipschitz, so translating preserves integrability of the negative part. For the positive part and , if the increment law is unbounded above, take an independent increment and . On that event lies between and , so convexity gives
If increments are bounded above by , then and the same convexity argument between and bounds the positive part by . For , use the corresponding lower-tail argument. Thus every translated reward is integrable for .
For , backward induction also gives the bound
It justifies every convolution in the Bellman recursion at these times, so the arbitrary assignments outside in the previous part are never needed when is convex. The displayed convexity calculation therefore proves that each for is a finite convex function. The chosen is constant and hence convex. This proves the requested conclusion for the deterministic representation under the finite-horizon assumptions.
There is a distinction between this representation and a value function for every possible starting point at time zero. Without translated integrability at the full horizon, the latter may take at unused states. For example, with , and for , the observed reward is integrable, but is infinite for . The constant time-zero extension avoids claiming a globally finite Bellman function under insufficient assumptions. If integrability is assumed for all times of an infinite random walk, the translated-reward argument with one extra time also makes the full time-zero Bellman function finite and convex.
Let be the common increment law. The random walk has the Markov property, since is independent of and . Its transition operator is wherever that integral exists.
Set . For , suppose the Borel function has been constructed and represents . On the Borel set
define the optimal stopping value function recursively by
Outside , assign the finite Borel value . Measurability of integrals against a fixed probability law proves measurability of both the set and the function. Integrability of and independence imply almost surely and
The Snell recursion thus proves by induction.
At time zero the generated sigma-algebra is trivial, so is deterministic. Since , define for all , with
when . This supplies a globally finite deterministic representation without assuming integrability of rewards from every unvisited starting state. Hence
With the additional statewise integrability normally used to define a value function for arbitrary starting states, one can instead use the Bellman maximum at time zero too. For , the representation is simply .
Backward induction first proves that the Snell envelope is adapted and integrable. At each step, , so integrability follows from that of and . Its defining maximum immediately gives
which proves that is a supermartingale.
If is a submartingale, the sharper backward identity is
It holds at . If it holds at , the tower property of conditional expectation gives . Iterating the submartingale inequalities shows that this is at least , so the maximum chooses this continuation value. The displayed identity then makes a martingale.
Fix the horizon and define the half-volatility measure for a square-root stock claim by
The Novikov condition makes a true martingale with , and makes equivalent to . The Girsanov theorem identifies as a Brownian motion under .
The exact factorization from the previous part is
Using the Bayes formula for conditional expectation therefore gives
The random integrated variance need not have any independence property under . Its pathwise bounds still imply . Inverting the same price function proves even for volatility adapted to the Brownian motion, on the positive-price event. The zero-price convention is as above. The auxiliary measure here is not asserted to be an equivalent martingale measure for the stock.

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