Question

In: Physics

State, without proofs all theorems of neutral geometry that permit to construct a midpoint of a...

State, without proofs all theorems of neutral geometry that permit to construct a midpoint of a given segment.

State, without proofs all theorems of Euclidean geometry that permit to execute your construction in the Poincare the Model of the Hyperbolic geometry.

Solutions

Expert Solution

Answer :-

Theorems of neutral geometry that permit to construct a midpoint of a given segment are:-

Definition 1:-  A point M is said to be a midpoint of a segment AB if A ∗ M ∗ B and AM ∼= MB.

Theorem 1:-  If A, B, C are points and A ∗ B ∗ C, then AB + BC = AC.

Theorem 2:- Given three distinct collinear points, exactly one of them lies between the other two.

Theorem 3:-  Every segment has a unique midpoint.

Theorems of Euclidean geometry that permit to execute your construction in the Poincare the Model of the Hyperbolic geometry are:-

Theorem 1:- The Poincar´e disk is a model of neutral geometry plus the hyperbolic parallel postulate.

And also these postulates:-

(I) For every line l and every point P not on l, there are at least two lines parallel to l and containing
P (Hyperbolic Parallel Postulate).
(II) If l and m are lines cut by a transversal t in such a way that the measures of two consecutive
interior angles adds up to less than 180◦
, then l and m need not necessarily intersect.
(III) Parallel lines are not everywhere equidistant.
(IV) If two parallel lines are cut by a transversal, the alternate interior angles need not be congruent.
(V) The sum of the measures of the three angles of any triangle is strictly less than 180°
(The Defectis Positive).
(VI) There exist triangles with different angle sums.
(VII) If two triangles are similar, then they are congruent.
(VIII) If two triangles have all three angles congruent, then the triangles are congruent. (AAA Congruence)
(IX) There is a universal upper bound to the area of any triangle. In other words, there exists a real
number K > 0 such that if 4ABC is any triangle, α(4ABC) ≤ K.


Related Solutions

Prove both of the following theorems in the context of Incidence Geometry. Your proofs should be...
Prove both of the following theorems in the context of Incidence Geometry. Your proofs should be comparable in terms of rigor and precision (and clarity of thought!) to the ones done in class today. A1. Given any point, there is at least one line not passing through it, A2. Given any point, there are at least two lines that do pass through it,
Explain what it is a neutral theorem in Euclidean geometry. State & prove both: the theorem...
Explain what it is a neutral theorem in Euclidean geometry. State & prove both: the theorem on construction of parallel lines and its converse. Which one of them is neutral?
Course: Differential Geometry (Vector Calculus & Linear Algebra) Provide all proofs (a) Find the formula for...
Course: Differential Geometry (Vector Calculus & Linear Algebra) Provide all proofs (a) Find the formula for the distance from p to the line y=mx (b) prove that the set U={(x,y): y<mx} is an open set
Reduce the following modular arithmetic WITHOUT THE USE OF A CALCULATOR: PLEASE STATE THE THEOREMS/RULES YOU...
Reduce the following modular arithmetic WITHOUT THE USE OF A CALCULATOR: PLEASE STATE THE THEOREMS/RULES YOU USE AND EXPLAIN HOW. Thanks!! a) 104^5 mod 2669 b) 11^132 mod 133 c) 2208^5 mod 2669 d) 7^1000 mod 5 e) 2^247 mod 35
Reduce the following modular arithmetic without the use of a calculator: PLEASE STATE THE THEOREMS/RULES YOU...
Reduce the following modular arithmetic without the use of a calculator: PLEASE STATE THE THEOREMS/RULES YOU USE AND EXPLAIN HOW. Thanks!! a) 104^5 mod 2669 b) 11^132 mod 133 c) 2208^5 mod 2669 d) 7^1000 mod 5 e) 2^247 mod 35
Discrete Math / Proofs Directions: Show all work/steps. State all assumptions as well as the goal...
Discrete Math / Proofs Directions: Show all work/steps. State all assumptions as well as the goal of the proof. Define A = { all binary sequences of length 4 } So < 1, 1, 0 1 > ε A, <0, 0, 0, 0 > ε A, <1, 0, 0, 1> ε A etc. i.) What is | A | ? Define a relation R on A as follows: For 1, a2, a3, a4 > R 1, b2, b3, b4> ε...
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT