»» Euclidean Geometry

# Euclidean Geometry

The following section presupposes Set Theory, Topology and Nonstandard Analysis.

Definition: Two distinct points as elements of a Euclidean space (simply called a space in the following) viewed as a subspace of $$\mathbb{R}^{n}$$ with $$n \in {}^{\omega }\mathbb{N}^{*}$$ (see Set Theory) are said to be a pair (of points). A (one-) two-dimensional subspace in the space is called (straight line) plane. A line segment is a connected subset of a straight line whose starting point $$x$$ and end point $$z$$ have to only one neighbour finite distance. The latter is given by the Euclidean norm $$||\cdot||$$.$$\triangle$$

Definition: Two line segments are said to intersect if they have precisely one point in common. A one-dimensional point set in space is called a line if each point has at least one and at most two gaplessly neighbouring points. Two line segments are said to be parallel if one line may be obtained from the other by means of a translation. All points of a plane with the same distance (called radius) to another point constitute a circle, which forms with its interior a disk.$$\triangle$$

Result: By defining short straight lines, arbitrarily many counterexamples can be given based on the above to Pasch’s axiom, the axiom of line completeness, as well as various other axioms and their equivalents. Hilbert’s incidence axiom I.6 is provable. If a straight line uniquely defines a parallel straight line running through a given point by their shortest distance, the parallel postulate is redundant in Euclidean Geometry. Three distinct points are not enough to uniquely determine a plane.

Hilbert’s incidence axiom I.7 is false. The axioms of order and congruence are redundant. Rating two straight lines only as parallel when they lie in the same plane and do not intersect, the parallel postulate does not hold: The reciprocal of the distance between the straight line and the given point may be greater than infinity or smaller than $$|{}^{\omega }\mathbb{N}|$$, and then infinitely many distinct straight lines can be found that pass through the given point without intersecting the original straight line.

The Archimedean axiom must be extended to the case where a segment is marked off an infinite natural number of times without exceeding the starting point or end point of a straight line. It must be in the finite case replaced by the Archimedean theorem (see Nonstandard Analysis). Pasch’s axiom is also unnecessary, since every straight line must be fully contained in the interior of some triangle due to its maximum length, and hence so must its boundary, provided that one of its points is in this interior.

Normal theorem: For $$n \in {}^{\omega }\mathbb{N}_{\ge 2}$$, every convex set $$S$$ from $${}^{\omega }\mathbb{R}^{n}$$ contains a point lying on $$\hat{n}$$ distinct normals through $$\partial S$$ (also through a vertex), since this is possible every $$90°$$ in the plane1cf. Croft, Hallard T.; Falconer, Kenneth J.; Guy, Richard K.: Unsolved Problems in Geometry; Reprint of 1st Ed.; 2013; Springer; New York; p. 14 f..$$\square$$

Toeplitz’ conjecture: Every Jordan curve admits an inscribed square.

Counterexamples: The right-angled triangle with two sides of length $$\iota$$ and the obtuse triangle where a vertex of at most one inscribed square is infinitesimally moved within the limits.$$\square$$

Theorem: Infinitesimally juxtaposing equichordal points within the limits leads to a Jordan domain with more than one equichordal point2cf. loc. cit. p. 9 f..$$\square$$

Fickett’s theorem: For any relative positions of two overlapping congruent rectangular $$n$$-prisms $$Q$$ and $$R$$ with $$n \in {}^{\omega }\mathbb{N}_{\ge 2}$$ and $$\grave{m} := \hat{n}$$, the exact standard measure $$\mu$$ (see Nonstandard Analysis)3loc. cit. p. 25. implies, where $$\mu$$ for $$n = 2$$ is the Euclidean path length $$L$$:$\tilde{m} < r := \mu(\partial Q \cap R)/\mu(\partial R \cap Q) < m.$Proof: The underlying extremal problem has its maximum for rectangles with side lengths $$s$$ and $$s + \hat{\iota}$$. Putting $$q := 3 – \hat{\iota}\tilde{s}$$ implies min $$r = \tilde{q} \le r \le$$ max $$r = q$$. The proof for $$n > 2$$ works analogously.$$\square$$

Remark: All (three ancient) exactly unsolvable problems may be solved with arbitrary precision by the fundamental theorem of set theory via the intercept theorem and Farey sequences4Scheid, Harald: Zahlentheorie; 1. Aufl.; 1991; Bibliographisches Institut; Mannheim, p. 62 f..