|
|
| (One intermediate revision by one other user not shown) |
| Line 1: |
Line 1: |
| '''Elliptic geometry''' is a [[non-Euclidean geometry]], in which, given a [[line (mathematics)|line]] ''L'' and a [[Point (geometry)|point]] ''p'' outside ''L'', there exists no line [[Parallel (geometry)|parallel]] to ''L'' passing through ''p''. Elliptic geometry, like [[hyperbolic geometry]], violates Euclid's [[parallel postulate]], which can be interpreted as asserting that there is [[Playfair's axiom|exactly one line parallel to ''L'' passing through ''p'']]. In elliptic geometry, there are no parallel lines at all. Elliptic geometry has a variety of properties that differ from those of classical Euclidean plane geometry. For example, the sum of the [[angle]]s of any [[triangle]] is always greater than 180°.
| | Have we been thinking "how do I accelerate my computer" lately? Well possibilities are if you are reading this article; then you are experiencing 1 of various computer issues that thousands of people discover that they face on a regular basis.<br><br>Another answer would be to supply the computer program with a brand-new msvcr71 file. Often, once the file has been corrupted or damaged, it usually no longer be capable to function like it did before thus it's only all-natural to replace the file. Simply download another msvcr71.dll file from the internet. Often, the file comes in a zip format. Extract the files within the zip folder plus region them accordingly inside this location: C:\Windows\System32. Afterward, re-register the file. Click Start and then choose Run. Once the Run window appears, kind "cmd". Press Enter plus then sort "regsvr32 -u msvcr71.dll" followed by "regsvr32 msvcr71.dll". Press Enter again plus the file ought to be registered accordingly.<br><br>With RegCure to improve the start plus shut down of your computer. The program shows the scan progress plus we shouldn't worry where it's functioning at that time. It shows you exactly what arises. Dynamic link library section of the registry may result severe application failures. RegCure restores and repairs the registry plus keeps you out of DLL. RegCure is able to create individual corrections, thus it can works for your requires.<br><br>It is normal that the imm32.dll error is caused because of a mis-deletion activity. If you cannot discover the imm32.dll anywhere on a computer, there is not any question which it should be mis-deleted whenever uninstalling programs or other unneeded files. Hence, you are able to directly deal it from different programs or download it from a secure internet and then put it on a computer.<br><br>There are a lot of [http://bestregistrycleanerfix.com/system-mechanic system mechanic professional] s. Which 1 is the best is not effortless to be determined. But when you like to stand out 1 amidst the multitude you must consider some items. These are features, scanning speed time, total errors detected, total errors repaired, tech support, Boot time performance and price. According to these items Top Registry Cleaner for 2010 is RegCure.<br><br>The first thing we should do is to reinstall any program which shows the error. It's typical for several computers to have specific programs which need this DLL to show the error whenever you try and load it up. If you see a certain program show the error, you need to first uninstall that system, restart your PC and then resinstall the system again. This could substitute the damaged ac1st16.dll file plus cure the error.<br><br>Maybe you are asking how come these windows XP error messages appear. Well, for we to be capable to know the fix, you must initially understand where those mistakes come from. There is this software called registry. A registry is software that stores everything on a PC from a general configuration, setting, info, and logs of activities from installing to UN-installing, saving to deleting, along with a lot more alterations you do inside a system pass from it and gets 'tagged' plus saved because a easy file for recovery purposes. Imagine it as a big recorder, a registrar, of all a records in the PC.<br><br>Ally Wood is a expert software reviewer and has worked inside CNET. Then she is working for her own review software firm to give feedback to the software creator plus has done deep test inside registry cleaner software. After reviewing the most popular registry cleaner, she has written complete review on a review site for you which is accessed for free. |
| | |
| ==Definition==
| |
| Elliptic space is an [[abstract object]] and thus an imaginative challenge. The elliptic plane is the easiest instance and is based on [[spherical geometry]]. The abstraction involves considering a pair of [[antipodal points]] on the sphere to be a single point in the elliptic plane. The breakdown of this identification of two points into one is the premise of [[H. G. Wells]] story "The Remarkable Case of Davidson’s Eyes" (1895). This identification procedure also generates the [[real projective plane]], but the elliptic plane is considered to include the structures of [[spherical geometry]] that are confined to a single hemisphere. Three-dimensional elliptic geometry is called [[#Elliptic space|elliptic space]]. This article also considers [[#Higher-dimensional spaces|higher-dimensional elliptic spaces]].
| |
| | |
| As explained by [[H. S. M. Coxeter]]
| |
| :The name "elliptic" is possibly misleading. It does not imply any direct connection with the curve called an ellipse, but only a rather far-fetched analogy. A central conic is called an ellipse or a hyperbola according as it has no asymptote or two [[asymptote]]s. Analogously, a non-Euclidean plane is said to be elliptic or hyperbolic according as each of its [[line (geometry)|line]]s contains no [[point at infinity]] or two points at infinity.<ref>Coxeter 1969 94</ref>
| |
| | |
| ==Two dimensions==
| |
| | |
| ===The spherical model===
| |
| [[Image:Triangles (spherical geometry).jpg|thumb|350px|On a sphere, the sum of the angles of a triangle is not equal to 180°. The surface of a sphere is not a Euclidean space, but locally the laws of the Euclidean geometry are good approximations. In a small triangle on the face of the earth, the sum of the angles is very nearly 180°.]]
| |
| A simple way to picture elliptic geometry is to look at a globe. Neighboring lines of longitude appear to be parallel at the equator, yet they intersect at the poles.
| |
| | |
| More precisely, the surface of a sphere is a model of elliptic geometry if lines are modeled by [[great circle]]s, and points at each other's [[antipodes]] are considered to be the same point. With this identification of antipodal points, the model satisfies Euclid's [[Euclidean geometry#Axiomatic treatment|first postulate]], which states that two points uniquely determine a line. If the antipodal points were considered to be distinct, as in spherical geometry, then uniqueness would be violated, e.g., the lines of longitude on the Earth's surface all pass through both the north pole and the south pole.
| |
| | |
| Although models such as the spherical model are useful for visualization and for proof of the theory's self-consistency, neither a model nor an embedding in a higher-dimensional space is logically necessary. For example, Einstein's theory of [[general relativity]] has static solutions in which space containing a gravitational field is (locally) described by three-dimensional elliptic geometry, but the theory does not posit the existence of a fourth spatial dimension, or even suggest any way in which the existence of a higher-dimensional space could be detected. (This is unrelated to the treatment of time as a fourth dimension in relativity.) Metaphorically, we can imagine geometers who are like ants living on the surface of a sphere. Even if the ants are unable to move off the surface, they can still construct lines and verify that parallels do not exist. The existence of a third dimension is irrelevant to the ants' ability to do geometry, and its existence is neither verifiable nor necessary from their point of view. Another way of putting this is that the language of the theory's axioms is incapable of expressing the distinction between one model and another.
| |
| | |
| ===Comparison with Euclidean geometry===
| |
| In Euclidean geometry, a figure can be scaled up or scaled down indefinitely, and the resulting figures are similar, i.e., they have the same angles and the same internal proportions. In elliptic geometry this is not the case. For example, in the spherical model we can see that the distance between any two points must be strictly less than half the circumference of the sphere (because antipodal points are identified). A line segment therefore cannot be scaled up indefinitely. A geometer measuring the geometrical properties of the space he or she inhabits can detect, via measurements, that there is a certain distance scale that is a property of the space. On scales much smaller than this one, the space is approximately flat, geometry is approximately Euclidean, and figures can be scaled up and down while remaining approximately similar.
| |
| | |
| A great deal of Euclidean geometry carries over directly to elliptic geometry. For example, the first and fourth of Euclid's postulates, that there is a unique line between any two points and that all right angles are equal, hold in elliptic geometry. Postulate 3, that one can construct a circle with any given center and radius, fails if "any radius" is taken to mean "any real number", but holds if it is taken to mean "the length of any given line segment". Therefore any result in Euclidean geometry that follows from these three postulates will hold in elliptic geometry, such as proposition 1 from book I of the ''Elements'', which states that given any line segment, an equilateral triangle can be constructed with the segment as its base.
| |
| | |
| Elliptic geometry is also like Euclidean geometry in that space is continuous, homogeneous, isotropic, and without boundaries. Isotropy is guaranteed by the fourth postulate, that all right angles are equal. For an example of homogeneity, note that Euclid's proposition I.1 implies that the same equilateral triangle can be constructed at any location, not just in locations that are special in some way. The lack of boundaries follows from the second postulate, extensibility of a line segment.
| |
| | |
| One way in which elliptic geometry differs from Euclidean geometry is that the sum of the interior angles of a triangle is greater than 180 degrees. In the spherical model, for example, a triangle can be constructed with vertices at the locations where the three positive Cartesian coordinate axes intersect the sphere, and all three of its internal angles are 90 degrees, summing to 270 degrees. For sufficiently small triangles, the excess over 180 degrees can be made arbitrarily small.
| |
| | |
| The [[Pythagorean theorem]] fails in elliptic geometry. In the 90°–90°–90° triangle described above, all three sides have the same length, and consequently do not satisfy <math>a^2+b^2=c^2</math>. The Pythagorean result is recovered in the limit of small triangles.
| |
| | |
| The ratio of a circle's circumference to its area is smaller than in Euclidean geometry. In general, area and volume do not scale as the second and third powers of linear dimensions.
| |
| | |
| ==Elliptic space==
| |
| {{see also|Rotations in 4-dimensional Euclidean space}}
| |
| The three-dimensional elliptic geometry makes use of the [[3-sphere]] {{math|S<sup>3</sup>}}, and these points are well-accessed with the [[versor]]s in the theory of [[quaternion]]s.
| |
| A versor is a quaternion of norm one, which must necessarily have the form
| |
| :<math>e^{ar} = \cos a + r \sin a , \quad r^2 = -1.</math>
| |
| The [[origin (mathematics)|origin]] corresponds to {{math|1=''a'' = 0}} and is the identity of the [[topological group]] consisting of versors. With {{mvar|r}} fixed, the versors
| |
| :<math>e^{ar}, \quad 0 \le a < \pi</math>
| |
| form an ''elliptic line''. The distance from <math>e^{ar}</math> to 1 is {{math|''a''}}. For an arbitrary versor {{mvar|''u''}}, the distance will be that θ for which {{math|1=cos θ = (''u'' + ''u''<sup>∗</sup>)/2}} since this is the formula for the scalar part of any quaternion.
| |
| | |
| An ''elliptic motion'' is described by the quaternion mapping
| |
| :<math>q \mapsto u q v,</math> where {{mvar|u}} and {{mvar|v}} are fixed versors.
| |
| Distances between points are the same as between image points of an elliptic motion. In the case that {{mvar|u}} and {{mvar|v}} are quaternion conjugates of one another, the motion is a [[quaternions and spatial rotation|spatial rotation]], and their vector part is the axis of rotation. In the case {{math|1=''u'' = 1}} the elliptic motion is called a [[left and right (algebra)|right]] [[isoclinic rotation|''Clifford translation'']], or a ''parataxy''. The case {{math|1=''v'' = 1}} corresponds to left Clifford translation.
| |
| | |
| ''Elliptic lines'' through versor {{mvar|u}} may be of the form
| |
| :<math>\lbrace u e^{ar} : 0 \le a < \pi \rbrace</math> or <math>\lbrace e^{ar}u : 0 \le a < \pi \rbrace</math> for a fixed {{mvar|r}}. | |
| They are the right and left Clifford translations of {{mvar|u}} along an elliptic line through 1.
| |
| The ''elliptic space'' is formed by identifying antipodal points on {{math|S<sup>3</sup>}}.<ref>Coxeter 1950 Synopsis of Lemaitre</ref>
| |
| | |
| Elliptic space has special structures called [[Clifford parallel]]s and [[Clifford parallel#Clifford surfaces|Clifford surfaces]].
| |
| | |
| ==Higher-dimensional spaces==
| |
| | |
| ===Hyperspherical model===
| |
| The hyperspherical model is the generalization of the spherical model to higher dimensions. The points of ''n''-dimensional elliptic space are the pairs of unit vectors {{math|(''x'', −''x'')}} in '''R'''<sup>''n''+1</sup>, that is, pairs of opposite points on the surface of the unit ball in {{nowrap|(''n'' + 1)}}-dimensional space (the ''n''-dimensional hypersphere). Lines in this model are [[great circle]]s, i.e., intersections of the hypersphere with flat hypersurfaces of dimension ''n'' passing through the origin.
| |
| | |
| ===Projective elliptic geometry===
| |
| In the projective model of elliptic geometry, the points of ''n''-dimensional [[real projective space]] are used as points of the model. This models an abstract elliptic geometry that is also known as [[projective geometry]].
| |
| | |
| The points of ''n''-dimensional projective space can be identified with lines through the origin in {{nowrap|(''n'' + 1)}}-dimensional space, and can be represented non-uniquely by nonzero vectors in '''R'''<sup>''n''+1</sup>, with the understanding that {{mvar|u}} and {{math|λ''u''}}, for any non-zero scalar {{math|λ}}, represent the same point. Distance is defined using the metric
| |
| :<math>d(u, v) = \arccos \left(\frac{|u \cdot v|}{\|u\|\ \|v\|}\right);</math>
| |
| that is, the distance between two points is the angle between their corresponding lines in '''R'''<sup>''n''+1</sup>. The distance formula is homogeneous in each variable, with {{math|1=''d''(λ''u'', μ''v'') = ''d''(''u'', ''v'')}} if {{math|λ}} and {{math|μ}} are non-zero scalars, so it does define a distance on the points of projective space.
| |
| | |
| A notable property of the projective elliptic geometry is that for even dimensions, such as the plane, the geometry is non-[[orientable]]. It erases the distinction between clockwise and counterclockwise rotation by identifying them.
| |
| | |
| ===Stereographic model===
| |
| A model representing the same space as the hyperspherical model can be obtained by means of [[stereographic projection]]. Let '''E'''<sup>''n''</sup> represent {{nowrap|'''R'''<sup>''n''</sup> ∪ {∞},}} that is, {{mvar|n}}-dimensional real space extended by a single point at infinity. We may define a metric, the ''chordal metric'', on
| |
| '''E'''<sup>''n''</sup> by
| |
| :<math>\delta(u, v)=\frac{2 \|u-v\|}{\sqrt{(1+\|u\|^2)(1+\|v\|^2)}}</math>
| |
| where {{mvar|u}} and {{mvar|v}} are any two vectors in '''R'''<sup>''n''</sup> and <math>\|\cdot\|</math> is the usual Euclidean norm. We also define | |
| :<math>\delta(u, \infty)=\delta(\infty, u) = \frac{2}{\sqrt{1+\|u\|^2}}.</math>
| |
| The result is a metric space on '''E'''<sup>''n''</sup>, which represents the distance along a chord of the corresponding points on the hyperspherical model, to which it maps bijectively by stereographic projection. We obtain a model of spherical geometry if we use the metric
| |
| :<math>d(u, v) = 2 \arcsin\left(\frac{\delta(u,v)}{2}\right).</math>
| |
| Elliptic geometry is obtained from this by identifying the points {{mvar|u}} and {{math|−''u''}}, and taking the distance from {{mvar|v}} to this pair to be the minimum of the distances from {{mvar|v}} to each of these two points.
| |
| | |
| ==Self-consistency==
| |
| Because spherical elliptic geometry can be modeled as, for example, a spherical subspace of a Euclidean space, it follows that if Euclidean geometry is self-consistent, so is spherical elliptic geometry. Therefore it is not possible to prove the parallel postulate based on the other four postulates of Euclidean geometry.
| |
| | |
| [[Tarski]] proved that elementary Euclidean geometry is complete in a certain [[Decidability (logic)|sense]]: there is an algorithm which, for every proposition, can show it to be either true or false.<ref>Tarski (1951)</ref> (This does not violate [[Gödel's incompleteness theorems|Gödel's theorem]], because Euclidean geometry cannot describe a sufficient amount of [[Peano arithmetic|arithmetic]] for the theorem to apply.<ref>Franzén 2005, pp. 25–26.</ref>) It therefore follows that elementary elliptic geometry is also self-consistent and complete.
| |
| | |
| ==See also==
| |
| * [[Elliptic tiling]]
| |
| * [[Spherical tiling]]
| |
| | |
| ==Notes==
| |
| <references/>
| |
| | |
| ==References==
| |
| * [[Rafael Artzy]] (1965) ''Linear Geometry'', Chapter 3–8 Quaternions and Elliptic Three-space, pp. 186–94,[[Addison-Wesley]].
| |
| * Alan F. Beardon, ''The Geometry of Discrete Groups'', Springer-Verlag, 1983
| |
| * [[H. S. M. Coxeter]] (1942) ''Non-Euclidean Geometry'', chapters 5, 6, & 7: Elliptic geometry in 1, 2, & 3 dimensions, [[University of Toronto Press]], reissued 1998 by [[Mathematical Association of America]], ISBN 0-88385-522-4 .
| |
| * H.S.M. Coxeter (1969) ''Introduction to Geometry'', §6.9 The Elliptic Plane, pp. 92–95. [[John Wiley & Sons]].
| |
| * {{springer|title=Elliptic geometry|id=p/e035480}}
| |
| *[[Felix Klein]] (1871) "On the so-called noneuclidean geometry" [[Mathematische Annalen]] 4:573–625, translated and introduced in [[John Stillwell]] (1996) ''Sources of Hyperbolic Geometry'', [[American Mathematical Society]] ISBN 0-8218-0529-0 .
| |
| *[[Georges Lemaître]] (1948) "Quaternions et espace elliptique", ''Acta'' [[Pontifical Academy of Sciences]] 12:57–78.
| |
| ** H.S.M. Coxeter, [http://www.ams.org/mathscinet/pdf/0031739.pdf English synopsis of Lemaître] in [[Mathematical Reviews]].
| |
| * Boris Odehnal [http://www.dmg.tuwien.ac.at/odehnal/elliso.pdf "On isotropic congruences of lines in elliptic three-space"]
| |
| * [[Eduard Study]] (1913) D.H. Delphenich translator, [http://neo-classical-physics.info/uploads/3/0/6/5/3065888/study-analytical_kinematics.pdf "Foundations and goals of analytical kinematics"], page 20.
| |
| *[[Alfred Tarski]] (1951) ''A Decision Method for Elementary Algebra and Geometry''. Univ. of California Press.
| |
| *{{cite book|first=Torkel|last= Franzén|title=Gödel's Theorem: An Incomplete Guide to its Use and Abuse|publisher= AK Peters|year=2005|isbn= 1-56881-238-8}}
| |
| | |
| [[Category:Classical geometry]]
| |
| [[Category:Non-Euclidean geometry]]
| |
| [[Category:Metric geometry]]
| |
Have we been thinking "how do I accelerate my computer" lately? Well possibilities are if you are reading this article; then you are experiencing 1 of various computer issues that thousands of people discover that they face on a regular basis.
Another answer would be to supply the computer program with a brand-new msvcr71 file. Often, once the file has been corrupted or damaged, it usually no longer be capable to function like it did before thus it's only all-natural to replace the file. Simply download another msvcr71.dll file from the internet. Often, the file comes in a zip format. Extract the files within the zip folder plus region them accordingly inside this location: C:\Windows\System32. Afterward, re-register the file. Click Start and then choose Run. Once the Run window appears, kind "cmd". Press Enter plus then sort "regsvr32 -u msvcr71.dll" followed by "regsvr32 msvcr71.dll". Press Enter again plus the file ought to be registered accordingly.
With RegCure to improve the start plus shut down of your computer. The program shows the scan progress plus we shouldn't worry where it's functioning at that time. It shows you exactly what arises. Dynamic link library section of the registry may result severe application failures. RegCure restores and repairs the registry plus keeps you out of DLL. RegCure is able to create individual corrections, thus it can works for your requires.
It is normal that the imm32.dll error is caused because of a mis-deletion activity. If you cannot discover the imm32.dll anywhere on a computer, there is not any question which it should be mis-deleted whenever uninstalling programs or other unneeded files. Hence, you are able to directly deal it from different programs or download it from a secure internet and then put it on a computer.
There are a lot of system mechanic professional s. Which 1 is the best is not effortless to be determined. But when you like to stand out 1 amidst the multitude you must consider some items. These are features, scanning speed time, total errors detected, total errors repaired, tech support, Boot time performance and price. According to these items Top Registry Cleaner for 2010 is RegCure.
The first thing we should do is to reinstall any program which shows the error. It's typical for several computers to have specific programs which need this DLL to show the error whenever you try and load it up. If you see a certain program show the error, you need to first uninstall that system, restart your PC and then resinstall the system again. This could substitute the damaged ac1st16.dll file plus cure the error.
Maybe you are asking how come these windows XP error messages appear. Well, for we to be capable to know the fix, you must initially understand where those mistakes come from. There is this software called registry. A registry is software that stores everything on a PC from a general configuration, setting, info, and logs of activities from installing to UN-installing, saving to deleting, along with a lot more alterations you do inside a system pass from it and gets 'tagged' plus saved because a easy file for recovery purposes. Imagine it as a big recorder, a registrar, of all a records in the PC.
Ally Wood is a expert software reviewer and has worked inside CNET. Then she is working for her own review software firm to give feedback to the software creator plus has done deep test inside registry cleaner software. After reviewing the most popular registry cleaner, she has written complete review on a review site for you which is accessed for free.