Take to consist of together with the following sentences.
  • is injective and surjective:
  • For every -ary operation symbol of ,
This includes for each constant symbol .
  • For every -ary relation symbol of ,
The first pair of axioms makes the interpretation a bijection. The remaining schemes say exactly that it preserves every operation and relation, so exactly when and .
Finally, is consistent and hence has a model by part (b). Expanding by interpreting as the identity automorphism gives a model of , so is consistent.
The compactness theorem states that a set of first-order sentences has a model if and only if every finite subset of has a model.
The forward implication follows by using the same model for every finite subset. Conversely, suppose every finite subset of has a model. If were inconsistent, a formal derivation of from would use only finitely many assumptions, say those in . Then would be inconsistent. By part (b), would have no model, contrary to the hypothesis. Thus is consistent, and part (b) gives a model of .
Suppose first that . By the soundness theorem for first-order logic, every theorem of is true in . A contradiction cannot be true in a structure, so is consistent.
Conversely, the Godel completeness theorem says that every semantically valid consequence is derivable. Its equivalent model-existence form says directly that every consistent first-order theory has a model. Hence
Since is even,
The first factor is not divisible by , since that would contradict minimality of , and the second is not divisible by by hypothesis. Nevertheless their product is divisible by . Therefore
and Euclid's algorithm computes a nontrivial factor. One can also compute ; together the two gcds expose factors lying on opposite sides of the congruence modulo the prime-power divisors of .
Define
using the inverse of for negative . Since , . Conversely, if then , so the definition of order gives . Two integers in the same block of consecutive integers cannot differ by a nonzero multiple of . Hence is one-to-one within each period.
The order of modulo is the least positive integer such that
It exists because is a unit in the finite group .
Seek and put . The generalized characteristic equation is
or
As a quadratic in , this is
so
A corresponding displacement vector is
Thus the four normal modes are and . Both squared frequencies are positive for every , proving linear stability.
For ,
Therefore, labeling the larger and smaller positive frequencies by and ,
so .
Put and . The Euler--Lagrange equations, after division by the appropriate powers of , are
Time-translation invariance conserves the total energy
Setting both angles and velocities to zero satisfies the equations, so the downward configuration is an equilibrium. Writing and retaining linear terms gives
Equivalently, the mass and stiffness matrices are
With the pivot as origin and upward vertical coordinate,
Therefore
The potential energy is
Thus is
Take in part (c). The original equation has the solution . The solution is normalized by as , so
Comparing this with the formula for and using gives
This also agrees with the general identity .
Set
This Möbius change sends to , respectively, without changing the corresponding exponents. The hypergeometric P-symbol has exponents
Matching it with at both finite singularities and at infinity gives
The exponent-zero solution normalized to one at is therefore
The second standard local solution at is
After absorbing the constant into its normalization, this becomes
Their exponents at are and , so they are linearly independent.

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