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#
Definition 1.1. A group is a set with an associative operation , an identity element and, for every , an inverse with . 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 is a subgroup of a finite group , the order of divides the order of .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 has as many elements as , and two left cosets are equal or disjoint. So is the disjoint union of cosets of elements each, and . ■
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 the map is a bijection from onto the coset .
Proof of Lemma 1.3. The map is onto by the definition of , and one to one because has an inverse:
(1)■In a numbered display the \qedhere symbol follows the equation number.
Conjecture 1 (Goldbach). Every even integer greater than 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 has order and no subgroup of order .
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 divides the order of a finite group , then has an element of order .
Proposition (Cayley). Every group is isomorphic to a group of permutations: the map sending to the permutation of is an injective homomorphism from into the symmetric group on the set .
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 -tuples of elements of whose product is :
- there are of them, a multiple of ;
- a cyclic shift of such a tuple is another one, so they fall into orbits of or tuples;
- the orbits of one tuple are the with ; their number is a multiple of , and is one of them, so some has order .■
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 with identity form a group under multiplication.
Proof. Multiplication is associative and is a unit, so it remains to see that is closed under inverses and products. Inverses first:
Lemma 2.2. A unit has exactly one inverse , and is a unit.
Proof. If , then ; and is an inverse of . ■
If and are units, so is , with inverse :
■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 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 is not, so ;
- 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 are the classes of , , and . Each of them is its own inverse, so this group of order is not cyclic; its subgroups have , or 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 objects are put into 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 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
as the end-of-proof symbol (theorems.qed). The list of the
theorems of this page, thmtools’ \listoftheorems, is
{{< listoftheorems >}}:
List of Theorems
- Definition 1.1
- Theorem 1.2 Lagrange
- Lemma 1.3
- Conjecture 1 Goldbach
- Remark
- Theorem Cauchy
- Proposition Cayley
- Theorem 2.1
- Lemma 2.2
- Corollary 2.3
- Conjecture 2 Köthe
- Example 2.4
- Principle
- Definition Order
- Remark
A list of some kinds only, with a heading of its own, is
{{< listoftheorems kinds="conjecture" heading="Conjectures" >}}:
Conjectures
References
- Serge Lang. Algebra, volume 211 of Graduate Texts in Mathematics. Springer, New York, 3rd edition, 2002.