Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Ordinary Drawing Segment Directions Not Same Positive Ray

Proved
OrdinaryDrawingSegmentDirectionsNotSamePositiveRay

by moona3k · Oct 4, 2026 · Mathlib 0df444a (Lean v4.33.1)

crossing-consequencestrellis-port

In an ordinary polygonal drawing, let two distinct drawn edge arcs contain listed segments SeS_eSe​ and SfS_fSf​. Suppose both segments start, as oriented germs, at the same point xxx, with direction vectors ddd and vvv, and d≠0d\ne0d=0. Then vvv is not a positive scalar multiple of ddd.

Formalization Note This node is ported from the Trellis formalization of the crossing lemma and its consequences (wpegden/crossing-consequences, commit 8769d142, W. Pegden, Apache-2.0); the statement is the Trellis node OrdinaryDrawingSegmentDirectionsNotSamePositiveRay.

Preamble
import Mathlib.Tactic
import Mathlib.Analysis.InnerProductSpace.PiL2
import Mathlib.Analysis.SpecialFunctions.Pow.Real
import Mathlib.Combinatorics.SimpleGraph.Finite
import Mathlib.Data.Finset.Prod
import Mathlib.Data.Set.Finite.Basic
import Mathlib.LinearAlgebra.AffineSpace.AffineSubspace.Basic
import Definitions.Def_OrdinaryPolygonalDrawing

open Classical
noncomputable section
Formal statement
lemma OrdinaryDrawingSegmentDirectionsNotSamePositiveRay {V : Type*} [Fintype V]
    (G : SimpleGraph V) [Fintype G.edgeSet]
    (D : OrdinaryPolygonalDrawing G)
    {e f : G.edgeFinset} (hef : e ≠ f)
    {i j : ℕ}
    (hi : i + 1 < (D.edgeArc e).vertices.length)
    (hj : j + 1 < (D.edgeArc f).vertices.length)
    {x d v : EuclideanSpace ℝ (Fin 2)}
    (hd : d ≠ 0)
    (hseg_e :
      segment ℝ x (x + d) =
        segment ℝ (D.edgeArc e).vertices[i] (D.edgeArc e).vertices[i + 1])
    (hseg_f :
      segment ℝ x (x + v) =
        segment ℝ (D.edgeArc f).vertices[j] (D.edgeArc f).vertices[j + 1]) :
    ¬ ∃ a : ℝ, 0 < a ∧ v = a • d := by sorry
Source
https://github.com/wpegden/crossing-consequences/blob/8769d142033fce042f502bf2857afb6b1375b5c3/Tablet/OrdinaryDrawingSegmentDirectionsNotSamePositiveRay.lean#L1-L39

View graph

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me