Theorems and Proofs

amsthm’s theorem environments, numbered and cross-referenced

LaTeX’s amsthm package gives mathematics its theorem environments: theorems, lemmas and definitions with a run-in head, a number and an optional note, and proofs that end with a small square. The theme has the same environments as block shortcodes. This page uses them on a little group and ring theory, numbered within sections as \newtheorem{theorem}{Theorem}[section] would.

The front matter of this page plays the role of the preamble:

tufte:
  headings: {number: 1}                  # numbered ## sections
  theorems:
    kinds:
      theorem: {within: section}         # \newtheorem{theorem}{Theorem}[section]
      conjecture: {counter: conjecture}  # \newtheorem{conjecture}{Conjecture}
      principle: {name: Principle, style: definition}   # \theoremstyle{definition}
                                         # \newtheorem{principle}[theorem]{Principle}

Every built-in kind (lemma, proposition, corollary, definition, example, remark…) shares the counter theorem, as in the AMS templates, so the definition, theorem and lemma below read 1.1, 1.2 and 1.3. Conjectures have a counter of their own, and on a page that is not a book chapter it is not reset by sections: they read 1 and 2.

1Groups

A margin note on a line of its own at the start of a theorem takes no room in the text: the head still runs into the first paragraph.

Definition 1.1. A group is a set GG with an associative operation G×G→GG \times G \to G, an identity element ee and, for every g∈Gg \in G, an inverse g−1g^{-1} with gg−1=g−1g=eg g^{-1} = g^{-1} g = e. A subgroup is a subset that is a group under the same operation.

The definition above is {{< definition label="def:group" >}}…{{< /definition >}}. Definitions, examples and exercises are set upright (\theoremstyle{definition}); theorems, lemmas, propositions, corollaries and conjectures in italics (plain); remarks and notations upright with an italic head (remark).

Theorem 1.2 (Lagrange). If HH is a subgroup of a finite group GG, the order of HH divides the order of GG.Lagrange proved it in 1771 for groups of permutations of the roots of a polynomial; the general statement came with Galois and Jordan.

The theorem was written {{< theorem "Lagrange" "thm:lagrange" >}}: the first argument is the note in parentheses (\begin{theorem}[Lagrange]), the second its label. The named form is {{< theorem note="Lagrange" label="thm:lagrange" >}}. A sidenote in a theorem stays upright.

Proof of Theorem 1.2. By Lemma 1.3 every left coset gHgH has as many elements as HH, and two left cosets are equal or disjoint. So GG is the disjoint union of [G:H][G:H] cosets of ∣H∣|H| elements each, and ∣G∣=[G:H] ∣H∣|G| = [G:H]\,|H|. ■

Nor does one at the end of a proof: the symbol still ends the last line.

{{< proof of="thm:lagrange" >}} names the theorem it proves; {{< proof >}} says just “Proof”, and {{< proof "Sketch" >}} gives any other head (\begin{proof}[Sketch]). A proof that ends with a paragraph has the end-of-proof symbol at the end of its last line.

Lemma 1.3. For every g∈Gg \in G the map h↦ghh \mapsto gh is a bijection from HH onto the coset gHgH.

Proof of Lemma 1.3. The map is onto gHgH by the definition of gHgH, and one to one because gg has an inverse:

gh=gh′  ⟹  h=g−1(gh)=g−1(gh′)=h′. gh = gh' \implies h = g^{-1}(gh) = g^{-1}(gh') = h'. (1)■

In a numbered display the \qedhere symbol follows the equation number.

Conjecture 1 (Goldbach). Every even integer greater than 22 is the sum of two primes.

A kind without a shortcode of its own is written with thm: {{< thm "conjecture" "Goldbach" >}}, the kind first. Its body starts with {{< label "conj:goldbach" >}}, the port of \begin{conjecture}\label{conj:goldbach}: a label in a theorem’s body refers to the theorem, so {{< xref "conj:goldbach" "full" >}} reads Conjecture 1.

Remark. The converse of Lagrange’s theorem fails: the alternating group A4A_4 has order 1212 and no subgroup of order 66.

That remark is unnumbered, {{< remark numbered=false label="rem:u" >}}, as if declared with \newtheorem*; it takes no number from the counter. A partial converse is due to Cauchy, here an unnumbered theorem whose note carries a citation (cite="lang2002"):

Theorem (Cauchy).Serge Lang. Algebra, volume 211 of Graduate Texts in Mathematics. Springer, New York, 3rd edition, 2002 If a prime pp divides the order of a finite group GG, then GG has an element of order pp.

Proposition (Cayley). Every group GG is isomorphic to a group of permutations: the map sending gg to the permutation x↦gxx \mapsto gx of GG is an injective homomorphism from GG into the symmetric group on the set GG.

Cayley’s theorem above is a proposition written with title="Cayley" (an alias of the note), numbered=false, style="definition" (an upright body, \theoremstyle{definition} for this one theorem) and class="fullwidth", which spans the text and the margin column.

