Write for the indicator function and use the normalized Fourier analysis on a finite abelian group
There are sextuples satisfying the equation, since any five coordinates determine the sixth. The desired probability is consequently
By orthogonality of complex exponentials, the indicator of the equation is
Substitution makes all six sums independent and gives the sixth Fourier moment as a three-sum collision count:
Because is real, . Hence the probability is
For , let be the number of vertices of adjacent to both. The required number of ordered quadruples is
The Cauchy-Schwarz inequality first gives
Reverse the order of counting. A vertex contributes ordered pairs, so a second application of Cauchy-Schwarz and the assumed edge density of a bipartite graph give
Therefore the bipartite four-cycle count is
Let and take a formula over . Since is a strongly minimal theory, the set is finite or cofinite. If holds, it cannot be finite because , so it is cofinite. Elementarity of makes cofinite. Its finite complement is algebraic over , so lies in the set. Applying the same argument to gives the reverse implication. Hence is elementary: both elements realize the generic type in a strongly minimal theory over the corresponding domains.
If models have bases of the same dimension of a pregeometry, choose a bijection . Repeated use of the one-point result makes it elementary on every finite subset and hence on . Every model is the algebraic closure of a basis. Extending the map back and forth across algebraic elements produces an isomorphism . Thus models of a strongly minimal theory with the same dimension are isomorphic.
Put . We seek a model containing and omitting every element of . Every finite set of these omission requirements is satisfiable: if a finite met every model containing , the supplied result would imply , a contradiction.
Apply the compactness theorem to the elementary-diagram formulation of these requirements, using the Tarski-Vaught test to axiomatize the selected elementary submodel. It gives a model containing and omitting all of . Part (a) gives , while omission of gives the reverse inclusion. Therefore
Assume no induced graph on has the random-graph extension property. For each , choose finite disjoint such that no vertex of realizes the prescribed adjacency pattern. The unions and are finite and disjoint. The extension property in supplies a new vertex adjacent to all of and none of . But for some , contradicting the choice of . Thus some satisfies the extension property. It is a countable model of the theory of the random graph, so part (a) gives
The theory of the random graph has the extension property: for finite disjoint vertex sets , there is a new vertex adjacent to every point of and to no point of .
Let be countable models and let be a finite partial embedding. Enumerate and . At an even stage, take the first outside the domain. Its adjacency pattern to the finite domain prescribes finite disjoint subsets of the range; the extension property in supplies a new image with exactly that pattern. At an odd stage, apply the same argument to the inverse map and the first unused . This back-and-forth method produces an increasing sequence of finite partial embeddings whose union is an isomorphism. Hence every finite partial embedding extends to an isomorphism .
Define a parameter-free equivalence relation by
Its classes correspond exactly to the distinct sets . If there are exactly classes, that fact is a first-order sentence, so the elementary substructure contains representatives of all of them. Every is -equivalent to some , and is definable over .
The converse also holds because is small and is a monster model. If there were infinitely many -classes, the partial complete type
would be finitely satisfiable. Saturation of would realize , producing a class with no representative in , contrary to the hypothesis. Therefore there are only finitely many sets .
The Tarski-Vaught test states that a substructure is an elementary substructure if and only if every formula and tuple satisfy
Necessity follows immediately from elementarity. Conversely, assume the witness condition. Induct on formulas to prove that exactly when for every . Atomic formulas agree because is a substructure, and Boolean connectives follow by induction. A witness in is also one in ; a witness in can be replaced by one in by hypothesis, after which induction applies to the matrix. Universal formulas follow by negation. Thus the witness condition is equivalent to .
Yes, but there is only one nontrivial isomorphism type that works. If , then
The infinite dihedral group contains its infinite cyclic rotation subgroup with index two, so it is amenable by virtually abelian groups are amenable.
Suppose now that . The action of on its Bass-Serre tree is non-elementary: one vertex degree is greater than two, so there are hyperbolic elements with disjoint pairs of endpoints. Suitable powers satisfy the ping-pong lemma on the boundary and generate a copy of . Since a subgroup of an amenable group is amenable, an amenable group cannot contain this nonamenable subgroup. The amenability of a free product therefore yields
for nontrivial finitely generated .
For the standard generator of the additive group , take the intervals
Only the two endpoints change under translation by , and hence
The same follows for every fixed integer translation by iteration. Therefore these sets are a Følner sequence for the integers, and satisfies the Følner condition.
For a finite generating set , the Følner condition requires that for every there be a nonempty finite such that
where denotes symmetric difference. Choose a Følner sequence and define normalized counting functions on all subsets by
By compactness of the product , some subnet converges pointwise to a function . The identities and finite additivity on disjoint subsets pass to the limit, so is a finitely additive probability measure.
For a fixed , the triangle inequality for symmetric differences gives
Consequently
so . The limit is left invariant and the Følner condition implies amenability. Thus every finitely generated group satisfying the Følner condition is amenable.
An amenable group is a group admitting a left-invariant finitely additive probability measure . For a -set , subsets are equidecomposable subsets under a group action if there are finite partitions , and elements such that . The action is a paradoxical group action if contains two disjoint subsets, each -equidecomposable with .
To prove the nonamenability of a nonabelian free group, write and let be the set of nonempty reduced words beginning with . Cancellation of the first letter gives the disjoint decompositions
If an invariant measure existed, these would imply
Every singleton has measure zero: invariance gives all singletons the same measure, and finite additivity over arbitrarily many distinct points forces that measure to vanish. The four sets partition , so their measures sum to one. The two displayed equations say that the same sum is two, a contradiction. Hence
Consider the matrices
Their projective action on the positive real line is
These disjoint images give the monoid version of the ping-pong lemma: after removing a common initial letter, two different positive words act differently. Thus generate a free monoid. There are distinct positive words of length , all lying in the radius- word ball for any generating set enlarged to contain . Therefore the Exponential growth of SL2 of Z gives
A finitely generated group has polynomial growth of a group if its growth function is bounded above by for some constants .
Let be generated by . Since is a two-step nilpotent group, every group commutator is central. Commuting letters past one another therefore collects every word of length at most into the form
The generator exponents satisfy . At most exchanges are needed during collection, so is a sufficient bound. With , the number of possible collected expressions is at most
Relations can only reduce this count. This proves the polynomial growth of a finitely generated two-step nilpotent group, so every finitely generated two-step nilpotent group has polynomial growth.
Choose any finite generating set of the finitely generated group . Starting from a finite generating set of , set
Every -word in of length at most is also an -word in of length at most . The inclusion of the corresponding word-metric balls is injective, so the growth function of a finitely generated group satisfies
For a locally finite discrete metric space with basepoint , the growth function of a discrete metric space is
In a Cayley graph, left multiplication by is a graph isometry carrying to any other vertex . It therefore gives a bijection for every . Thus the growth function of a fixed Cayley graph is exactly independent of the basepoint.

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