Basic projective geometry #
Defines the projective-geometry axioms, the line operator, and central projection between lines in an axiomatic projective geometry.
A projective geometry is a set G together with a ternary collinearity
relation ell ⊆ G × G × G satisfying the axioms L₁, L₂ and L₃. (p. 26)
- l1 (a b : G) : ell a b a
- l2 (a b p q : G) : ell a p q → ell b p q → p ≠ q → ell a b p
- l3 (a b c d p : G) : ell p a b → ell p c d → ∃ (q : G), ell q a c ∧ ell q b d
Instances
relSym closes a collinearity goal that follows from a hypothesis by one of
the symmetries of the relation ell (any permutation of a collinear triple).
Equations
- Basic.tacticRelSym = Lean.ParserDescr.node `Basic.tacticRelSym 1024 (Lean.ParserDescr.nonReservedSymbol "relSym" false)
Instances For
The line operator ⋆: star ell a b is the line through a and b,
defined as {c | ell a b c} when a ≠ b and as {a} when a = b.
Instances For
The central projection with center z of a point x on the line a ⋆ c
onto the line b ⋆ c: the intersection of the line x ⋆ z with b ⋆ c.
Equations
- Basic.centralProjection a b c z x = Subtype.val ⁻¹' (Basic.star ell (↑x) z ∩ Basic.star ell b c)
Instances For
The data of a non-degenerate central projection: two distinct lines through
c (given by a, b not collinear with c) and a center z on a ⋆ b
distinct from a and b.
- abc_ncol : ¬ell a b c
Instances
The central projection as a function: the unique image point on b ⋆ c of
the point x on a ⋆ c under projection from the center z.
Equations
- Basic.cenProjMap a b c z x = ⋯.choose
Instances For
The central projection a ⋆ c → b ⋆ c from the center z.
Equations
- Basic.φ a b c z = Basic.cenProjMap a b c z
Instances For
The reverse central projection b ⋆ c → a ⋆ c from the center z, inverse to φ.
Equations
- Basic.ψ a b c z = Basic.cenProjMap b a c ⟨↑z, ⋯⟩