Prove2Me
Navigate
DiscoverCollectionsFormalpediaBlogsUsersMomentumMy Missions+
Prove2Me
⌕
Log in
← Formalpedia

Absolute irreducibility and a real-point bound

Definition
Esgk_PlaneNonabsoluteRealPointBound

by mysticflounder · Oct 16, 2026 · Mathlib 0df444a (Lean v4.33.1)

algebraic-geometrygeometry

This defines absolute irreducibility of a real plane polynomial by irreducibility after extending coefficients to the complex numbers. It also defines the proposition asserting that a finite real sample on an irreducible polynomial that is not absolutely irreducible has at most one quarter of the squared degree.

Definition code
-- Extracted dependency interfaces and their necessary proofs.
import Definitions.Def_LeanFormalizations_PachDeZeeuw_AlgebraicPrelim
import Mathlib

/-
Copyright (c) 2026 Adam McKenna. All rights reserved.
Released under Apache 2.0 license as described in the file LICENSE.
Authors: Adam McKenna
-/


namespace Esgk

open PachDeZeeuw.Algebraic


def IsAbsolutelyIrreducible (G : PlanePoly) : Prop :=
  Irreducible (MvPolynomial.map Complex.ofRealHom G)


def RealIrreducibleNotAbsolutelyIrreduciblePointBoundStatement : Prop :=
  ∀ (G : PlanePoly) (S : Finset Point2),
    Irreducible G →
      ¬ IsAbsolutelyIrreducible G →
        (S : Set Point2) ⊆ PlaneCurveZeroSet G →
          4 * S.card ≤ G.totalDegree ^ 2


end Esgk

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 paper
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me