Full Download Algebra 2 Linear Algebra Galois Theory Representation Theory Group Extensions and Schur Multiplier 1st Edition Ramji Lal PDF
Full Download Algebra 2 Linear Algebra Galois Theory Representation Theory Group Extensions and Schur Multiplier 1st Edition Ramji Lal PDF
Full Download Algebra 2 Linear Algebra Galois Theory Representation Theory Group Extensions and Schur Multiplier 1st Edition Ramji Lal PDF
com
https://textbookfull.com/product/algebra-2-
linear-algebra-galois-theory-representation-
theory-group-extensions-and-schur-
multiplier-1st-edition-ramji-lal-2/
textbookfull
More products digital (pdf, epub, mobi) instant
download maybe you interests ...
https://textbookfull.com/product/algebra-2-linear-algebra-galois-
theory-representation-theory-group-extensions-and-schur-
multiplier-1st-edition-ramji-lal-2/
https://textbookfull.com/product/galois-theory-and-advanced-
linear-algebra-1st-edition-rajnikant-sinha/
https://textbookfull.com/product/abstract-algebra-applications-
to-galois-theory-algebraic-geometry-representation-theory-and-
cryptography-second-edition-celine-carstensen-opitz/
https://textbookfull.com/product/algebra-1-groups-rings-fields-
and-arithmetic-1st-edition-ramji-lal/
Linear Algebra Seymour Lipschutz
https://textbookfull.com/product/linear-algebra-seymour-
lipschutz/
https://textbookfull.com/product/basic-linear-algebra-jurgen-
muller/
https://textbookfull.com/product/elementary-linear-algebra-ron-
larson/
https://textbookfull.com/product/linear-algebra-m-thamban-nair/
https://textbookfull.com/product/linear-algebra-g-shanker-rao/
Infosys Science Foundation Series in Mathematical Sciences
Ramji Lal
Algebra 2
Linear Algebra, Galois Theory,
Representation Theory, Group
Extensions and Schur Multiplier
Infosys Science Foundation Series
Series editors
Gopal Prasad, University of Michigan, USA
Irene Fonseca, Mellon College of Science, USA
Editorial Board
Chandrasekhar Khare, University of California, USA
Mahan Mj, Tata Institute of Fundamental Research, Mumbai, India
Manindra Agrawal, Indian Institute of Technology Kanpur, India
S.R.S. Varadhan, Courant Institute of Mathematical Sciences, USA
Weinan E, Princeton University, USA
The Infosys Science Foundation Series in Mathematical Sciences is a sub-series of
The Infosys Science Foundation Series. This sub-series focuses on high quality
content in the domain of mathematical sciences and various disciplines of
mathematics, statistics, bio-mathematics, financial mathematics, applied mathematics,
operations research, applies statistics and computer science. All content published
in the sub-series are written, edited, or vetted by the laureates or jury members of the
Infosys Prize. With the Series, Springer and the Infosys Science Foundation hope to
provide readers with monographs, handbooks, professional books and textbooks
of the highest academic quality on current topics in relevant disciplines. Literature in
this sub-series will appeal to a wide audience of researchers, students, educators,
and professionals across mathematics, applied mathematics, statistics and computer
science disciplines.
Algebra 2
Linear Algebra, Galois Theory,
Representation Theory, Group Extensions
and Schur Multiplier
123
Ramji Lal
Harish Chandra Research Institute (HRI)
Allahabad, Uttar Pradesh
India
Algebra has played a central and decisive role in all branches of mathematics and,
in turn, in all branches of science and engineering. It is not possible for a lecturer to
cover, physically in a classroom, the amount of algebra which a graduate student
(irrespective of the branch of science, engineering, or mathematics in which he
prefers to specialize) needs to master. In addition, there are a variety of students in a
class. Some of them grasp the material very fast and do not need much of assis-
tance. At the same time, there are serious students who can do equally well by
putting a little more effort. They need some more illustrations and also more
exercises to develop their skill and confidence in the subject by solving problems on
their own. Again, it is not possible for a lecturer to do sufficiently many illustrations
and exercises in the classroom for the aforesaid purpose. This is one of the con-
siderations which prompted me to write a series of three volumes on the subject
starting from the undergraduate level to the advance postgraduate level. Each
volume is sufficiently rich with illustrations and examples together with numerous
exercises. These volumes also cater for the need of the talented students with
difficult, challenging, and motivating exercises which were responsible for the
further developments in mathematics. Occasionally, the exercises demonstrating the
applications in different disciplines are also included. The books may also act as a
guide to teachers giving the courses. The researchers working in the field may also
find it useful.
The first volume consists of 11 chapters, which starts with language of mathe-
matics (logic and set theory) and centers around the introduction to basic algebraic
structures, viz., groups, rings, polynomial rings, and fields together with funda-
mentals in arithmetic. This volume serves as a basic text for the first-year course in
algebra at the undergraduate level. Since this is the first introduction to the
abstract-algebraic structures, we proceed rather leisurely in this volume as com-
pared with the other volumes.
The present (second) volume contains 10 chapters which includes the funda-
mentals of linear algebra, structure theory of fields and the Galois theory, repre-
sentation theory of groups, and the theory of group extensions. It is needless to say
that linear algebra is the most applicable branch of mathematics, and it is essential
vii
viii Preface
for students of any discipline to develop expertise in the same. As such, linear
algebra is an integral part of the syllabus at the undergraduate level. Indeed, a very
significant and essential part (Chaps. 1–5) of linear algebra covered in this volume
does not require any background material from Volume 1 of the book except some
amount of set theory. General linear algebra over rings, Galois theory, represen-
tation theory of groups, and the theory of group extensions follow linear algebra,
and indeed these are parts of the syllabus for the second- and the third-year students
of most of the universities. As such, this volume together with the first volume may
serve as a basic text for the first-, second-, and third-year courses in algebra.
The third volume of the book contains 10 chapters, and it can act as a text for
graduate and advance graduate students specializing in mathematics. This includes
commutative algebra, basics in algebraic geometry, semi-simple Lie algebras,
advance representation theory, and Chevalley groups. The table of contents gives an
idea of the subject matter covered in the book.
There is no prerequisite essential for the book except, occasionally, in some
illustrations and exercises, some amount of calculus, geometry, or topology may be
needed. An attempt to follow the logical ordering has been made throughout
the book.
My teacher (Late) Prof. B.L. Sharma, my colleague at the University of
Allahabad, my friend Dr. H.S. Tripathi, my students Prof. R.P. Shukla, Prof.
Shivdatt, Dr. Brajesh Kumar Sharma, Mr. Swapnil Srivastava, Dr. Akhilesh Yadav,
Dr. Vivek Jain, Dr. Vipul Kakkar, and above all, the mathematics students of the
University of Allahabad had always been the motivating force for me to write a
book. Without their continuous insistence, it would have not come in the present
form. I wish to express my warmest thanks to all of them.
Harish-Chandra Research Institute (HRI), Allahabad, has always been a great
source for me to learn more and more mathematics. I wish to express my deep sense
of appreciation and thanks to HRI for providing me all infrastructural facilities to
write these volumes.
Last but not least, I wish to express my thanks to my wife Veena Srivastava who
had always been helpful in this endeavor.
In spite of all care, some mistakes and misprints might have crept in and escaped
my attention. I shall be grateful to any such attention. Criticisms and suggestions for
the improvement of the book will be appreciated and gratefully acknowledged.
1 Vector Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.1 Concept of a Field . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Concept of a Vector Space (Linear Space) . . . . . . . . . . . . . . . . . 7
1.3 Subspaces. . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 11
1.4 Basis and Dimension . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
1.5 Direct Sum of Vector Spaces, Quotient of a Vector Space . . . . 23
2 Matrices and Linear Equations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
2.1 Matrices and Their Algebra . . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
2.2 Types of Matrices . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 35
2.3 System of Linear Equations . . . . . . . . . . . . . . . . . . . . . . . . . . . . 40
2.4 Gauss Elimination, Elementary Operations, Rank,
and Nullity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 43
2.5 LU Factorization . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 58
2.6 Equivalence of Matrices, Normal Form . . . . . . . . . . . . . . . . . . . 60
2.7 Congruent Reduction of Symmetric Matrices . . . . . . . . . . . . . . . 65
3 Linear Transformations . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
3.1 Definition and Examples . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 73
3.2 Isomorphism Theorems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
3.3 Space of Linear Transformations, Dual Spaces . . . . . . . . . . . . . 79
3.4 Rank and Nullity . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 83
3.5 Matrix Representations of Linear Transformations . . . . . . . . . . . 85
3.6 Effect of Change of Bases on Matrix Representation . . . . . . . . . 88
4 Inner Product Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 97
4.1 Definition, Examples, and Basic Properties . . . . . . . . . . . . . . . . 97
4.2 Gram–Schmidt Process . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 107
4.3 Orthogonal Projection, Shortest Distance . . . . . . . . . . . . . . . . . . 112
4.4 Isometries and Rigid Motions . . . . . . . . . . . . . . . . . . . . . . . . . . 120
ix
x Contents
xi
Notations from Algebra 1
xiii
xiv Notations from Algebra 1
Sum of divisor function, p. 256
a Legendre symbol, p. 280
p
Stab(G, X) Stabilizer of an action of G on X, p. 295
Gx Isotropy subgroup of an action of G at x, p. 295
XG Fixed point set of an action of G on X, p. 296
Zn(G) nth term of the upper central series of G, p. 351
ΦðGÞ The Frattini subgroup of G, p. 355
Notations from Algebra 2
xvii
xviii Notations from Algebra 2
This chapter is devoted to the structure theory of vector spaces over arbitrary fields.
In essence, a vector space is a structure in which we can perform all basic operations
of vector algebra, can talk of lines, planes, and linear equations. The basic motivating
examples on which we shall dwell are the Euclidean 3-space R3 over R in which
we live, the Minkowski Space R4 of events (in which the first three coordinates
represent the place and the fourth coordinate represents the time of the occurrence
of the event), and also the space of matrices.
Rings and fields have been introduced and studied in Algebra 1. However, to make the
linear algebra part (Chaps. 1–5) of this volume independent of Algebra 1, we recall,
quickly, the concept of a field and its basic properties. Field is an algebraic structure
in which we can perform all arithmetical operations, viz., addition, subtraction, mul-
tiplication, and division by nonzero members. The basic motivating examples are the
structure Q of rational numbers, the structure R of real numbers, and the structure
C of complex numbers with usual operations. The precise definition of a field is as
follows:
Definition 1.1.1 A Field is a triple (F, +, ·), where F is a set, + and · are two
internal binary operations, called the addition and the multiplication on F, such that
the following hold:
1. (F, +) is an abelian Group in the following sense:
(i) The operation + is associative in the sense that
(a + b) + c = a + (b + c) for all a, b, c ∈ F.
(ii) The operation + is commutative in the sense that
(a + b) = (b + a) for all a, b ∈ F.
Remark 1.1.5 There is nothing special about 2 in the above example, indeed, we can
take any prime, or for that matter any rational number in place of 2 which is not a
square of a rational number.
So far all the examples of fields are infinite. Now, we give an example of a finite
field.
Let p be a positive prime integer. Consider the set Zp = {1, 2, . . . , p − 1} of
residue classes modulo a prime p. Clearly, a = r, where r is the remainder obtained
when a is divided by p. The usual addition ⊕ modulo p, and the multiplication
modulo p are given by
i ⊕ j = i + j, i, j ∈ Z,
and
i j = i · j, i, j ∈ Z
4 1 Vector Spaces
Proof Clearly, 1 is the identity with respect to . We verify only the postulate 4(ii)
in the definition of a field. The rest of the postulates are almost evident, and can be
verified easily. In fact, we give an algorithm (using Euclidean Algorithm) to find the
multiplicative inverse of a nonzero element i ∈ Zp . Let i ∈ Zp − {0}. Then p does
not divide i. Since p is prime, the greatest common divisor of i and p is 1. Using the
Euclidean algorithm, we can find integers b and c such that
1 = i · b + p · c.
The above proof is algorithmic and gives an algorithm to find the multiplicative
inverse of nonzero elements in Zp .
Definition 1.1.7 Let (F, +, ·) be a field. A subset L of F is called a subfield of F
if the following hold:
(i) 0 ∈ L.
(ii) If a, b ∈ L, then a + b ∈ L and a · b ∈ L.
(iii) 1 ∈ L.
(iv) For all a ∈ L, −a ∈ L.
(v) For all a ∈ L − {0}, a−1 ∈ L.
Thus, a subfield L of a field F is also a field at its own right with respect to the
induced operations. The field F is a subfield of itself. This subfield is called the
improper subfield of F. Other √ subfields are called proper subfields. The set Q of
rational numbers, the set Q( 2) described in Example 1.1.4, are proper subfields of
the field R of real numbers. The field R of real numbers is a subfield of the field C
of complex numbers.
Proposition 1.1.8 The field Q of rational numbers, and the field Zp have no proper
subfields.
Proof We first show that Q has no proper subfields. Let L be a subfield of Q. Then
by the Definition 1.1.7(iii), 1 ∈ L. Again, by (ii), n = 1 + 1 +· · · + 1 belongs to
n
L for all natural numbers n. Thus, by (iv), all integers are in L. By (v), n1 ∈ L for
all nonzero integers n. By (ii), mn ∈ L for all integers m, n; n = 0. This shows that
L = Q.
1.1 Concept of a Field 5
We shall see that, essentially, these are the only fields which have no proper
subfields. Such fields are called prime fields.
Homomorphisms and Isomorphisms Between Fields
Definition 1.1.9 Let F1 and F2 be fields. A map f from F1 to F2 is called a
fieldhomomorphism if the following conditions hold:
(i) f (a + b) = f (a) + f (b) for all a, b ∈ F1 (note that + in the LHS is the
addition of F1 , and that in RHS is the addition of F2 ).
(ii) f (a · b) = f (a) · f (b) for all a, b ∈ F1 (again · in the LHS is the multiplication
of F1 , and that in RHS is the multiplication of F2 ).
(iii) f (1) = 1, where 1 in the LHS denotes the multiplicative identity of F1 , and 1
in RHS denotes the multiplicative identity of F2 .
A bijective homomorphism is called an isomorphism. A field F1 is said to be
isomorphic a field F2 if there is an isomorphism from F1 to F2 .
We do not distinguish isomorphic fields.
Proposition 1.1.10 Let f be a homomorphism from a field F1 to a field F2 . Then,
the following hold.
(i) f (0) = 0, where 0 in the LHS is the zero of F1 , and 0 in the RHS is the zero of
F2 .
(ii) f (−a) = −f (a) for all a ∈ F1 .
(iii) f (na) = nf (a) for all a ∈ F1 , and for all integer n.
(iv) f (an ) = (f (a))n for all a ∈ F1 − {0}, and for all integer n.
(v) f is injective, and the image of F1 under f is a subfield of F2 which is isomorphic
to F1 .
+ 0 1 α α2
0 0 1 α α2
1 1 0 α2 α
α α α2 0 1
α2 α2 α 1 0
· 0 1 α α2
0 0 0 0 0
1 0 1 α α2
α 0 α α2 1
α2 0 α2 1 α
1.1.6 Find the multiplicative inverse of 20 in Z257 , and also find the solution of
10x ⊕ 2 = 3.
1.1.7 Write a program in C++ language to check if a natural number n is prime, and
if so to find the multiplicative inverse of a nonzero element m in Zn . Find the output
4
with n = 22 + 1, and m = 641.
Consider the space (called the Euclidean 3-space) in which we live. If we fix a point
(place) in the three space as origin together with three mutually perpendicular lines
(directions) passing through the origin as the axes of reference, and also a segment of
line as a unit of length, then any point in the 3-space determines, and it is determined
uniquely by an ordered triple (α, β, γ) of real numbers.
8 1 Vector Spaces
P (α, β, γ)
O
Y
X
Thus, with the given choice of the origin and the axes as above, the space in which
we live can be represented faithfully by
R3 = {x = (x1 , x2 , x3 ) | x1 , x2 , x3 ∈ R},
and it is called the Euclidean 3-space. The members of R3 are called the usual 3-
vectors. It is also evident that the physical quantities which have magnitudes as well
as directions (e.g., force, velocity, or displacement) can be represented by vectors.
More generally, for a fixed natural number n,
Rn = {x = (x1 , x2 , . . . , xn ) | x1 , x2 , . . . , xn ∈ R}
is called the Euclidean n-space, and the members of the Euclidean n-space are called
the Euclidean n-vectors. We term x1 , x2 , . . . , xn as components, or coordinates of
the vector x = (x1 , x2 , . . . , xn ). Thus, R2 represents the Euclidean plane, and R4
represents the Minkowski space of events in which the first three coordinates rep-
resent the place, and the fourth coordinate represents the time of the occurrence of
the event. R1 is identified with R. By convention, R0 = {0} is a single point. We have
the addition + in Rn , called the addition of vectors, and it is defined by
x + y = (x1 + y1 , x2 + y2 , . . . , xn + yn ),
Remark 1.2.1 The addition + of vectors in 3-space R3 is the usual addition of vectors,
which obeys the parallelogram law of addition.
for all x, y, z in V .
2. + is commutative, i.e.,
x+y = y+x
for all x, y in V .
3. We have a unique vector 0 in V , called the null vector, and it is such that
x+0 = x = 0+x
for all x in V .
4. For each x in V , we have a unique vector −x in V , called the negative of x, and
it is such that
x + (−x) = 0 = (−x) + x.
α · (x + y) = α · x + α · y
(α + β) · x = α · x + β · x
Example 1.2.3 Let F be a field, and n be a natural number. Consider the set
V = F n = {x = (x1 , x2 , . . . , xn ) | x1 , x2 , . . . , xn ∈ F}
10 1 Vector Spaces
of row vectors with n columns, and with entries in F. We have the addition + in F n
defined by
x + y = (x1 + y1 , x2 + y2 , . . . , xn + yn ),
The field properties of F ensures that the triple (F n , + ·) is a vector space over F.
The zero of the vector space is the zero row 0 = (0, 0, . . . , 0), and the negative of
x = (x1 , x2 , . . . , xn ) is −x = (−x1 , −x2 , . . . , −xn ). We can also treat the members
of F n as column vectors.
Example 1.2.4 Let L be a subfield of a field F. Consider (F, +, ·), where + is the
addition of the field F, and · is the restriction of the multiplication in F to L × F.
Then it is evident that (F, +, ·) is a vector space over L. Thus, every field can be
considered as vector spaces over its subfields.
Example 1.2.5 Let C[0, 1] denote the set of all real valued continuous functions on
the closed interval [0, 1]. Since sum of any two continuous functions is a continuous
function, we have an addition on C[0, 1] with respect to which it is an abelian group.
Define the external multiplication · by (a · f )(x) = a · f (x). Then C[0, 1] is a vector
space over the field R of reals. Note that the set D[0, 1] of differentiable functions is
also a vector space over the field R of reals with respect to the addition of functions,
and multiplication by scalars as defined above.
Example 1.2.6 Let Pn (F) denote the set of all polynomials of degree at most n over
a field F. Then Pn (F) is an abelian group with respect to the addition of polynomials.
Further, if a ∈ F and f (X) ∈ Pn (F), then af (X) ∈ Pn (F). Thus, Pn (F) is also a vector
space over F.
Proposition 1.2.7 Let V be a vector space over a field F. Then the following hold:
(i) The cancellation law holds in (V, +) in the sense that (x + y = x +
z) implies y = z (In turn, (y + x = z + x) implies y = z).
(ii) 0 · x = 0, where 0 in the left side is the 0 of F, 0 on right side is that of V , and
x ∈ V.
(iii) α · 0 = 0, where both 0 are that of V , and α ∈ F.
(iv) (−α) · x = −(α · x) for all α ∈ F, and x ∈ V . In particular, (−1) · x = −x.
(v) (α · x = 0) implies that (α = 0 or x = 0).
0 = 0 · x.
(iii) 0 + α · 0 = α · 0 = α · (0 + 0) = α · 0 + α · 0. By the cancellation in
(V, +), 0 = α · 0.
(iv) 0 = 0 · x = (−α + α) · x = (−α) · x + α · x. This shows that (−α) · x =
−(α · x)
(v) Suppose that (α · x = 0), and α = 0. Then, x = 1 · x = (α−1 α) · x = α−1 ·
(α · x) = α−1 · 0 = 0.
1.3 Subspaces
Thus, a subspace is also a vector space over the same field at its own right.
Proposition 1.3.2 Let V be a vector space over a field F. Then a nonempty subset
W of V is a subspace if and only if ax + by ∈ W for all a, b ∈ F, and x, y ∈ V .
Example 1.3.3 Let V be a vector space over a field F. Then V is clearly a subspace of
V , and it is called an improper subspace of V . The singleton {0} is also a subspace
of V , and it is called the trivial subspace of V . Other subspaces of V are called
Proper subspaces of V .
Example 1.3.5 (Subspaces of R3 over R) As in the above example, lines and planes
passing through origin are proper subspaces of R3 over R. Indeed, they are the only
proper subspaces.
Proposition
1.3.7 Union of subspaces need not be a subspace. Indeed, the union
W1 W2 of two subspaces is a subspace if and only if W1 ⊆ W2 or W2 ⊆ W1 .
Proof If W1 ⊆ W2 , then W1 W2 = W2 a subspace. Similarly, if W2 ⊆ W1 , then
also the union is a subspace. Conversely, suppose that W1 W2 is a subspace and W1
is not a subset ofW2 . Then there is an element x ∈W1 which is not in W2 . Let y ∈ W2 .
Then, since W1 W2 is a subspace, x + y ∈ W1 W2 . Now x + y does not belong to
W2 , for otherwise x = (x + y) − y will be in W2 , a contradiction to the supposition.
Hence x + y ∈ W1 . Since x ∈ W1 and W1 is subspace, y = −x + (x + y) belongs
to W1 . This shows that W2 ⊆ W1 .
Proof Let {Wα |α ∈ } be a chain ofsubspaces of a vector space V over a field
F. Clearly, 0 ∈ α∈ Wα . Let x, y ∈ α∈ Wα , and α, β ∈ F. Then x ∈ Wα , and
y ∈ Wβ for some α, β ∈ F. Since the family is a chain, Wα ⊆ Wβ , or Wβ ⊆ Wα .
1.3 Subspaces 13
x = a1 x1 + a2 x2 + · · · + an xn
ax + by = a1 x1 + a2 x2 + · · · an xn + b1 y1 + b2 y2 + · · · bm ym ,
Then, after the baby had been tucked away in his soft nest, they
all sat down close to the fire, while Mr. Bushy Tail, taking Frisky on
his knee, told them of all his wonderful adventures. Of Mr. Quilly Ant-
Eater and the Ring-Tailed Snorter; of that surprising slide down Mrs.
Mole’s chimney, and of the terrible North wind.
And there we will leave them, a happy and contented little family.
Composition, Presswork and Binding
L. H. JENKINS
Richmond, Virginia
Transcriber’s Notes
Illustrations have been moved so they do not break up the paragraphs.
Obvious typographical errors and punctuation errors have been corrected after
careful comparison with other occurrences within the text and consultation of
external sources. Except for those changes noted below, all misspellings in the
text, and inconsistent or archaic usage, have been retained.
Updated editions will replace the previous one—the old editions will
be renamed.
1.D. The copyright laws of the place where you are located also
govern what you can do with this work. Copyright laws in most
countries are in a constant state of change. If you are outside the
United States, check the laws of your country in addition to the terms
of this agreement before downloading, copying, displaying,
performing, distributing or creating derivative works based on this
work or any other Project Gutenberg™ work. The Foundation makes
no representations concerning the copyright status of any work in
any country other than the United States.
• You pay a royalty fee of 20% of the gross profits you derive from
the use of Project Gutenberg™ works calculated using the
method you already use to calculate your applicable taxes. The
fee is owed to the owner of the Project Gutenberg™ trademark,
but he has agreed to donate royalties under this paragraph to
the Project Gutenberg Literary Archive Foundation. Royalty
payments must be paid within 60 days following each date on
which you prepare (or are legally required to prepare) your
periodic tax returns. Royalty payments should be clearly marked
as such and sent to the Project Gutenberg Literary Archive
Foundation at the address specified in Section 4, “Information
about donations to the Project Gutenberg Literary Archive
Foundation.”
• You comply with all other terms of this agreement for free
distribution of Project Gutenberg™ works.
1.F.
1.F.4. Except for the limited right of replacement or refund set forth in
paragraph 1.F.3, this work is provided to you ‘AS-IS’, WITH NO
OTHER WARRANTIES OF ANY KIND, EXPRESS OR IMPLIED,
INCLUDING BUT NOT LIMITED TO WARRANTIES OF
MERCHANTABILITY OR FITNESS FOR ANY PURPOSE.
Please check the Project Gutenberg web pages for current donation
methods and addresses. Donations are accepted in a number of
other ways including checks, online payments and credit card
donations. To donate, please visit: www.gutenberg.org/donate.
Most people start at our website which has the main PG search
facility: www.gutenberg.org.