Inside , the finite-function order has the countable chain condition for finite-function forcing. In an uncountable family of binary conditions there are uncountably many distinct finite domains, since each domain supports only finitely many conditions. These domains would have an uncountable Delta-system subfamily by the Delta-system lemma. There are only finitely many assignments to the common finite root, so thin further to an uncountable family agreeing there. Any two such conditions have a union that is again a function and is a common stronger extension. Thus no uncountable antichain in a forcing order exists.
Here is the relevant preservation argument, rather than an appeal to the condition alone. Fix forcing that a forcing name is a function . For each , choose inside a maximal antichain in a forcing order below deciding . By the countable chain condition for forcing, this antichain is countable in , so the possible values form a countable . The union is countable in , hence bounded below its regular . The interpreted has range contained in , by maximality and the dense-below generic meeting lemma. It therefore cannot be a surjection onto .
If were not a cardinal number in , it would be equinumerous with a smaller ordinal, which was countable already in ; composing with that ground-model enumeration would give a surjection . This is impossible. Therefore
This is the possible-values lemma for chain-condition forcing specialized to . Countability and regularity in this proof are computed inside , not inferred from the external countability of .
The Fn forcing here is ; larger partial functions are stronger conditions. This translates the inclusion description into standard notation for forcing as when . Compatible members of the generic filter agree wherever both are defined, so
is a function. For every , the conditions whose domains contain that coordinate form a dense subset of a forcing order. This requirement belongs to , and the generic filter meets it. Consequently is total.
Define the generic coordinate reals for finite-function forcing by
For distinct , the conditions assigning opposite bits to those rows at some column form a dense subset of a forcing order. Given any finite condition, choose a column absent from both rows and extend by assigning zero to one coordinate and one to the other. Genericity supplies such a condition in , so .
The function is formed inside by separation and replacement from . Hence
This constructs an injective function on the ground-model ordinal ; preservation of its cardinal status is a separate issue.
Let be the bounded graph predicate for a function . For an infinite cardinal number, regularity is expressed by
The predicate is the cardinal predicate in (i), conjoined with the bounded condition that is a nonzero limit ordinal. For an infinite cardinal number, this latter condition holds automatically; it excludes the finite cardinals. The expression abbreviates bounded graph membership with the output lying in .
Every quantifier after is bounded, and the cardinal predicate is already . Their conjunction can be placed in universal form, so this is a Pi-one formula modulo ZF. Its mathematical content is that no function from a smaller ordinal is cofinal in . By the definition of cofinality, that is equivalent to . Hence regular cardinalhood is Pi-one definable. This uses the standard convention that a regular cardinal is infinite.
Use the Lévy hierarchy, with bounded formulas in set theory as the quantifier-free level for this purpose. Let be the bounded ordinal predicate, and let be the bounded predicate saying that is a graph of a bijection from onto . Then cardinalhood is expressed by
All quantifiers in and are bounded by the displayed sets and the graph. Ordered-pair membership, graph functionality, injectivity and surjectivity have bounded expansions using the usual set coding of ordered pairs. The only unbounded quantifier shown is universal over . The formula is therefore and in particular a Pi-one formula modulo ZF.
In ZF, a cardinal number is an ordinal not in bijection with any smaller ordinal, so this formula has exactly the required meaning. Thus cardinalhood is Pi-one definable; the argument does not use the axiom of choice.
Apply the same pumping of a group multiplier automaton to the accepted pair containing the given representative . Since , there is a nonempty loop entirely after the tape containing has ended. Write , with the letters read during this loop. Repeating the loop any number of times leaves the other tape equal to , and the group multiplier automaton accepts the resulting padded convolution of words. Consequently
These words over an alphabet have distinct lengths because . Hence there are infinitely many representatives of in . No uniqueness of representatives was assumed in either part.
Use the synchronous group multiplier automata belonging to the automatic structure for a group. Write for the padded convolution of words: the shorter tape is completed with a symbol outside the alphabet, and reading stops when both words over an alphabet have ended. Our convention is
Let be at least the number of states of each of these finite-state automata, including .
Choose a shortest representative of . In the first orientation, accepts ; in the other orientation it accepts . If , the accepting run has more than transitions after the tape containing has ended. Two states in that suffix coincide. Delete the intervening nonempty loop. Every deleted column contains on the fixed tape and a genuine letter on the tape containing , so the resulting input remains a valid padded convolution of words. The group multiplier automaton still accepts, giving a shorter representative of the same . This contradicts minimality. Thus a representative can always be chosen with
This argument does not require a symmetric alphabet: the second orientation uses the same with its tapes interchanged in the input, rather than a presumed .
Choose continuous representatives using Morrey's inequality. On the closed unit ball they are uniformly bounded by and satisfy
The Arzelà-Ascoli theorem therefore gives a uniformly convergent subsequence with a continuous limit. For , use the uniform Lipschitz estimate instead; this part remains valid at that endpoint.
For weak lower semicontinuity of the Hilbert norm, weak convergence gives , and hence
Taking the lower limit proves .
For the nonlinear integral, use local Sobolev compactness gives lower semicontinuity of a nonnegative integral. Select a subsequence attaining the lower limit of the integrals. The Rellich-Kondrachov compactness theorem on successively larger balls gives a diagonal subsequence converging strongly in local L2 space to . After a further subsequence it converges almost everywhere. Since , the Fatou lemma gives
Each integral is finite because . The argument uses local compactness rather than convexity: is not a convex function on the whole real line.
On a bounded Lipschitz domain , the Rellich-Kondrachov compactness theorem states that is compact for and
with for . Thus when , every finite is allowed when , and the embedding into continuous functions with their uniform norm is compact when .
For the main proof, a Sobolev extension operator puts a bounded sequence into a common compactly supported region of . The Sobolev fundamental theorem of calculus on lines gives the uniform translation estimate . Convolution with a mollifier therefore approximates the sequence uniformly in Lp space. At any fixed smoothing scale, its derivatives and supremum are uniformly bounded, so the Arzelà-Ascoli theorem gives a convergent subsequence. A diagonal choice and the uniform approximation give strong Lp space convergence. The finite measure of handles , while Lp interpolation inequality with the bounded Sobolev embeddings upgrades this to the larger subcritical finite Lp spaces; for , Morrey's inequality gives uniform equicontinuity directly and the Arzelà-Ascoli theorem gives uniform convergence. Boundedness of the domain is essential.
Part (c) shows that every finitely presented group embeds in a finitely presented group with no nontrivial finite quotients of a group. Consequently this property also has no possible forbidden witness . Therefore
Both properties have positive witnesses, for example and the trivial group respectively. It is the required embedding obstruction that fails in each case.
Every finitely presented group embeds in by . This direct product of groups is finitely presented: combine finite presentations of the factors and add the finitely many cross-commutation relations between their generators. Projection onto gives a nontrivial finite quotient of a group.
Thus no finitely presented can serve as the forbidden witness for this property. Hence
Suppose in . In , the commutator is a nonempty cyclically alternating free-product word. Every positive power remains reduced, so has infinite order. Each also has infinite order: this is immediate for ; if , then , and otherwise is a cyclically alternating word of length two.
Consequently the presentation defining is a multiple HNN extension identifying the infinite cyclic subgroups and . By the normal form theorem for an HNN extension, embeds in .
The subgroup
is a free group on exactly these elements. For a proof, view as . For every , the reduced expression lies neither in nor in . It therefore belongs to none of the associated cyclic subgroups or . Any freely reduced word in with a stable letter has no pinch and is nontrivial by Britton's lemma. A word with no stable letters is a nonzero power of , also nontrivial. This proves the claimed free basis of a group.
Inside the rank-two free group , the elements
freely generate a subgroup of rank . This is the same free-product normal-form calculation as for the conjugate basis in Question 5: between conjugates with distinct indices, a nonzero power of remains. The identifications in the output presentation give an isomorphism matching these free bases. Hence
The normal form theorem for an amalgamated free product makes both factors embed. Composing the embeddings gives
Thus the construction preserves whenever the input word is nontrivial, regardless of whether that word has finite or infinite order in .
If in , its image is the identity in the output group, so . The equations then give and for every , hence . Therefore , and the relation gives . Since the normal closure of is , every is . The remaining identifications make every equal to as well. All output generators vanish, proving
This proves collapse even when the original group itself is nontrivial.
Every old box either remains untouched or has its entry replaced by a strictly smaller incoming value. Thus on all boxes of the original diagram,
The appended box has no old entry to compare; equivalently, extend the old filling by outside its diagram if the inequality is to be written for every position.
We now prove the unheaded longest increasing subsequence assertion. After any prefix of the permutation has been inserted, write the first-row entries as . The useful invariant is: is the smallest possible final value of an increasing subsequence of length in that prefix, and is the greatest possible subsequence length. It holds for the empty prefix.
Suppose the next letter enters the first row in column . Then , if , while if column already exists. A subsequence of length ending at can be extended by , giving a subsequence ending at of length ; for , the singleton suffices. A longer subsequence ending at would have an earlier length- prefix ending below , contradicting the minimality of . If , the previous prefix has no subsequence longer than , giving the same upper bound.
Replacing by , or appending it at , preserves the invariant. It lowers the smallest final value at length . At smaller lengths, existing minima are already below , so they cannot improve; no subsequence of greater length can end at . The lower rows do not change this first-row update. Induction proves that the longest increasing subsequence ending in has length exactly the column in which first enters.
Taking the maximum over all letters gives Schensted's first-row theorem:
This concerns the column of the incoming letter in the first row, not the column of the new box that eventually appears at the end of the bumping path.
Suppose an entry is bumped from column of row . If row already contains a cell in column , its entry is greater than by the strict column condition in the original near Young tableau. When is inserted into that row, the first entry greater than therefore occurs in a column at most .
If the next row is shorter than , either a bump occurs earlier or is appended in column . This also handles the final appended box. Each successive bumping position is therefore weakly to the left of the previous one. The bumping columns satisfy
This is the row-insertion bumping-path monotonicity needed to preserve the Young-diagram shape and column order.
A near Young tableau is a filling of a Young diagram by distinct entries from a totally ordered alphabet, increasing along rows and down columns; the entries need not be . For row insertion of , scan the first row for its leftmost entry larger than . If one exists, replace it by and insert the displaced entry into the next row by the same rule. Otherwise append to the row and stop. Continue until a new outer-corner box is appended.
The Robinson–Schensted correspondence inserts the letters of a permutation successively to form . Whenever the th insertion creates a new cell, put in that cell of a second tableau . Row insertion preserves increasing rows and columns, so is standard; the sequence of growing diagrams makes standard, with the same shape. To reverse the construction, remove the box carrying the largest label in , and reverse the bumping in : in each row above, exchange the carried entry with the rightmost smaller entry, continuing up to the first row. The final expelled entry is the last letter of the permutation. Repeating recovers the whole permutation, establishing the bijection with pairs of standard Young tableaux of a common shape.
For the bumping inequality, each displaced entry is the first entry strictly larger than the incoming one. Thus every step replaces a larger entry with a smaller entry and carries that larger value downwards. Consequently the bumped values strictly increase:
There are -cycles in , and each has the same character value of a representation on . Taking traces in the cycle-sum identity for Young–Jucys–Murphy elements yields
Only tableaux whose first entries form a hook partition contribute.
Write such a shape as , for . There are ways to fill it: choose which of the labels go below the first box. There are ways to fill the remaining skew diagram with the labels , in standard order. The eigenvalue from part (ii) is , so the factor
is . Therefore the general character value is
Here counts standard skew Young tableaux, and is zero when is not contained in . In particular, for a full -cycle,
For , the general formula gives , the character value at the identity, as it should.
Let be a standard Young tableau of shape , and let be the shape formed by its entries . Since Young–Jucys–Murphy elements act by contents, the eigenvalue of on its Gelfand–Tsetlin basis vector is
If is not a hook partition, it contains , whose content is zero, so this product is zero. If with , its nonzero contents are and . Their product is independent of the order of the labels. Therefore the eigenvalue is
The empty product at gives . When , , giving exactly the hook-versus-nonhook distinction suggested by the hint. For , it is the intermediate shape , rather than the final shape , that controls the answer.
For , the product is empty and equals the identity, the only -cycle in . Suppose the cycle-sum identity for Young–Jucys–Murphy elements holds at :
Multiplication by gives terms . With permutation products acting right to left, this inserts immediately after in the cycle of : the arrows become , with the other arrows unchanged.
Conversely, in any -cycle there is a unique predecessor of . Delete and join that predecessor to the successor of ; this uniquely recovers and the factor . Hence every -cycle occurs exactly once, and no other permutation occurs. Induction proves
Thus is a conjugacy-class sum in , although it need not be central in when .
For , take the three vectors from part (iii):
Their joint Young–Jucys–Murphy element weights, in the order , are
They are distinct, and part (ii) says that these operators generate . Therefore a Gelfand–Tsetlin basis is
If an orthonormal basis is desired, use , , and . The corresponding standard Young tableaux have shape , with the second-row entry respectively . Their contents agree with the three displayed weights.
Let be the coordinate vectors and choose
These vectors lie in the sum-zero standard representation of the symmetric group. They are mutually orthogonal for the usual Hermitian inner product, with , so they form a basis of its -dimensional space.
If , every transposition in exchanges two coordinates equal to , so each fixes . If , summing the transpositions gives coordinate in each of positions and coordinate in position , hence . Finally, if , the th coordinate of is zero. In the sum of the transpositions, any coordinate in its support retains its original value in terms and becomes zero in the remaining term; the th output coordinate is the sum of the original first coordinates, which is zero.
Thus all actions are diagonal in this basis:
This supplies an explicit Gelfand–Tsetlin basis of the standard representation.

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