Professional Documents
Culture Documents
PDF Advanced Modern Algebra Part 1 3Rd Edition Joseph J Rotman Ebook Full Chapter
PDF Advanced Modern Algebra Part 1 3Rd Edition Joseph J Rotman Ebook Full Chapter
https://textbookfull.com/product/advanced-modern-algebra-
part-2-3rd-edition-joseph-j-rotman/
https://textbookfull.com/product/modern-quantum-mechanics-3rd-
edition-j-j-sakurai/
https://textbookfull.com/product/modern-accountancy-vol-1-3rd-
edition-hanif/
https://textbookfull.com/product/foundations-of-modern-
macroeconomics-3rd-edition-ben-j-heijdra/
Advanced Algebra Digital Second Editions Anthony Knapp
https://textbookfull.com/product/advanced-algebra-digital-second-
editions-anthony-knapp/
https://textbookfull.com/product/a-modern-introduction-to-
differential-equations-3rd-edition-henry-j-ricardo/
https://textbookfull.com/product/environmental-studies-3rd-
edition-benny-joseph/
https://textbookfull.com/product/galois-theory-and-advanced-
linear-algebra-1st-edition-rajnikant-sinha/
https://textbookfull.com/product/applied-linear-algebra-second-
edition-peter-j-olver/
Joseph J. Rotman
Graduate Studies
in Mathematics
Joseph J. Rotman
Graduate Studies
in Mathematics
Volume 165
The 2002 edition of this book was previously published by Pearson Education, Inc.
2010 Mathematics Subject Classification. Primary 12-01, 13-01, 14-01, 15-01, 16-01,
18-01, 20-01.
Copying and reprinting. Individual readers of this publication, and nonprofit libraries
acting for them, are permitted to make fair use of the material, such as to copy select pages for
use in teaching or research. Permission is granted to quote brief passages from this publication in
reviews, provided the customary acknowledgment of the source is given.
Republication, systematic copying, or multiple reproduction of any material in this publication
is permitted only under license from the American Mathematical Society. Permissions to reuse
portions of AMS publication content are handled by Copyright Clearance Center's RightsLink®
service. For more information, please visit: http: I /www.ams.org/rightslink.
Send requests for translation rights and licensed reprints to reprint-permission©ams. org.
Excluded from these provisions is material for which the author holds copyright. In such cases,
requests for permission to reuse or reprint material should be addressed directly to the author(s).
Copyright ownership is indicated on the copyright page, or on the lower right-hand corner of the
first page of each article within proceedings volumes.
Third edition © 2015 by the American Mathematical Society. All rights reserved.
Second edition © 2010 by the American Mathematical Society. All rights reserved.
First edition © 2002 by the American Mathematical Society. All right reserved.
The American Mathematical Society retains all rights
except those granted to the United States Government.
Printed in the United States of America.
§ The paper used in this book is acid-free and falls within the guidelines
established to ensure permanence and durability.
Visit the AMS home page at http: I /www.ams.org/
10987654321 20 19 18 17 16 15
To my wife
Marganit
and our two wonderful kids
Danny and Ella,
whom I love very much
Contents
Part A. Course I
-
vii
viii Contents
Part B. Course II
Chapter B-1. Modules 273
Noncommutative Rings 273
Chain Conditions on Rings 282
Left and Right Modules 288
Chain Conditions on Modules 300
Exact Sequences 305
Chapter B-2. Zorn's Lemma 313
Zorn, Choice, and Well-Ordering 313
Zorn and Linear Algebra 319
Zorn and Free Abelian Groups 323
Semisimple Modules and Rings 334
Algebraic Closure 339
Transcendence 345
Liiroth's Theorem 353
Chapter B-3. Advanced Linear Algebra 359
Torsion and Torsion-free 359
Basis Theorem 362
Contents ix
Bibliography 681
Special Notation 687
Index 693
Preface to Third Edition:
Part 1
1 It is most convenient for me, when reviewing earlier material, to refer to my own text FCAA:
A First Course in Abstract Algebra, 3rd ed. [94], as well as to LMA, the book of A. Cuoco and
myself [23], Learning Modern Algebra from Early Attempts to Prove Fermat's Last Theorem.
- xi
xii Preface to Third Edition: Part 1
2 A Survey of Modern Algebra was rewritten in 1967, introducing categories, as Mac Lane-
Birkhoff, Algebra [73].
Preface to Third Edition: Part 1 xiii
Course I
After presenting the cubic and quartic formulas, we review some undergraduate
number theory: division algorithm; Euclidian algorithms (finding d = gcd(a, b)
and expressing it as a linear combination), and congruences. Chapter 3 begins
with a review of commutative rings, but continues with maximal and prime ideals,
finite fields, irreducibility criteria, and euclidean rings, PIDs, and UFD's. The next
chapter, on groups, also begins with a review, but it continues with quotient groups
and simple groups. Chapter 5 treats Galois theory. After introducing Galois groups
of extension fields, we discuss solvability, proving the Jordan-Holder Theorem and
the Schreier Refinement Theorem, and we show that the general quintic is not
solvable by radicals. The Fundamental Theorem of Galois Theory is proved, and
applications of it are given; in particular, we prove the Fundamental Theorem of
Algebra (C is algebraically closed). The chapter ends with computations of Galois
groups of polynomials of small degree.
There are also two appendices: one on set theory and equivalence relations;
the other on linear algebra, reviewing vector spaces, linear transformations, and
matrices.
Course II
chapter, Commutative Algebra II, has two main parts. The first part discusses
"old-fashioned algebraic geometry,'' describing the relation between zero sets of
polynomials (of several variables) and ideals (in contrast to modern algebraic ge-
ometry, which extends this discussion using sheaves and schemes). We prove the
Nullstellensatz (twice!), and introduce the category of affine varieties. The second
part discusses algorithms arising from the division algorithm for polynomials of
several variables, and this leads to Grabner bases of ideals.
There are again two appendices. One discusses categorical limits (inverse limits
and direct limits), again concentrating on these constructions for modules. We also
mention adjoint functors. The second appendix gives the elements of topological
groups. These appendices are used earlier, in Chapter B-4, to extend the Funda-
mental Theorem of Galois Theory from finite separable field extensions to infinite
separable algebraic extensions.
I hope that this new edition presents mathematics in a more natural way,
making it simpler to digest and to use.
I have often been asked whether solutions to exercises are available. I believe
it is a good idea to have some solutions available for undergraduate students, for
they are learning new ways of thinking as well as new material. Not only do
solutions illustrate new techniques, but comparing them to one's own solution also
builds confidence. But I also believe that graduate students are already sufficiently
confident as a result of their previous studies. As Charlie Brown in the comic strip
Peanuts says,
"In the book of life, the answers are not in the back."
Acknowledgments
The following mathematicians made comments and suggestions that greatly im-
proved the first two editions: Vincenzo Acciaro, Robin Chapman, Daniel R. Grayson,
Ilya Kapovich, T.-Y. Lam, David Leep, Nick Loehr, Randy McCarthy, Patrick
Szuta, and Stephen Ullom. I thank them again for their help.
For the present edition, I thank T.-Y. Lam, Bruce Reznick, and Stephen Ullom,
who educated me about several fine points, and who supplied me with needed
references.
I give special thanks to Vincenzo Acciaro for his many comments, both mathe-
matical and pedagogical, which are incorporated throughout the text. He carefully
read the original manuscript of this text, apprising me of the gamut of my errors,
from detecting mistakes, unclear passages, and gaps in proofs, to mere typos. I
rewrote many pages in light of his expert advice. I am grateful for his invaluable
help, and this book has benefited much from him.
Joseph Rotman
Urbana, IL, 2015
Part A
Course I
Chapter A-1
Classical Formulas
As Europe emerged from the Dark Ages, a major open problem in mathematics
was finding roots of polynomials. The Babylonians, four thousand years ago, knew
how to find the roots of a quadratic polynomial. For example, a tablet dating from
1700 BCE poses the problem:
I have subtracted the side of the square from its area, and it is 870. What is
the side of my square?
In modern notation, the text asks for a root of x 2 - x = 870, and the tablet
then gives a series of steps computing the answer. It would be inaccurate to say
that the Babylonians knew the quadratic formula (the roots of ax 2 +bx+ c are
2~ (-b±../b2 - 4ac), however, for modern notation and, in particular, formulas, were
unknown to them. 1 The discriminant b2 - 4ac here is 1 - 4( -870) = 3481 = 59 2 ,
which is a perfect square. Even though finding square roots was not so simple in
those days, this problem was easy to solve; Babylonians wrote numbers in base 60,
so that 59 = 60-1 was probably one reason for the choice of 870. The ancients also
considered cubics. Another tablet from about the same time posed the problem of
solving 12x3 = 3630. Their solution, most likely, used a table of approximations to
cube roots.
1 We must mention that modern notation was not introduced until the late 1500s, but it
was generally agreed upon only after the influential book of Descartes appeared in 1637. To
appreciate the importance of decent notation, consider Roman numerals. Not only are they
clumsy for arithmetic, they are also complicated to write-is 95 denoted by VC or by XCV?
The symbols+ and - were introduced by Widman in 1486, the equality sign= was invented
by Recorde in 1557, exponents were invented by Hume in 1585, and letters for variables were
invented by Viete in 1591 (he denoted variables by vowels and constants by consonants). Stevin
introduced decimal notation in Europe in 1585 (it had been used earlier by the Arabs and the
Chinese). In 1637, Descartes used letters at the beginning of the alphabet to denote constants,
and letters at the end of the alphabet to denote variables, so we can say that Descartes invented
"x the unknown." Not all of Descartes' notation was adopted. For example, he used oo to denote
equality and = for ±; Recorde's symbol = did not appear in print until 1618 (see Cajori [16]).
- 3
4 Chapter A-1. Classical Formulas
Cubics
Arising from a tradition of public mathematics contests in Venice and Pisa, methods
for finding the roots of cubics and quartics were found in the early 1500s by Scipio
del Ferro (1465-1526), Niccolo Fontana (1500-1554), also called Tartaglia, Lodovici
Ferrari (1522-1565), and Giralamo Cardano (1501-1576) (see Tignol [115) for an
excellent account of this early history).
We now derive the cubic formula. The change of variable X = x-lb transforms
the cubic F(X) = X 3 + bX 2 + cX + d into the simpler polynomial F(x - lb) =
f(x) = x 3 + qx + r whose roots give the roots of F(X): If u is a root of f(x), then
u - lb is a root of F(X), for
g3 = ~ ( -r + J r2 + 2~ q3) = ~ ( -r + ../R)
(note that h3 is also a root of this quadratic, so that h3 = ~ (-r - ../R), and so
g3 - h 3 = ../R). There are three cube roots of g3, namely, g, wg, and w 2g. Because
of the constraint gh = -q/3, each of these has a "mate:" g and h = -q/(3g); wg
and w 2h = -q/(3wg); w 2g and wh = -q/(3w 2g) (for w3 = 1). •
6 Chapter A-1. Classical Formulas
g + h = \} ~ ( -6 + Fifi) + \} ~ ( -6 - Fifi).
It is not at all obvious that g + h is a real number, let alone an integer.
Another cubic formula, due to Viete, gives the roots in terms of trigonometric
functions instead of radicals (FCAA [94] pp. 360-362). .,..
Thus, the cubic formula was revolutionary. For the next 100 years, mathematicians
reconsidered the meaning of number, for understanding the cubic formula raises the
questions whether negative numbers and complex numbers are legitimate entities.
Quartics
Consider the quartic F(X) = X 4 + bX 3 + cX 2 + dX + e. The change of variable
X =x- lbyields a simpler polynomial f(x) = x 4 + qx 2 + rx + s whose roots give
the roots of F(X): if u is a root of f(x), then u-!b is a root of F(X). The quartic
3 Every cubic with real coefficients has a real root, and mathematicians tried various substi-
tutions to rewrite the cubic formula solely in terms of real numbers. Later we will prove the Casus
lrreducibilis which states that it is impossible to always do so.
Quartics 7
formula was found by Lodovici Ferrari in the 1540s, but we present the version
given by Descartes in 1637. Factor f(x),
f(x) = x 4 + qx 2 + rx + s = (x 2 + jx + f)(x 2 - jx + m),
and determine j, .e and m (note that the coefficients of the linear terms in the
quadratic factors are j and -j because f(x) has no cubic term). Expanding and
equating like coefficients gives the equations
.e+m-j2 = q,
j(m - .e) = r,
.em= s.
The first two equations give
2m = j2 + q + r / j,
2f = j2 + q-r/j.
Substituting these values for m and .e into the third equation yields a cubic in j 2 ,
called the resolvent cubic:
(j2)3 + 2q(j2)2 + (q2 _ 4s)j2 _ r2.
The cubic formula gives j 2 , from which we can determine m and .e, and hence the
roots of the quartic. The quartic formula has the same disadvantage as the cubic
formula: even though it gives a correct answer, the values of the roots are usually
unrecognizable.
Note that the quadratic formula can be derived in a way similar to the deriva-
tion of the cubic and quartic formulas. The change of variable X
= x - !b
re-
places the quadratic polynomial F(X) = X 2 + bX + c with the simpler polynomial
f(x) = x 2 + q whose roots give the roots of F(X): if u is a root of f(x), then u- !b
is a root of F(X). An explicit formula for q is c - tb
2 , so that the roots of f(x)
are, obviously, u = ±!v'b - 4c; thus, the roots of F(X) are!( - b ± v'b 2 - 4c).
2
It is now very tempting, as it was for our ancestors, to seek the roots of a quintic
F(X) = X 5 + bX 4 + cX 3 + dX 2 + eX + f (of course, they wanted to find roots of
polynomials of any degree). Begin by changing variable X = x - -! b to eliminate the
X 4 term. It was natural to expect that some further ingenious substitution together
with the formulas for roots of polynomials of lower degree, analogous to the resolvent
cubic, would yield the roots of F(X). For almost 300 years, no such formula was
found. In 1770, Lagrange showed that reasonable substitutions lead to a polynomial
of degree six, not to a polynomial of degree less than 5. Informally, let us say that
a polynomial f(x) is solvable by radicals if there is a formula for its roots which
has the same form as the quadratic, cubic, and quartic formulas; that is, it uses only
arithmetic operations and roots of numbers involving the coefficients of f(x). In
1799, Ruffini claimed that the general quintic formula is not solvable by radicals, but
his contemporaries did not accept his proof; his ideas were, in fact, correct, but his
proof had gaps. In 1815, Cauchy introduced the multiplication of permutations, and
he proved. basic properties of the symmetric group Sn; for example, he introduced
the cycle notation and proved unique factorization of permutations into disjoint
cycles. In 1824, Abel gave an acceptable proof that there is no quintic formula; in
8 Chapter A-1. Classical Formulas
his proof, Abel constructed permutations of the roots of a quintic, using certain
rational functions introduced by Lagrange. In 1830, Galois, the young wizard who
was killed before his 21st birthday, modified Lagrange's rational functions but, more
important, he saw that the key to understanding which polynomials of any degree
are solvable by radicals involves what he called groups: subsets of the symmetric
group Sn that are closed under composition-in our language, subgroups of Sn.
To each polynomial f(x), he associated such a group, nowadays called the Galois
group of f(x). He recognized conjugation, normal subgroups, quotient groups, and
simple groups, and he proved, in our language, that a polynomial (over a field of
characteristic 0) is solvable by radicals if and only if its Galois group is a solvable
group (solvability being a property generalizing commutativity). A good case can
be made that Galois was one of the most important founders of modern algebra.
We recommend the book of Tignol [115) for an authoritative account of this history.
Exercises
* A-1.1. The following problem, from an old Chinese text, was solved by Qin Jiushao4 in
1247. There is a circular castle, whose diameter is unknown; it is provided with four gates,
and two li out of the north gate there is a large tree, which is visible from a point six li
east of the south gate (see Figure A-1.1). What is the length of the diameter?
4 This standard transliteration into English was adopted in 1982; earlier spelling is Ch'in
Chiu-shao.
Chapter A-2
Divisibility
Notation. The natural numbers N is the set of all nonnegative integers
N = {O, 1,2,3, ... }.
The set Z of all integers, positive, negative, and zero, is
Z = {±n: n EN}.
(This notation arises from Z being the initial letter of Zahlen, the German word for
numbers.)
We assume that N satisfies the Least Integer Axiom (also called the Well-
Ordering Principle): Every nonempty subset C ~ N contains a smallest element;
that is, there is c0 EC with co :::; c for all c E C.
Definition. If a, b E Z, then a divides b, denoted by
a I b,
if there is an integer c with b = ac. We also say that a is a divisor of b or that b
is a multiple of a.
- 9
10 Chapter A-2. Classical Number Theory
Proof. Suppose that b = ac. Since 1 is the smallest positive integer, 1 ~ c and
a~ ac = b. •
g
cd(a b)
'
= {Otheiflargest
a= 0 = b,
common divisor of a and b otherwise.
This definition extends in the obvious way to give the gcd of integers ai, ... , an.
Proof. We may assume that at least one of a and b is not zero. Consider the set I
of all the linear combinations of a and b:
I= {sa + tb: s, t E Z}.
Both a and b are in I, and the set C of all those positive integers lying in I is
nonempty. By the Least Integer Axiom, C contains a smallest positive integer,
say d, and it turns out that dis the gcd ([23] Theorem 1.19). •
Definition. An integer p is prime if p :2: 2 and its only divisors are ±1 and ±p.
If an integer a :2: 2 is not prime, then it is called composite.
One reason we don't consider 1 to be prime is that some theorems would become
more complicated to state. For example, if we allow 1 to be prime, then the
Fundamental Theorem of Arithmetic (Theorem A-2.13 below: unique factorization
into primes) would be false: we could insert 500 factors equal to 1.
a= P1 ···Pt,
Proof. The proof is by induction on a :2: 2. The base step holds because a = 2
is prime. If a > 2 is prime, we are done; if a is composite, then a = uv with
2 s; u, v < a, and the inductive hypothesis says each of u, v is a product of primes .
•
We allow products to have only one factor. In particular, we can say that 3 is
a product of primes. Collecting terms gives prime factorizations (it is convenient
to allow exponents in prime factorizations to be 0).
Proof. If there are only finitely many primes, say, P1, ... , Pt, then N = 1 +Pl · · ·Pt
is not a product of primes, for the Division Algorithm says that the remainder after
dividing N by any prime Pi is 1, not 0. This contradicts Proposition A-2.5. •
gcd(p, b) = {P if PI b'.
1 otherwise.
Proof. A common divisor c of p and bis, in particular, a divisor of p. But the only
positive divisors of p are 1 and p. •
The next theorem gives one of the most important characterizations of prime
numbers.
12 Chapter A-2. Classical Number Theory
Proof. Suppose that p f a. Since gcd(p, a) = 1 (by Lemma A-2.7), there are
integers sand t with 1 = sp +ta (by Theorem A-2.3). Hence,
b = spb+ tab.
Now p divides both expressions on the right, and so p I b.
Conversely, if m = ab is composite (with a, b < m), then ab is a product
divisible by m with neither factor divisible by m. •
Thus, a and b are relatively prime if their only common divisors are ±1. For
example, 2 and 3 are relatively prime, as are 8 and 15.
Here is a generalization of Euclid's Lemma having the same proof.
Corollary A-2.9. Let a, b, and c be integers. If c and a are relatively prime and
if c I ab, then c I b.
Proof. There are integers s and t with 1 = sc + ta, and so b = scb + tab. •
Lemma A-2.10. Let a and b be integers.
(i) Then gcd(a, b) = 1 (that is, a and b are relatively prime) if and only if 1
is a linear combination of a and b.
(ii) If d = gcd(a, b), then the integers a/d and b/d are relatively prime.
Proof. The first statement follows from Theorem A-2.3; the second is LMA Propo-
sition 1.23 •
Definition. An expression a/b for a rational number (where a and bare integers)
is in lowest terms if a and b are relatively prime.
a a'd a' a
Proof. If d = gcd(a, b), then a= a'd, b = b'd, and b= b'd = b'. But a'= d and
b
b' = d' so gcd(a', b') = 1 by Lemma A-2.10. •
Proof. Suppose, on the contrary, that (a/b) 2 = 2. We may assume that a/bis in
lowest terms; that is, gcd(a,b) = 1. Since a 2 = 2b 2 , Euclid's Lemma gives 2 I a,
and so 2m = a. Hence, 4m 2 = a 2 = 2b2 , and 2m2 = b2 . Euclid's Lemma now gives
2 I b, contradicting gcd(a, b) = 1. •
This last result is significant in the history of mathematics. The ancient Greeks
defined number to mean "positive integer,'' while rationals were not viewed as
numbers but, rather, as ways of comparing two lengths. They called two segments
of lengths a and b commensurable if there is a third segment of length c with
a = me and b = nc for positive integers m and n. That v'2 is irrational was a
shock to the Pythagoreans; given a square with sides of length 1, its diagonal and
side are not commensurable; that is, v'2 cannot be defined in terms of numbers
(positive integers) alone. Thus, there is no numerical solution to the equation
x 2 = 2, but there is a geometric solution. By the time of Euclid, this problem
had been resolved by splitting mathematics into two different disciplines: number
theory and geometry.
In ancient Greece, algebra as we know it did not really exist; Greek mathemati-
cians did geometric algebra. For simple ideas, geometry clarifies algebraic formulas.
For example, (a+ b) 2 = a 2 + 2ab + b2 or completing the square (x + ~b) 2 =
(~b) 2 +bx+ x 2 (adjoining the white square to the shaded area gives a square).
········· ~-----~
a a2 ab
x
b ab
a b x
For more difficult ideas, say, equations of higher degree, the geometric figures in-
volved are very complicated, and geometry is no longer clarifying.
Theorem A-2.13 (Fundamental Theorem of Arithmetic). Every integer
a ~ 2 has a unique factorization
a= p~1 ... p~',
where P1 < · · · < Pt, all Pi are prime, and all ei > 0.
Proof. Suppose a = p~ 1 • • • p~' and a = q{1 • • • q{• are prime factorizations. Now
Pt I q{1 • • • q{•, so that Euclid's Lemma gives Pt I qi for some j. Since qi is prime,
however, Pt = qi. Cancel Pt and qj, and the proof is completed by induction on
max{t,s}. •
The next corollary makes use of our convention that exponents in prime fac-
torizations are allowed to be 0.
Another random document with
no related content on Scribd:
pak jai d’r poote.… goan d’r op legge.… ik hep nou d’r kop.… stevig-
àn hoor!.…
Onderhands bedacht ie, wat ie zeggen most als z’m vragen zouen,
waar ie geweest was, wat ie d’r uit te doen had? [197]
Niks.… niks heulegoar gain uitproatje had ie.… Dat moakte ’m stikke
van angst.
—F’rdomd, gromde Piet, se stikt t’met.… dá’ holp nie.… lá’ d’r nou
los.… Dirk, zelf geschrikt, plots voelend dat ie ’r vermoord kon
hebben, was angstig van d’r lijf opgesprongen, Gerrit uit z’n hoek
meesleurend, nu vrouw Hassel d’r beenen al wat minuten
beweegloos gehouen had. Met z’n zware schonken, dachten ze, dat
Dirk ’r doodgekneusd had, moeder gestikt onder de lakens zou
blauwen.
Guurt en Piet rukten de dekens in plooiwarrel van d’r hoofd. Stil lag
ze, roerloos verwrongen met grauw gezicht en vuil-grijze
flodderharen voor dichte oogluiken gekroest.… Zacht kwam er
hijging in ’r lijf.… openden de kijkers weer, na ’n poosje, glurend door
harenwar op Hassel, die in benauwde streken over z’n baard wreef,
ingekrompen naast de kinderen voor ’t bed stond.
—Hou je bek, snauwde Dirk, zoo wait hain.… is nog nie.. sel d’r wel
mores leere.… Hier Piet.… graip jai d’r poote.… den Ouë leg tog
veur merakel.…
Dirk wilde eerst den Ouë losrukken uit de kramphanden [198]van z’n
moeder, die in woeste dierdrift doorstompte en mokerde. Gerrit
vloekte, al benauwder dat z’m sien had, dat se ’t doar soo inéén sou
uitskreeuwe,—mepte zwakkies terug in ’t donkere ruimtetje, tegen
de magere roggelborst van z’n wijf, soms ’n woester bof, dat ’t
kraakte op ’r karkas. Eindelijk had Dirk ’m losgeworsteld, en in
waggelende strompeling ’m opzij geduwd.
—Si jai hier Ouë.… op die deele is ’t waif sterker aa’s wai..
Toen in loer, greep ie weer de handen plots van z’n moeder, sloeg
haar er mee in ’t gezicht, boog ze achter de schouers half om,
beukte ze dan weer naar d’r mond, dien ie dichtdrukte, plat als
varkenssnuit. Wilde vechtlust driftte in ’m los, om ’t dolle wijf te
temmen. Te hijgen stond ie, en Guurt, bijlichtend, krijschte
gesmoord, doodsbleek d’r fijne hoofd in lichtschijn. Piet had ’r
beenen nù vastgemoerd in zìjn schroefhanden en gekneld onder z’n
zware schonken, die zacht, ademzacht bewogen. Langzaam begon
angstkrisis van vrouw Hassel te zakken. Haar gezicht, los omwoeld
van vuil-grijs haar, waaronder naakte schedel doorschemerde, lag
grauw-paars te kaaksidderen, angstbezweet. Om ’r breed-dunnen
mond schokten zenuwtrekjes, snel achteréén. En lossig zwabbervel
van rimpelwang vlamde nu doorspikkeld van doffe vlekken. Uit ’r
opengescheurden borstrok bruinde ’r smoezelig bloot lijf. Bij elken
òpschok, knakte Dirk ’r met zwel-kracht terug in de peluw, haar
magere armhanden geschroefd in z’n spitklauwen, kruislings over d’r
borst, die hijgde zwaarder van benauwing nog. Zacht likte ze ’t
schuim uit ’r mondhoeken weg. Plots begon ze uit te snikken, doofde
angst-staar in ’r oogen, gebroken van flauw licht, keek ze weer rond,
gewoon-suf als altijd, wist niet, wat ’r met ’r gebeurde.
—Ho.. ho.. nee.. hu.. hu.. so wait hain waa’st nie.… moar.… ik mos
soo noòdig.… en toe’k t’rug kwaam, lai sai wakker.… begon se t’met
te roase en te sloan.
Even had de Ouë geduizeld, bij de onverwachte vraag van Piet. Niet
meer verwachtend dat ze’m vragen zouen, had ie er ook niet meer
over gemijmerd wàt te zeggen. Nou was ’t er sebiet uitgeschoten,
zonder bedenksel.… en heel gewoon klonk t’em alles.…
doodgewoon,.. hij was t’r zelf verbaasd van. Vrouw Hassel hoorde ’r
man spreken buiten ’t bed. Nou merkte ze eerst, dat ie niet naast ’r
lag. Dirk had ’r handen losgelaten, maar bleef toch voor bed staan.
Alleen de Ouë durfde niet goed, bang dat ze’m zou wurgen, [200]als
ie eenmaal stil achter d’r lag. Toen Dirk kwaadaardiger bromde dat ie
d’r nou moar in zou stappen, deed ie raar, ouë Gerrit, net of ie weer
naar achter moest. Maar Dirk vloekte wou niet langer opblijven.
Bang-stil was ouë Gerrit achter z’n vrouw gekropen, in angst dat ze
zich dadelijk op ’m zou smakken als ze ’m zien zou. Maar heel
bedaard bleef ze, ’m loom vragend of ie d’r uit was geweest.
—Wa’ he’k daan.… wa’ doe jai, smeek-stemde ze tegen Guurt, die ’t
laatst voor ’t bed was gebleven.
Aan allen kant lag Wiereland ingesneeuwd. ’t Ouë jaar was als ’n
woest stuk leven voorbijgestoven, met nachtlijk rumoer, gebras, en
zuiplappen-gekrijsch van kerels en meiden, verdierlijkt in jammer.
Kouer bleef ’t in stedeke en Duinkijk, rondom de groote
heerlijkheden van Van Ouwenaar en Duindaal, met z’n witte akkers
en noordpolige blanke weibrokken, zelfs als de zon plots
doorschitteren kwam en blauwe dampen goot over ’t landwit, dat
violet-zwaar verschaduwde in ’t bleek-gouïge licht.
Kees stond te trampelen van voetenkou. Nou zou ie met den vent ’n
hoekkroeg ingeloopen zijn, als ie even bleef passen op z’n karretje,
maar die kwam niet terug. Verrek, dan zou ie ’m smeren.
—Waif aa’s t’met de kerels komme, lá’ hullie wachte.… aa’s hullie d’r
om àcht uur nie benne, goan wai f’nàcht.…
—En sai.… sai mo’ nog bidde.… Dien.… kaik.… f’rdomd se lait al.…
Stommeling! kwam dreigend aanstuiven Ant.… Sien je nou nie daa’
’k brood an ’t moake bin?.…
Ant stond nog aan ’t schuddende tafeltje, onder schijnsel van armoe-
lampje, te grijpen in den vuilen, geel-glazuren pot, kledderde telkens
nat deeg van ’r smoezelige vingers in plaat-ijzeren vorm, met ’r
bemeelde handen, grof-bekluit, persend en plettend. In ’t lage
kamerdeurke bleekte plots hoofd òp van vrouw Reeker van ’t pad.
Guurte bracht ze mee van de straat. Achter ’r lang, rood omdoekt lijf,
kwakte ze donkere hokdeur dicht, sjokte in zucht van uitputting op ’n
krukje neer, bij de schouw.—
Nooit kreeg ze bezoek van vrouw Reeker, omdat die zich [208]altijd,
als vrouw van zuinigen braven kleinpachter, wàt te voornaam voelde
om met Hassels-schorem om te gaan. Want Kees, nie waar, wà was
Kees nou veur ’n snaiboon.… nog g’neens ’n los werkman.… Maar
nou was ze zoo geskrikt op den weg, dat ze buiten ’r fatsoen ging.
—Moar main goeie mins.… wa’ hep je.… je laikt puur f’stuur.… hier
hai je ’n bàkkie.… doar in d’emmer.…
—Je ken hier blaive, soo lank je wil buurvrouw, moar ikke mo’ effe
main booskap.…
—T’met buurvrouw, nou he’k de eer van vrouw Reeker d’r besoek.…
s’ is d’r puur tureluurs van, se hep weer spoke sien op ’t pad.
—Ik seg moar, scherpte ze stil uit, da’ se d’r van bekold is.…
behekst.… se mos puur belese worde.… daa’s nou main weut.… ik
belees hullie allegoar.… Wimpie hep puur behekst weest.… deur
hoar sloerie!.… die suiplap.… die maidejoàger.… [210]
—Wá! se gangetje?.… jai weut niks!.… niks, jai onskuld!.… jai weut
nie wa se segge.… op de ploats.… enne op de polder!.… Moar
nou.… hep ie.… hep ie de burgemeester weer wille dèursteke.…
puur woàr.… en nou hep ie weer àlderlei meissies ongelukkig
moakt.… puur.… en nou hep ie drie doàge se aige dood-soope in de
kroeg.… bai ’t Veertje.…
—Daa’s jokkes, hai hep hier weest.… de heule week.… brak Ant
nijdig af.
—Da lieg jai!.… hou je bek jai onskuld!.… hai beliegt je.… beliegt
je!.… soo’n skaamteloose vuilik!.… hai legt ’t àn mi iedere maid van
fleesch en beene!.… en.… enne iedere nacht hep ie stroopt die
dief.… die ongeluk in je huis!.. allegoar bloedsinte.… aà’s tie d’rais
wà afgaift.… je most sain!.… suilie moste sain fille!.… an rieme
snaie.… soo’n gedrocht!.… soo’n ketter!.…
—Main man?.… nou, die lacht moar.… net aa’s Kloas Grint.…
moar.… moar ’s nachts leg-gie te bibbere van de nood.… [213]