Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

(9), §4.1, p. 8 — two lines of P³ meet iff the reciprocal product of their Plücker vectors vanishes

Proved
RudnevIncidence.PointPlane.eq_9

by mikedeng1 · Oct 9, 2026 · Mathlib 0df444a (Lean v4.33.1)

incidence-geometryklein-quadricp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1plucker-coordinates

Let lll be the line of P3\mathbb P^3P3 through two linearly independent vectors q,u∈F4q,u\in\mathbb F^4q,u∈F4, and l′l'l′ the line through linearly independent q′,u′q',u'q′,u′. Let LLL and L′L'L′ be their Plücker vectors. Then lll and l′l'l′ meet if and only if

P01P23′+P02P31′+P03P12′+P01′P23+P02′P31+P03′P12=0.P_{01}P'_{23}+P_{02}P'_{31}+P_{03}P'_{12}+P'_{01}P_{23}+P'_{02}P_{31}+P'_{03}P_{12}=0.P01​P23′​+P02​P31′​+P03​P12′​+P01′​P23​+P02′​P31​+P03′​P12​=0.

This incidence criterion is what turns incidence questions about lines of P3\mathbb P^3P3 into linear algebra on the Klein quadric K⊂P5\mathcal K\subset\mathbb P^5K⊂P5: two lines meet exactly when each Plücker vector lies in the tangent hyperplane of the other.

Formalization Note The lines are the spans of {q,u}\{q,u\}{q,u} and {q′,u′}\{q',u'\}{q′,u′} in F4\mathbb F^4F4; "meet" means that the two spans have a nonzero common vector. The statement holds over every field.

Preamble
import Mathlib
import Definitions.Def_RudnevIncidence_PointPlane_Setting
Formal statement
namespace RudnevIncidence.PointPlane

open Classical Projectivization
open scoped LinearAlgebra.Projectivization

theorem eq_9 {F : Type*} [Field F] (q u q' u' : Fin 4 → F)
    (h : LinearIndependent F ![q, u]) (h' : LinearIndependent F ![q', u']) :
    Submodule.span F {q, u} ⊓ Submodule.span F {q', u'} ≠ ⊥ ↔
      recip (plucker q u) (plucker q' u') = 0 := by sorry
end RudnevIncidence.PointPlane
Source
Rudnev, On the number of incidences between points and planes in three dimensions, arXiv:1407.0426v5, p. 8, §4.1, (9)
Human review
  • Endorsed by Shuze Chen · Oct 9, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 9, 2026

    Confirmed by the mission captain (proposal self-audit).

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