Documentation

LeanPool.MarkoffModP.BGS.Markoff.Cage.PlaneModels

Direct affine-plane models for the cage #

The first variable is the primitive root coordinate and the second variable is the power parameter. Passing through finTwoToIteratedPolynomial makes the defining equations polynomials in the root coordinate with coefficients in the parameter polynomial ring.

The two-variable/iterated-polynomial equivalence commutes with extension of scalar fields.

noncomputable def BGS.Markoff.cageDiagonalIteratedPolynomial {K : Type u_1} [Field K] (xi : K) (d : ℕ) :

The diagonal hyperelliptic model L² = F_ξ(t), written as a polynomial in L over K[t].

Equations
Instances For
    noncomputable def BGS.Markoff.cageOffDiagonalIteratedPolynomial {K : Type u_1} [Field K] (xi eta : K) (d : ℕ) :

    The off-diagonal primitive-element model. Its root coordinate is S = L + M; eliminating L and M gives (S² - F_ξ - F_η)² - 4 F_ξ F_η.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For
      noncomputable def BGS.Markoff.cagePulledRadicandSecondCoordinate {K : Type u_1} [Field K] (xi : K) (d : ℕ) :

      The pulled radicand placed in the second bivariate coordinate.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        noncomputable def BGS.Markoff.cageDiagonalPlanePolynomial {K : Type u_1} [Field K] (xi : K) (d : ℕ) :

        The diagonal model as the displayed bivariate polynomial L² - F_ξ(t).

        Equations
        Instances For
          noncomputable def BGS.Markoff.cageOffDiagonalPlanePolynomial {K : Type u_1} [Field K] (xi eta : K) (d : ℕ) :

          The off-diagonal model as an honest bivariate polynomial.

          Equations
          • One or more equations did not get rendered due to their size.
          Instances For
            theorem BGS.Markoff.cageDiagonalIteratedPolynomial_irreducible {K : Type u_1} [Field K] {xi : K} (hxi : xi ≠ 0) (hXi : xi ^ 2 - 4 ≠ 0) {d : ℕ} (hd : 0 < d) (h2 : 2 ≠ 0) (hdegree : ↑(2 * d) ≠ 0) :

            Gauss's lemma turns nonsquareness of the radicand in K(t) into irreducibility of the diagonal plane equation over K[t].

            theorem BGS.Markoff.cageDiagonalPlanePolynomial_irreducible {K : Type u_1} [Field K] {xi : K} (hxi : xi ≠ 0) (hXi : xi ^ 2 - 4 ≠ 0) {d : ℕ} (hd : 0 < d) (h2 : 2 ≠ 0) (hdegree : ↑(2 * d) ≠ 0) :

            Ground-field irreducibility of the diagonal bivariate polynomial.

            theorem BGS.Markoff.cageOffDiagonalIteratedPolynomial_irreducible {K : Type u_1} [Field K] {xi eta : K} (hxi : xi ≠ 0) (heta : eta ≠ 0) (hXi : xi ^ 2 - 4 ≠ 0) (hEta : eta ^ 2 - 4 ≠ 0) (hoffDiagonal : xi ^ 2 ≠ eta ^ 2) {d : ℕ} (hd : 0 < d) (h2 : 2 ≠ 0) (hdegree : ↑(2 * d) ≠ 0) :

            The off-diagonal primitive quartic is irreducible over the parameter polynomial ring. The only geometric input is the proved independence of the three pulled-radicand square classes.

            theorem BGS.Markoff.cageOffDiagonalPlanePolynomial_irreducible {K : Type u_1} [Field K] {xi eta : K} (hxi : xi ≠ 0) (heta : eta ≠ 0) (hXi : xi ^ 2 - 4 ≠ 0) (hEta : eta ^ 2 - 4 ≠ 0) (hoffDiagonal : xi ^ 2 ≠ eta ^ 2) {d : ℕ} (hd : 0 < d) (h2 : 2 ≠ 0) (hdegree : ↑(2 * d) ≠ 0) :

            Ground-field irreducibility of the off-diagonal bivariate polynomial.

            theorem BGS.Markoff.map_cagePulledRadicand {K : Type u_1} [Field K] {L : Type u_2} [Field L] (phi : K →+* L) (xi : K) (d : ℕ) :

            Scalar extension commutes with the explicit pulled radicand.

            theorem BGS.Markoff.cageDiagonalPlanePolynomial_absolutelyIrreducible {K : Type u_1} [Field K] {xi : K} (hxi : xi ≠ 0) (hXi : xi ^ 2 - 4 ≠ 0) {d : ℕ} (hd : 0 < d) (h2 : 2 ≠ 0) (hdegree : ↑(2 * d) ≠ 0) :

            The diagonal plane model is absolutely irreducible.

            theorem BGS.Markoff.cageOffDiagonalPlanePolynomial_absolutelyIrreducible {K : Type u_1} [Field K] {xi eta : K} (hxi : xi ≠ 0) (heta : eta ≠ 0) (hXi : xi ^ 2 - 4 ≠ 0) (hEta : eta ^ 2 - 4 ≠ 0) (hoffDiagonal : xi ^ 2 ≠ eta ^ 2) {d : ℕ} (hd : 0 < d) (h2 : 2 ≠ 0) (hdegree : ↑(2 * d) ≠ 0) :

            The off-diagonal primitive quartic is absolutely irreducible.

            Coordinate-degree bound for a pulled radicand: it is independent of the root coordinate.

            Coordinate-degree bound for a pulled radicand in the power parameter.

            The diagonal model has bidegree at most (2,4d).

            The primitive off-diagonal quartic has bidegree at most (4,8d).

            theorem BGS.Markoff.eval_cagePulledRadicandSecondCoordinate {K : Type u_1} [Field K] (xi : K) (d : ℕ) (root parameter : K) :

            Evaluation of the embedded radicand is ordinary univariate evaluation in the second coordinate.

            theorem BGS.Markoff.eval_cageDiagonalPlanePolynomial_eq_zero_iff {K : Type u_1} [Field K] (xi : K) (d : ℕ) (root parameter : K) :

            Zeros of the diagonal plane model are exactly square roots of the pulled radicand.

            theorem BGS.Markoff.eval_cageOffDiagonalPlanePolynomial {K : Type u_1} [Field K] (xi eta : K) (d : ℕ) (sumRoot parameter : K) :
            (MvPolynomial.eval ![sumRoot, parameter]) (cageOffDiagonalPlanePolynomial xi eta d) = (sumRoot ^ 2 - (Polynomial.eval parameter (cagePulledRadicand xi d) + Polynomial.eval parameter (cagePulledRadicand eta d))) ^ 2 - 4 * Polynomial.eval parameter (cagePulledRadicand xi d) * Polynomial.eval parameter (cagePulledRadicand eta d)

            Evaluation of the off-diagonal plane model is the primitive quartic in the two scalar radicand values.

            theorem BGS.Markoff.primitiveQuarticEquation_iff_exists_rootPair {K : Type u_1} [Field K] (h2 : 2 ≠ 0) {f g sumRoot : K} (hsum : sumRoot ≠ 0) :
            (sumRoot ^ 2 - (f + g)) ^ 2 - 4 * f * g = 0 ↔ ∃ (firstRoot : K) (secondRoot : K), firstRoot ^ 2 = f ∧ secondRoot ^ 2 = g ∧ firstRoot + secondRoot = sumRoot

            Away from the primitive-coordinate boundary S = 0, the quartic equation is equivalent to retaining both quadratic roots. The explicit inverse is L = (S² + f - g)/(2S), M = (S² - f + g)/(2S).

            theorem BGS.Markoff.eval_cageOffDiagonalPlanePolynomial_eq_zero_iff_exists_rootPair {K : Type u_1} [Field K] (h2 : 2 ≠ 0) (xi eta : K) (d : ℕ) {sumRoot parameter : K} (hsum : sumRoot ≠ 0) :
            (MvPolynomial.eval ![sumRoot, parameter]) (cageOffDiagonalPlanePolynomial xi eta d) = 0 ↔ ∃ (firstRoot : K) (secondRoot : K), firstRoot ^ 2 = Polynomial.eval parameter (cagePulledRadicand xi d) ∧ secondRoot ^ 2 = Polynomial.eval parameter (cagePulledRadicand eta d) ∧ firstRoot + secondRoot = sumRoot

            The preceding primitive-element equivalence applied to the actual cage plane equation.