Sketch of the proof. McKay’s argument counts the pp-tuples (g1,…,gp)(g_1, \dots, g_p) of elements of GG whose product is ee:

  • there are ∣G∣p−1|G|^{p-1} of them, a multiple of pp;
  • a cyclic shift of such a tuple is another one, so they fall into orbits of 11 or pp tuples;
  • the orbits of one tuple are the (g,…,g)(g, \dots, g) with gp=eg^p = e; their number is a multiple of pp, and (e,…,e)(e, \dots, e) is one of them, so some g≠eg \ne e has order pp.■

The sketch ends with a list, so the symbol would go on a line of its own; {{< qedhere >}} at the end of the last item puts it there instead, as \qedhere does.

2Rings

Theorem 2.1. The units of a ring RR with identity form a group R×R^\times under multiplication.

Proof. Multiplication is associative and 11 is a unit, so it remains to see that R×R^\times is closed under inverses and products. Inverses first:

Lemma 2.2. A unit uu has exactly one inverse u−1u^{-1}, and u−1u^{-1} is a unit.

Proof. If vu=1=uwvu = 1 = uw, then v=v(uw)=(vu)w=wv = v(uw) = (vu)w = w; and uu is an inverse of u−1u^{-1}. ■

If uu and vv are units, so is uvuv, with inverse v−1u−1v^{-1}u^{-1}:

(uv)(v−1u−1)=u(vv−1)u−1=uu−1=1=(v−1u−1)(uv). (uv)(v^{-1}u^{-1}) = u(vv^{-1})u^{-1} = uu^{-1} = 1 = (v^{-1}u^{-1})(uv). ■

The lemma inside the proof is numbered 2.2, after the theorem it helps to prove, as in LaTeX. The proof ends with a display, and \qedhere written in the TeX puts the symbol at the right end of that display.

Corollary 2.3. The nonzero elements of a field FF form a group under multiplication.

Conjecture 2 (Köthe). A ring with no nonzero nil two-sided ideal has no nonzero nil one-sided ideal.

Proof of Corollary 2.3. In a field:

  • every nonzero element is a unit, and 00 is not, so F×=F∖{0}F^\times = F \setminus \{0\};
  • Theorem 2.1 makes it a group.

■

Without \qedhere, a proof that ends with a list has its symbol on a line of its own.

Example 2.4. The units of Z/8Z\mathbb{Z}/8\mathbb{Z} are the classes of 11, 33, 55 and 77. Each of them is its own inverse, so this group of order 44 is not cyclic; its subgroups have 11, 22 or 44 elements, as Theorem 1.2 requires. ◇

The example ends with a symbol of its own, {{< example qed="◇" >}} (thmtools’ qed=); a proof takes qed= too, and theorems.qed sets the symbol of every proof.

3Cross-references and other kinds

A theorem’s label works with xref like any other. {{< xref "thm:lagrange" "full" >}} prints Theorem 1.2 (cleveref’s \cref), {{< xref "thm:lagrange" "name" >}} its note, Lagrange (\nameref), and {{< xref "lem:coset" >}} the number alone, 1.3. An unnumbered remark is referred to by its word, Remark, and Corollary 2.3 comes from {{< xref "cor:unit" "full" >}}. The kind decides the word, whatever the label’s prefix. The other formats work too: "num" gives 1.3, "eq" (1.3) and "page" the section that holds the lemma, “Groups” (\pageref). A labelled proof, {{< proof of="thm:lagrange" label="prf:lagrange" >}}, is referred to by its head: Proof of Theorem 1.2.

A kind of your own is declared in the options, as this page does in its front matter with principle: {name: Principle, style: definition} (\theoremstyle{definition} \newtheorem{principle}[theorem]{Principle}), and written with thm, here {{< thm kind="principle" numbered=false >}}:

Principle. If n+1n + 1 objects are put into nn boxes, some box holds at least two of them.

Without a declaration, thm gives the word itself with name= ({{< thm kind="principle" name="Principle" >}}); a translated word comes from an i18n key thmPrinciple.

Definition (Order). The order ∣G∣|G| of a group is its number of elements.

Theorems also work in a margin block, like the definition next to this paragraph, and in a sidenote,Remark. A theorem in a sidenote is set inline, in the note’s type. where they are set inline.

The heads here are in small capitals, the theme’s look. tufte: {theorems: {look: amsthm}} gives amsthm’s bold heads, and tufte: {style: latex} turns it on with the rest of the LaTeX look, together with amsthm’s open box □\square as the end-of-proof symbol (theorems.qed). The list of the theorems of this page, thmtools’ \listoftheorems, is {{< listoftheorems >}}:

List of Theorems

  1. Definition 1.1
  2. Theorem 1.2 Lagrange
  3. Lemma 1.3
  4. Conjecture 1 Goldbach
  5. Remark
  6. Theorem Cauchy
  7. Proposition Cayley
  8. Theorem 2.1
  9. Lemma 2.2
  10. Corollary 2.3
  11. Conjecture 2 Köthe
  12. Example 2.4
  13. Principle
  14. Definition Order
  15. Remark

A list of some kinds only, with a heading of its own, is {{< listoftheorems kinds="conjecture" heading="Conjectures" >}}:

Conjectures

  1. Conjecture 1 Goldbach
  2. Conjecture 2 Köthe

References

  1. Serge Lang. Algebra, volume 211 of Graduate Texts in Mathematics. Springer, New York, 3rd edition, 2002.