For a uniform contraction from a comparison function on a bounded set, the closed set is complete and has diameter at most . Suppose first . The limit condition supplies and such that for . On the remaining compact interval , if nonempty, the continuous ratio attains a maximum , since it is strictly below one at every point. Thus there is one with for every distance arising in .
Consequently throughout . Banach's theorem applies and gives a unique fixed point in . No linear structure or compactness of the ball is used; the compact object in the argument is only the scalar distance interval. If the closed ball is the singleton at radius zero, its self-map fixes that point. The estimate on the ratio near zero is what prevents the compact-interval supremum argument from approaching one at its missing endpoint.
A weak solution belongs to and satisfies
with the nonlinear right-hand side defining a bounded functional on . Under the stated global Lipschitz hypothesis this requirement is automatic: and boundedness of give whenever . Continuity of alone, without growth control, would not guarantee this for an arbitrary Sobolev function.
For the semilinear Poisson contraction threshold, use the gradient norm on , and let satisfy the Poincaré inequality . For , Lax-Milgram gives the zero-Dirichlet Poisson solution . Testing with yields . Define , a self-map of the complete space . For ,
Therefore is a sufficient condition for Banach's theorem to give a unique fixed point and hence a unique weak solution. There is no need to assume or to restrict to a small ball: the Lipschitz bound makes the map defined on all of . The same estimates give
With the optimal Poincaré constant, the threshold is for the First Dirichlet eigenvalue; the stated sufficient condition does not depend on knowing that optimal constant.
Banach's fixed-point theorem states that a map on a nonempty complete metric space with for a constant has a unique fixed point, approached from every starting point by iteration.
Choose and let . Induction gives . For , the triangle inequality and geometric series give
Thus the sequence is Cauchy and converges by completeness to some . The contraction estimate implies continuity, so . If were another fixed point, would force equality of the points. Passing also yields the quantitative error estimate
Weak convergence means for every . Weak-star convergence means for every , viewing as the predual. The Sequential Banach-Alaoglu theorem for a separable predual says that every norm-bounded sequence in has a weak-star convergent subsequence. Separability is what turns the bounded weak-star compactness statement into this sequential form.
For the weak-star limit of periodic rescalings, apply it with , which is separable, and . The rescaled functions have uniform essential-supremum bound . Let and . Since is one-periodic with zero mean, is a bounded one-periodic absolutely continuous primitive. Thus for every finite interval,
Every weak-star subsequential limit therefore satisfies for all . To apply the supplied uniqueness fact without assuming global integrability, fix and set . This is in , and its integral over any interval is zero, since intersecting with again gives an interval. Hence almost everywhere. Taking integer yields almost everywhere on the whole line.
Finally, if the full sequence did not converge weak-star to this constant, some and some subsequence would have its pairing with bounded away from zero. Sequential compactness gives a further weak-star convergent subsequence, whose limit must be the constant just identified, a contradiction. Therefore
This is averaging against integrable test functions, not a claim of pointwise or strong norm convergence.
The weak derivative condition is
Both integrals exist since are locally integrable and the test function has compact support. Derivatives are defined up to almost-everywhere equality. The space consists of whose first weak derivatives all lie in . One standard norm is
A sum in the last formula gives an equivalent norm. For restriction to , extend any by zero to . Its support is compactly contained in , so the extension is smooth. The identity over then reduces exactly to the identity over , proving locality of the weak derivative.
For the jump contribution to a piecewise weak derivative, integration by parts on the two sides of the joining point gives the distributional derivative
The coefficient is the right trace minus the left trace . If a locally integrable weak derivative existed, locality on each open side would identify it almost everywhere with the displayed regular part. Substituting that into the global test identity would force for every test function, hence . Equivalently a nonzero Dirac point mass cannot be represented by a locally integrable derivative.
For the point-mass term vanishes, and both the function and its piecewise derivative are bounded on the finite interval. Thus and hence in every listed . Therefore membership holds exactly for . Changing a single point value is irrelevant to Sobolev membership; it cannot remove mismatched one-sided traces when .
By Lagrange's theorem, the index of a subgroup is . Thus the set of left cosets has three elements, and the preceding group action yields a group homomorphism after labelling them.
Its image is a subgroup of , so its order divides . By the first isomorphism theorem, also divides . Hence its order divides , giving possibilities and . The action on cosets is transitive: sends to . It cannot be the trivial action on a three-element set, so the image does not have order . Therefore
It follows that . Part (b)(i) gives , and ; equal finite orders force equality. A kernel of a group homomorphism is a normal subgroup, so
This is an instance of the fact that a subgroup of index the smallest prime divisor is normal.
Define on the set of left cosets. It is well-defined: if , then for some , so . The identity fixes each coset, and associativity in gives
Hence this is a left group action, and part (a) supplies its group homomorphism .
An element of the kernel of a group homomorphism fixes every coset, in particular itself. Thus implies , which implies . Therefore
The subgroup symbol is justified because a kernel of a group homomorphism is a subgroup, and the argument proves containment.
The group action law gives
Thus is a bijection with inverse , hence a permutation of . Also, for every ,
Therefore the assignment takes values in the symmetric group and satisfies
It is a group homomorphism, with the group product on the right interpreted as composition of permutations.
A left group action of on a set is a function satisfying
for all and . Writing , these are and . No commutativity is assumed, so the order of composition matters.
By the preceding relabelling formula, every conjugate of is a three-cycle, and any three-cycle on four symbols can be obtained by a suitable relabelling. Therefore
There are eight elements, agreeing with the count .
Likewise, conjugation preserves the pattern of two disjoint transpositions, and every partition of four symbols into two pairs is realized by relabelling. Thus
These have the respective cycle types and in the symmetric group .
Conjugation of a permutation relabels each symbol by the inverse conjugating permutation. Specifically,
To verify the direction of the inverse, apply the left side to : first takes it to , the original cycle takes it to , and takes it to , with cyclic indexing. Any symbols fixed by the original permutation are similarly relabelled and remain fixed. More generally, conjugate every cycle of a disjoint-cycle decomposition in this way; disjointness is preserved because is a bijection.
If , it commutes with each , so . Its conjugacy class is therefore .
Conversely, if , then for every . Multiplication by on the left gives for every , which is exactly membership in the center of a group. Thus
The center of a group consists of its elements commuting with every element. First check it is a subgroup. The identity element is central. If and , then commutes with and
Thus , proving closure under the subgroup criterion. Moreover, if , then for every . Hence conjugation fixes the center elementwise, so
Therefore the center of a group is a normal subgroup.
A subgroup of is a normal subgroup if conjugation by every element preserves it:
Equivalently, for every . Here equality means equality of sets; it does not require each individual element of to commute with every element of .
A group homomorphism from an additive cyclic group is determined by the image of , subject exactly to in multiplicative notation, or in an additive target.
For , the relation is , equivalently . The possibilities are , and each defines a homomorphism between cyclic groups. Thus there are three such maps, an instance of the number of homomorphisms between finite cyclic groups.
For , the image of must be a permutation whose order of a group element divides . A permutation on four symbols can have order or , so the allowed images are the identity and the three-cycles. There are three-cycles: choose their three symbols and one of the two cyclic orientations. Hence there are nine maps.
Finally, each transposition in has order , so its image in must have order dividing both and , and is therefore the identity. Every permutation is a product of transpositions, so every element must map to the identity. There is one map. In the order asked, the counts are
Let . A group homomorphism preserves powers and the identity element, so
The preceding divisibility property gives
Now assume is surjective and choose of order . Take a preimage of , and write , as the divisibility result permits. The element has order exactly : its th power is , while implies , hence . Therefore contains an element of order , namely .
The preimage itself need not have order ; taking the suitable power is the essential step. The constructed element need not map to the original . This proves that element orders in a finite quotient occur in the original group.
Lagrange's theorem states that for a subgroup of a finite group ,
where is the index of a subgroup, the number of its left cosets. In particular, divides .
The cyclic subgroup consists of the distinct elements , where . Every power reduces to one of these by the Euclidean division, and a repetition among them would contradict minimality of . Thus . Applying Lagrange's theorem gives
The order of a group element is the least positive integer for which , whose existence follows from part (i). If , use the Euclidean division to write , where . Then
Minimality of forces . Thus
The argument also works for negative , using integer powers and the same remainder convention.
Among the powers in the finite group , the pigeonhole principle forces two to be equal: with . Multiply by to obtain
This proves the existence of a positive power equal to the identity element, without presupposing the order of a group element.
The image of a linear map lies inside . Therefore . Also restricted to cannot have rank of a linear map greater than its domain's dimension, so . Thus
Equivalently, apply the rank-nullity theorem to that restriction: . This proof keeps track of the intermediate vector subspace, rather than assuming an invertible factor.

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