Documentation

LeanPool.CCDN.Noether.UniversalPlane

The universal affine plane #

The universal affine two-plane has independent coordinates for its base point and both directions. Its specializations are affine-plane restrictions; its polynomial coefficients are the objects to be counted. Every coefficient of the universal restriction has degree in the plane parameters bounded by the total degree of the original equation.

@[reducible, inline]
abbrev CCDN.PlaneParameters (σ : Type u_1) :
Type u_1

Indices of the parameters of an affine plane in the affine space with coordinates σ: the pair (i, 0) indexes the i-th coordinate of the base point, and (i, 1), (i, 2) those of the two direction vectors.

Equations
Instances For
    noncomputable def CCDN.universalPlaneMap (K : Type u_1) (σ : Type u_2) [CommRing K] :

    All affine planes a+xb+yc, with every coordinate an independent parameter.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      noncomputable def CCDN.universalPlanePolynomial {K : Type u_1} {σ : Type u_2} [CommRing K] (f : MvPolynomial σ K) :

      The restriction of f to the universal affine plane, viewed as a bivariate polynomial whose coefficients are polynomials in the plane parameters.

      Equations
      Instances For
        def CCDN.planeParameterEval {K : Type u_1} {A : Type u_2} {σ : Type u_3} [CommRing K] [CommRing A] (φ : K →+* A) (a b c : σ → A) :

        Evaluate all three blocks of affine-plane parameters.

        Equations
        Instances For
          theorem CCDN.universalPlaneMap_specialize {K : Type u_1} {A : Type u_2} {σ : Type u_3} [CommRing K] [CommRing A] (φ : K →+* A) (a b c : σ → A) (f : MvPolynomial σ K) :

          Universal specialization is exactly the displayed affine substitution.

          Specializing the plane parameters of the universal plane restriction of f to a base point a and directions b, c gives the restriction of f to the plane a + x • b + y • c.

          theorem CCDN.closedForm_minor_smul {R : Type u_1} [CommRing R] (u : R) (d r : ℕ) (f : Polynomial (Polynomial R)) (a : Fin r → ℕ × ℕ) (c : Fin r → ClosedFormColumns d) :

          Scaling f by u multiplies every minor of order r of its closed-form coefficient matrix by u ^ r.

          theorem CCDN.commAlgEquiv_coeff_coeff {K : Type u_1} {σ : Type u_2} {τ : Type u_3} [CommRing K] (f : MvPolynomial σ (MvPolynomial τ K)) (m : σ →₀ ℕ) (n : τ →₀ ℕ) :
          (((MvPolynomial.commAlgEquiv K σ τ) f).coeff n).coeff m = (f.coeff m).coeff n

          Under commAlgEquiv, which swaps the two sets of variables of an iterated multivariate polynomial ring, the coefficient of n in the coefficient of m is the coefficient of m in the coefficient of n.

          Each coefficient of the universal plane restriction of f has total degree at most the total degree of f in all plane parameters together.