Non-Euclidean Geometry

Non-Euclidean Geometry

eBook - 1998
Rate this:
The MAA is delighted to be the publisher of the sixth edition of this book, updated with a new section 15.9 on the author's useful concept of inversive distance. Throughout most of this book, non-Euclidean geometries in spaces of two or three dimensions are treated as specializations of real projective geometry in terms of a simple set of axioms concerning points, lines, planes, incidence, order and continuity, with no mention of the measurement of distances or angles. This synthetic development is followed by the introduction of homogeneous coordinates, beginning with Von Staudt's idea of regarding points as entities that can be added or multiplied. Transformations that preserve incidence are called colineations. They lead in a natural way to elliptic isometries or "congruent transformations". Following a recommendation by Bertrand Russell, continuity is described in terms of order. Elliptic and hyperbolic geometries are derived from real projective geometry by specializing an elliptic or hyperbolic polarity which transforms points into lines (in two dimensions) or planes (in three dimensions) and vice versa. This treatment can be enjoyed by anyone who is familiar with algebra up to the elements of group theory. - Publisher.
Publisher: Washington, D.C. :, Mathematical Association of America,, [1998]
Edition: Sixth edition
Copyright Date: Ă1998
ISBN: 9781614445166
1614445168
9780883855225
0883855224
Characteristics: 1 online resource (xviii, 336 pages) : illustrations

Opinion

From the critics


Community Activity

Comment

Add a Comment

There are no comments for this title yet.

Age Suitability

Add Age Suitability

There are no age suitabilities for this title yet.

Summary

Add a Summary

There are no summaries for this title yet.

Notices

Add Notices

There are no notices for this title yet.

Quotes

Add a Quote

There are no quotes for this title yet.

Explore Further

Recommendations

Subject Headings

  Loading...

Find it at WPL

  Loading...
[]
[]
To Top