Assume (v). If the generic fibre had a nonzero proper -submodule, intersecting it with and rescaling to obtain a saturated lattice would give a nonzero proper -submodule of . Thus is simple.
Because is projective, its restriction to a Sylow p-subgroup is projective. The local algebra has only free finitely generated projectives, so divides
Consequently
Under (ii), tensor the direct-product decomposition with the residue field . Since is free over ,
Hence
and the reduced action map is the projection onto the first factor. This proves
Assume (iii). Reduction of the projective lattice is projective, because a direct-summand decomposition of a free -module remains one after tensoring with . Completeness of and idempotent lifting show that is indecomposable: otherwise a nontrivial idempotent of would lift and split , hence split the simple -module .
Let be the ordinary irreducible character of . Since is projective, vanishes on p-singular elements and restricts to the projective character of . Thus
An indecomposable projective module that is not simple has, besides its identity, a nonzero noninvertible endomorphism obtained by projecting onto its simple head and embedding the isomorphic simple socle. Hence its endomorphism algebra has dimension at least two. Therefore is simple as well as projective, proving
Assume (ii), and write the ring decomposition as
The natural column module is projective over by Morita equivalence; extending it by zero across makes it projective over . After extending scalars to , the action factors through on its natural module , which is simple. Therefore
The divisibility in (i) is the standard dimension test for a projective modular representation. If is a projective -module and is a Sylow p-subgroup of order , then is projective over . The group algebra of a p-group in characteristic p is local, so every finitely generated projective -module is free. Consequently
This will apply to in the implication (v)(i).
The eight-dimensional simple module is projective, so its tensor product of group representations with the natural three-dimensional module is projective. Its Brauer character is
From part (iii),
The duality of simple and projective Brauer characters makes the decomposition multiplicities unique. Hence, writing and for the corresponding projective covers,
This completes the explicit 2-modular representation theory of GL3 of F2 calculation.
The rows of the Cartan matrix of a group algebra express the projective characters in the simple Brauer-character basis. Thus
Evaluating gives
On the 2-regular classes the six ordinary characters decompose as
Therefore the decomposition matrix, with columns ordered , is
The Cartan matrix of a group algebra is
Only the classes are 2-regular. The trivial module and the natural three-dimensional module are simple; the dual natural module gives the conjugate three-dimensional character. Restricting the ordinary characters to the odd-order classes and using produces the fourth simple character of degree eight. The Brauer character table is
The ordinary degree-eight character restricts exactly to . Since its degree contains the full 2-part of , this simple module is projective and its singleton block has defect zero. Thus
If is projective over , then its restriction is projective over because is a free right -module and a free -module restricts to a free -module.
Conversely, suppose is projective. Then
is projective over . Part (i) says that is a direct summand of this induced module, so is projective. Hence projectivity detected on a subgroup of invertible index gives
Set
Every conjugate of equals , so
The D. Higman criterion therefore gives
Order the simple modules as in part (i), so that records the th diagonal character. The quotient has basis
For , multiplication gives
because every term below row lies on a lower subdiagonal. Hence the line generated by is , and the lines are independent. Therefore the radical layers of the lower triangular matrix algebra are
For the left regular module, the radical series of a module is obtained by multiplying by powers of the Jacobson radical:
Products of matrix units show that
with and . Thus each step removes one subdiagonal, and the Loewy length of is .
For , let with a lower triangular matrix acting by the scalar . These are pairwise nonisomorphic simple modules, since the diagonal matrix units distinguish them.
Let be the ideal of strictly lower triangular matrices. It is nilpotent, and
is a semisimple algebra. Hence is the Jacobson radical; explicitly,
Let have order . Property (ii) gives , since
It also gives
Therefore
for every rational torsion point of an elliptic curve. The construction in part (i), quadraticity in part (ii), and this identity establish existence; the bounded-difference and doubling argument in part (i) establishes uniqueness.
The addition law and part (a) give the approximate parallelogram identity
Replace by , divide by , and let . The error disappears, leaving the exact parallelogram law
Together with , induction on yields
for every integer .
Let be the -coordinate map and define the naive logarithmic height by
The duplication formula induces a degree-four morphism on the -line, so part (a) gives
uniformly in . The telescoping sequence is therefore Cauchy. Define the canonical height of an elliptic curve by
Summing the geometric error series proves that is bounded. If another function has this bounded-difference property and scales by four under doubling, evaluating the bounded difference at and dividing by proves uniqueness.
Suppose first that is regular and uncountable in . Part (b) and cardinal preservation by chain-condition forcing show that remains a cardinal number in , while part (a) makes every infinite ground-model cardinal below countable. Every ordinal below has ground-model cardinality below and is therefore countable in the extension. Thus is the least uncountable ordinal there:
Conversely, suppose and were singular in . Let and take in a cofinal function . Part (a) makes countable in , while the same remains cofinal there. This would give countable cofinality, contradicting first uncountable ordinal is regular. Hence was regular in , and for the intended uncountable ,
Assume that is regular and uncountable in , as required for this claim. If an antichain had size , apply the delta-system lemma at a regular uncountable cardinal inside to the finite domains of its conditions. After thinning, their domains form a delta-system with finite root .
There are fewer than possible restrictions to , because each coordinate has fewer than possible values. Since is a regular cardinal, we can thin again to conditions agreeing on . Any two now have disjoint domains outside and agree on , so their union is a common extension. This contradicts that is an antichain. Therefore
If the word “regular” is allowed to include , the printed claim needs the additional hypothesis that is uncountable; the finite-condition order can have an infinite antichain when .
Let , the generic union for the Finite-condition Lévy collapse, and fix an infinite cardinal number in . For every , the set of conditions defining a value at is dense: extend a condition at that fresh coordinate with any value below . Hence is a total function .
For every , the set of conditions assigning the value at some fresh coordinate is also dense. Genericity therefore makes surjective. Thus
so is a countable set in . Finite cardinals are already countable.

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