Keyboard shortcuts

Press ← or → to navigate between chapters

Press ? to show this help

Press Esc to hide this help

Actual carrier and cyclic crossing geometry

Abstract

Actual polygon ear slide geometry

Definition 1.1 (Segments).

Formalization. D5/S3/Geometry/Polygons/PolygonEarSlideGeometry.IsSegment (✓ std3).

Source. Repository-derived.

Commentary.

A segment has distinct endpoints in the symmetric square.

Definition 1.2 (Boundary sides).

Formalization. D5/S3/Geometry/Polygons/PolygonEarSlideGeometry.IsSide (✓ std3).

Source. Repository-derived.

Commentary.

An unordered boundary side joins successive cyclic vertices. symPair denotes the unordered pair s(a,b).

Definition 1.3 (Internal diagonals).

Formalization. D5/S3/Geometry/Polygons/PolygonEarSlideGeometry.IsDiagonal (✓ std3).

Source. Repository-derived.

Commentary.

Internal diagonals are segments that are not boundary sides.

Definition 1.4 (Actual cyclic crossing).

Formalization. D5/S3/Geometry/Polygons/PolygonEarSlideGeometry.Cross (✓ std3).

Source. Repository-derived.

Commentary.

Crossing uses strict cyclic betweenness witnesses.

Definition 1.5 (Maximal noncrossing finite diagonal carrier).

Formalization. D5/S3/Geometry/Polygons/PolygonEarSlideGeometry.IsTriangulation (✓ std3).

Source. Repository-derived.

Commentary.

The carrier contains every maximal noncrossing finite set of internal diagonals; no completion is selected.

Definition 1.6 (Ear diagonal at a cyclic centre).

Formalization. D5/S3/Geometry/Polygons/PolygonEarSlideGeometry.ear (✓ std3).

Source. Repository-derived.

Commentary.

The local names sEar, tEar, uEar denote ear(1), ear(2), ear(3).

Definition 1.7 (Exchange the two local vertices).

Formalization. D5/S3/Geometry/Polygons/PolygonEarSlideGeometry.vertexSwap (✓ std3).

Source. Repository-derived.

Commentary.

The vertex permutation exchanges 1 and 2 and fixes every other vertex.

Definition 1.8 (Induced unordered-chord exchange).

Formalization. D5/S3/Geometry/Polygons/PolygonEarSlideGeometry.chordSwap (✓ std3).

Source. Repository-derived.

Commentary.

Symmetric-square map transports each unordered pair.

Definition 1.9 (Avoid the deleted centre).

Formalization. D5/S3/Geometry/Polygons/PolygonEarSlideGeometry.AvoidTwo (✓ std3).

Source. Repository-derived.

Commentary.

Every endpoint avoids vertex 2.

Theorem 1.10 (Crossing transport away from centre 2).

Proof. Machine-checked in Lean as D5/S3/Geometry/Polygons/PolygonEarSlideGeometry.cross_chordSwap_of_avoidTwo (✓ std3). ∎

Source. Repository-derived.

Commentary.

Crossing is transported in both directions, including across the cyclic seam.

References