Documentation

LeanPool.CCDN.Height.ProjectiveBox

Rational projective points with the multiplicative height used by CCDN. Bounded-height sets are finite, and primitive integral coordinates recover the paper's maximum-coordinate height.

@[reducible, inline]

Rational points of projective n-space, as lines in ℚ^(n+1).

Equations
Instances For

    The multiplicative height of the chosen representative of a projective point equals the height of the point.

    Northcott finiteness in rational projective space, proved using affine charts.

    noncomputable def CCDN.projectivePoints {n : ℕ} (X : Set (ProjectivePoint n)) (B : ℝ) :

    Projective points, counted once per rational line.

    Equations
    Instances For
      noncomputable def CCDN.projectiveCount {n : ℕ} (X : Set (ProjectivePoint n)) (B : ℝ) :

      The number of points of X of multiplicative height at most B.

      Equations
      Instances For

        A projective point belongs to projectivePoints X B exactly when it lies in X and has height at most B.

        theorem CCDN.projectiveCount_mono {n : ℕ} {X Y : Set (ProjectivePoint n)} {B C : ℝ} (hXY : X ⊆ Y) (hBC : B ≤ C) :

        The projective point count is monotone in both the set and the height bound.

        theorem CCDN.rationalPoint_ne_zero {n : ℕ} {x : IntPoint n} (hx : x ≠ 0) :

        A nonzero integer point remains nonzero as a rational point.

        theorem CCDN.projective_height_primitive {n : ℕ} (x : IntPoint (n + 1)) (hx : x ≠ 0) (hprimitive : Finset.univ.gcd x = 1) :
        (Projectivization.mk ℚ (rationalPoint x) ⋯).mulHeight = ↑(⨆ (i : Fin (n + 1)), |x i|)

        The chosen projective height is exactly CCDN's height on primitive coordinates.