The roots-of-unity criterion for a splitting field for finite group representations says that the assumed th roots of unity make a splitting field for . Fix a multiplicative identification of the group with the complex th roots of unity. For a p-regular element , its order divides ; the operator is diagonalizable because has distinct roots in . If its eigenvalues, counted with multiplicity, are , define the Brauer character by
where hats denote the chosen complex lifts. This defines a class function on the p-regular elements, not on arbitrary elements of .
A short exact sequence can be represented by block triangular matrices, so the eigenvalue multiset is the union of those on its submodule and quotient. Thus Brauer characters are additive on short exact sequences. If are the simple -modules, the Jordan–Hölder theorem gives
We use the standard Brauer–Nesbitt theorem in its character form: over a splitting field the Brauer characters of the nonisomorphic simple modules are linearly independent over . Therefore
Both the modular splitting-field criterion and this independence theorem are the representation-theoretic results used here.
Put . A finitely generated module over is finite-dimensional over , and multiplication by is a nilpotent linear map with . Its Jordan normal form exists over because its minimal polynomial is a power of . Each Jordan block has size and is the cyclic module . Hence
A submodule of is an ideal of , and its inverse image is an ideal of the principal ideal domain containing . The only possibilities are with . Thus all submodules form the chain
Every successive quotient is the one-dimensional simple module on which acts as zero. This is its unique composition series, so is a uniserial module and is an indecomposable representation: two nonzero direct summands would be incomparable submodules. Only is simple.
For of order , the group algebra satisfies
since in characteristic . Consequently, up to isomorphism, are precisely the finite-dimensional indecomposable modules, and . The finite-dimensional convention follows from the finite-generation hypothesis; “exactly” counts isomorphism classes.
Let be the group norm element. This is a nonzero vector in the group algebra , and is a trivial submodule of its left regular module. If were a semisimple algebra, this submodule would have a -linear projection . Write . Since for every , we would have
whereas a projection onto satisfies . Thus .
Use the convention that a weak modular form is a holomorphic function on the complex upper half-plane satisfying
with no condition at infinity. In particular , so it has a Laurent series on , where . It is a modular form when it is holomorphic at a cusp, here the unique level-one cusp at infinity, equivalently for . It is a cusp form when additionally . If one uses the narrower weakly holomorphic convention, one also requires finitely many negative terms; the derivative argument below holds in that subspace as well. The matrix forces odd-weight forms to be zero.
Put , with , and
We prove the derivative transformation of a weak modular form in the uniform form
For this is the weight- transformation under . Differentiating the formula and multiplying by , since , gives the recurrence
where out-of-range coefficients are zero. The displayed explicit coefficients satisfy it. Indeed, for interior , extract the common polynomial ; the remaining identity is
This follows from Pascal's identity and . The endpoint coefficients satisfy the recurrence directly. This polynomial proof also applies when a factor is zero, avoiding division by that factor. As , the result is
The letter in the printed exponent is the same derivative order .
For integer , take . If , the product runs from through , and therefore vanishes. Consequently has weight under . It is also invariant under , by differentiating , and generate the modular group. Its holomorphy is preserved by differentiation. With , termwise differentiation of the locally convergent Laurent series gives the Bol identity for modular forms:
For negative indices the exponent is a positive integer, and the constant term is killed, so every term is unambiguous.
Let and . The modular group acts on the complex upper half-plane by fractional linear transformations, and
For fixed , the values with primitive integer pairs have a positive minimum: the conditions bound both and , leaving finitely many pairs. By Bezout identity, a minimizing pair is the bottom row of a matrix in . Applying that matrix gives a point of maximal imaginary part in its orbit.
Translate it by a power of into . It must have modulus at least one, since otherwise would increase its imaginary part. If it is on the unit circle with negative real part, apply , which there changes to . This gives an element of the specified half-open standard fundamental domain of the modular group. It proves existence by reduction to the standard modular region.
For uniqueness, if lies in the closed standard region then and
for every primitive pair. If , this follows from ; if , it follows from . If , then uses , while gives
If both and lie in the region, applying this inequality to and forces their imaginary parts to agree, hence .
The equality cases describe every possible boundary identification. For the map is an integer translation; the half-open vertical strip retains one representative. For , equality requires , and the map is an inversion followed by an integer translation. Inversion exchanges the two halves of the circle, so retaining only the right half removes the duplication; the only translation that returns the exchanged endpoint is the one identifying the two corners. The remaining equality cases have , and , and give only those same corner identifications. Our region retains the right corner alone. Therefore , proving
The equality analysis also gives the elliptic stabilizers of the modular group. The central matrices fix every point. The point is fixed by , with , and the retained corner is fixed by , with . There are no other noncentral stabilizers, and the possible bottom rows in the equality cases give exactly
The corresponding stabilizer orders in are two, three and one; the requested group is , so the center must be included.
The original PDF has the summation condition ; the TeX's is a transcription error. There is also an actual missing hypothesis in the PDF's coefficient formula: that simplified formula requires a primitive Dirichlet character. We first derive a formula valid for every character, and then show both the primitive specialization and a counterexample to the unrestricted version.
For , the character-twisted Eisenstein series converges absolutely and locally uniformly on the complex upper half-plane. On a compact subset, is bounded below by a positive constant times , and the corresponding two-dimensional lattice sum converges. Changing to proves
The condition makes the terms for and equal. The terms with contribute , and all other terms are twice the sum over .
For , the cotangent identity and
give, after differentiations,
Differentiation is justified by locally uniform convergence. This is the cotangent partial-fraction Fourier kernel.
Write , with running through the unit classes modulo , and define the finite Fourier transform
Here is the Gauss sum of a Dirichlet character.
Applying the kernel with yields
The double series converges absolutely: and the exponential decay controls . Grouping the terms with proves the general Fourier expansion of a character-twisted Eisenstein series:
If is a unit modulo , substitution gives . Suppose now that is primitive and is a nonunit. Choose a prime . Reduction of units modulo onto units modulo is surjective. Primitivity means that is nontrivial on its kernel, so there is a unit with . Since , substitution by forces and thus . This proves the finite Fourier transform of a primitive Dirichlet character identity, and consequently
The inverse-character notation in the question is understood to mean , extended by zero on nonunits; literal inversion of would be undefined.
For a counterexample without primitivity, take , the principal character, and . Then , so but . At , the general formula gives , whereas the printed simplified formula, interpreted as zero on nonunits, gives . Hence the printed coefficient formula is false for arbitrary imprimitive characters; the general boxed formula above supplies the correction.
Extend each Dirichlet character periodically to all integers by setting when . Its Dirichlet L-function is initially the absolutely convergent Dirichlet series
The group has elements. Part (i) gives, for every integer , including nonunits,
For a nonunit both sides are zero, because the fixed class is a unit. Interchanging the finite character sum and the absolutely convergent Dirichlet series therefore proves
This is Orthogonality of Dirichlet characters applied to a residue-class indicator. Any meromorphic continuations of the two sides agree by uniqueness of analytic continuation.
Write and , where is the character group of a finite abelian group. The Fundamental theorem of finitely generated abelian groups writes the finite group as a product of cyclic groups. A character of a cyclic group factor of order is determined by an arbitrary th root of unity, so . This description also shows that the characters separate points: if , a nonzero coordinate of is detected by a character with .
Multiplication by permutes , so
For this forces . For every summand is one. Since , the character-sum cancellation lemma gives
All character values are roots of unity, so inversion here is also complex conjugation. This is the finite-abelian version of character orthogonality.
Take and
This is a nonempty basic open set in the Ellentuck topology. It is a closed set in the ordinary topology on infinite subsets: an infinite set outside contains an odd integer, and its finite initial segment through that integer gives an ordinary cylinder disjoint from .
Its ordinary interior is empty. In any nonempty ordinary cylinder , choose an odd integer and continue by any infinite increasing tail. The resulting point belongs to and lies outside . Indeed the smaller cylinder is disjoint from . Since is ordinary-closed with empty ordinary interior, it is a nowhere dense set for . Hence
The answer is no. Let , regarded as one point of the space of infinite subsets of the natural numbers, and put
The displayed union makes an open set in the Ellentuck topology. On the other hand, every basic neighbourhood of contains a different infinite set: keep and remove one element from its infinite remaining tail. This other point belongs to . Therefore is in the closure of but not in , so
The fact that basic neighbourhoods are clopen sets does not make arbitrary unions of them closed.
The two Ramsey properties and the topologies. Write for the space of infinite subsets of the natural numbers, and for the infinite subsets of . The positive integers are used throughout. A Ramsey set of infinite subsets has the property that every infinite contains an infinite for which lies wholly in or wholly in .
For finite and infinite above , let
These are the basic neighbourhoods of the Ellentuck topology, denoted in the question. They form a basis: if belongs to two such sets, their stems are comparable initial segments of ; take the longer stem and the intersection of the two tails beyond that stem. This intersection contains the infinite remaining tail of and yields a basic set contained in both.
A completely Ramsey set allows such a homogeneous refinement inside every , with infinite and the stem kept fixed. Taking shows that complete Ramseyness implies Ramseyness. The ordinary topology on infinite subsets has basic cylinders
It is the usual product topology on increasing enumerations and is coarser than the Ellentuck topology.
Examples distinguishing the properties. A non-Ramsey example uses the axiom of choice. Let and enumerate all infinite sets as . Each has cardinality : an enumeration of gives the upper bound, and choosing one element from each of infinitely many disjoint pairs gives an injection from all binary sequences for the lower bound.
By transfinite recursion, choose two distinct, previously unused elements at each stage. Fewer than elements have been used at stage , so this is possible without any assumption on the Continuum hypothesis. Put . All the remain outside , since subsequent choices also avoid previously chosen elements. Every contains one and one , so is not a Ramsey set of infinite subsets. This is the non-Ramsey set from transfinite selection construction.
Perform the same construction on , giving a non-Ramsey set , and put
For any infinite , the infinite set has , so is a Ramsey set of infinite subsets. But no with infinite is homogeneous, because meets both and its complement. Therefore is not a completely Ramsey set.
Every star-open set is completely Ramsey. We give the full fusion proof for open Ellentuck sets, without quoting an infinite Ramsey theorem. Fix a star-open set and a basic set . For finite and an infinite tail above , say accepts if ; it rejects if no infinite subset of accepts . Both properties persist under passing to infinite subsets. Every infinite tail can be thinned to decide : take an accepting subset if one exists, and otherwise the original tail rejects it.
First thin to decide . If it accepts, the required homogeneous neighborhood has already been found. Otherwise keep a rejecting tail. We now fuse to an infinite set deciding every finite , where the decision for is made by .
To do this, choose successively from an infinite current tail. After choosing , thin the tail above to decide each of the finitely many subsets of , one after another, before choosing the next element. For any finite , at the stage when its largest element is selected, the current tail decides and contains every later selected element. Heredity therefore gives a decision on . For , rejection persists from the initial tail.
If rejects , only finitely many can have accepting . Otherwise let be the infinite set of those . Every member of has a first new element , and its remaining tail lies in . It therefore belongs to by acceptance of . This would make accept , contradicting rejection.
Thin a second time to so that every finite is rejected. Start with the rejected empty set. At a finite stage, all subsets of the selected elements are rejected. For each of these finitely many subsets, avoid its finitely many next elements that would give an accepted extension, and choose the next beyond all excluded elements. Since decides every finite extension, each new extension is rejected. Induction gives the asserted property of .
We claim . If , openness provides a basic set containing . Extend , if necessary, to an initial segment of containing . Write with finite . The infinite tail lies in and
It is therefore an accepting subtail for , contradicting rejection. We have found either an accepting neighborhood or a neighborhood disjoint from . Thus
Basic neighborhoods are clopen. Consider and a point outside it. If is not an initial segment of , take an initial segment of of length at least ; its ordinary cylinder cannot meet . Otherwise some element of is outside ; take through that element, and again is disjoint from .
Thus the complement of is already open in the ordinary topology on infinite subsets, and hence in the finer Ellentuck topology. A basic neighbourhood is open by definition, so
Let be a convergent sequence in the Stone-Čech compactification of the natural numbers, with limit . Each fixed occurs only finitely often: the Hausdorff property gives a neighbourhood of excluding , and eventually the sequence is in that neighbourhood.
If were not eventually equal to , infinitely many terms would differ from . They could not take only finitely many distinct values, because each such value occurs only finitely often. Recursively select a subsequence of pairwise distinct terms, all different from . It still converges to , contradicting the preceding parts. Hence
This establishes no nontrivial convergent sequences in the Stone-Čech compactification for arbitrary sequences, including ones with repetitions.
Let . For every even index , and imply . For every odd index , disjointness gives , so and . Consequently
The limit ultrafilter contains either or . Whichever it contains, the corresponding basic clopen set or is a neighbourhood of , but infinitely many sequence terms lie outside it. This contradicts convergence. Therefore pairwise distinct ultrafilters cannot form a convergent sequence in , the key step in no nontrivial convergent sequences in the Stone-Čech compactification.
Use the isolating sets from the preceding part and make the finite disjointification
For , , so . Therefore
by finite-intersection closure of the ultrafilter. If , and imply . Also avoids every earlier , hence every earlier . Thus
Only finite intersections were used; no countable-intersection closure of an ultrafilter is being assumed.
The ultrafilter space. An ultrafilter on is a proper filter on a set: it is upward closed, closed under finite intersections, excludes , and contains exactly one of for each . The Stone-Čech compactification of the natural numbers is the set of these ultrafilters, with basic sets
They form a basis since and . Moreover , so each is a clopen set. The principal ultrafilter at embeds in this space; every nonempty contains such a point, so the embedded copy is dense.
Distinct ultrafilters have some with . Then , and are disjoint open sets separating them. Thus the space is Hausdorff.
For compactness, any open set cover can be refined to a cover by basic sets. If has no finite subcover, the sets have the finite intersection property: otherwise finitely many cover , and their basic sets cover every ultrafilter. Extend the proper filter on a set generated by these complements to an ultrafilter . This extension follows from Zorn lemma: unions of chains of proper filters remain proper, and a maximal proper filter decides every versus . Indeed, if adding made the filter improper, some existing filter member would be disjoint from , forcing into the filter. This contains every and misses every , a contradiction. Hence
This proves the compact Hausdorff topology on ultrafilters directly.
An idempotent. The addition on the Stone-Čech compactification of the natural numbers can be defined by
Associativity is supplied. For fixed , the inverse image of under is , so this translation is continuous directly from the definition. This makes a left-topological semigroup in the convention used here.
We prove the Ellis–Numakura lemma in this case. Among nonempty compact subsemigroups choose one, , minimal by inclusion. It exists by Zorn lemma: a descending chain has nonempty intersection by compactness, and that intersection is again a compact subsemigroup. For , the set is a nonempty compact subsemigroup contained in . Compactness follows from continuity; closure under addition follows from
Minimality gives . Hence there is with . The set
is nonempty, compact, and a subsemigroup: if , then . Thus minimality gives , and in particular . Therefore
This is an idempotent ultrafilter on the natural numbers.
Isolating the sequence terms. Now use the hypothetical convergent sequence of distinct ultrafilters. For each , choose with , possible since . Convergence implies for all sufficiently large . Thus only finitely many indices have . Call this finite set .
For each , choose with , using distinctness. Set
Finite-intersection closure puts in . For , either or one of the chosen is absent from ; upward closure then prevents from belonging to . Hence
Let be a word length supplied by the Hales-Jewett theorem for alphabet and two colors. For , embed into by the coordinate duplication for combinatorial lines map
Pull back any two-color finite coloring to this word space. The Hales-Jewett theorem gives a monochromatic combinatorial line with nonempty active set . Its image is a combinatorial line whose active set is
and hence has size , a positive even integer. Therefore
The empty set's presence in the family causes no difficulty: the line just constructed has at least two active coordinates.
Let be an intersecting family. For a word , put . Give the red color if contains some member of , and the blue color otherwise.
Consider any combinatorial line with active set . At variable value , , so that word is red. At variable value , . No member of can be contained in this , because every member meets . Thus that word is blue. No such line is monochromatic, proving
If is empty there is no permitted active set at all, so it is also not an adequate family of active coordinate sets.
Hales–Jewett and the arithmetic-progression consequence. For a finite alphabet and a positive integer , the Hales-Jewett theorem gives an integer such that every -color finite coloring of contains a monochromatic combinatorial line. A combinatorial line has a nonempty active coordinate set: all those coordinates receive the same freely varying letter, and the remaining coordinates are fixed.
We first prove the alphabet insensitivity lemma. Fix two letters , with , and a desired dimension . There is a combinatorial subspace of dimension on which changing to in any variable coordinate, with all other variable coordinates arbitrary, preserves the color.
For the construction, divide the coordinates into consecutive blocks. Choose their lengths from left to right by
Process the blocks from right to left. When processing block , the later blocks already form a -dimensional combinatorial subspace. Color each word in block by the vector of its original colors for every prefix word of length and every assignment to those later variables. There are contexts, and at most such color vectors.
The words , , contain two, indexed by , with the same vector by the pigeonhole principle. Fix the first coordinates to , the coordinates after to , and make coordinates the active set of one new variable. Its values now have identical colors for every prefix and later-variable context. The active set is nonempty. Insensitivity already obtained in later blocks survives, because it held for every unrestricted earlier prefix. After all blocks have been processed, changing in any of the variables preserves the color. This proves the lemma.
Now induct on . For , a one-coordinate combinatorial line is automatically monochromatic. For , let be a length supplied by the theorem for alphabet and colors. Apply the alphabet insensitivity lemma for the letters to obtain a -dimensional combinatorial subspace. Restrict its variables to . Induction gives a monochromatic combinatorial line in those variables. Its values have the same color, and its value has the same color as its value by successively switching the active variables. Lifting this line to the original coordinates proves
For the Van der Waerden theorem, fix a progression length and use the alphabet . Pull back an -color finite coloring of along
A combinatorial line with active set maps to the arithmetic progression , where and its common difference is . The Hales-Jewett theorem makes this progression monochromatic. Length one is trivial, so every finite coloring of the positive integers contains monochromatic arithmetic progressions of every finite length.
The active-coordinate obstruction. Color a word red when its first coordinate is , and blue otherwise. Any combinatorial line whose active coordinate set contains has a red word at variable value and a blue word at variable value , since . Thus
Here adequacy is the adequate family of active coordinate sets property; an active coordinate set is always nonempty.

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