Documentation

Hironaka.Analytic.Oka.Lemma

Oka's lemma on relations with polynomial coefficients #

Oka's lemma [Fre17, Ch. I, 10.4] is the algebraic heart of the coherence of the structure sheaf: for an π’ͺ_n-linear map F : π’ͺ_n^p β†’ π’ͺ_n whose matrix entries are normalized polynomials in π’ͺ_{nβˆ’1}[z_n] of degree < d, the kernel of F is generated, as an π’ͺ_n-module, by the relations whose components are polynomials in z_n of degree < 3d.

Here π’ͺ_n is the ring Conv K (m + 1) of convergent power series in m + 1 variables over K ∈ {ℝ, β„‚}, the distinguished variable is x_0 (splitFirst, liftTail, weierstrassPoly), and π’ͺ_{nβˆ’1}[x_0 : N] is the set of series of x_0-degree < N (DegLt N, DegLt.lean). The statement rowKer_le_span_degLt says: every relation P (βˆ‘_j F_j P_j = 0) with F_0 a monic polynomial in x_0 of degree < d and the other F_j of x_0-degree < d lies in the π’ͺ_n-span of the relations whose components have x_0-degree < 3d. The proof follows the two steps of Freitag's:

The real and complex cases have the same proof. The lemma feeds the coherence of the ideal of relations (Hironaka/AnalyticSpace/Oka).

@[reducible, inline]
noncomputable abbrev Analytic.rowKer {K : Type u_1} [RCLike K] {m p : β„•} (G : Fin p β†’ β†₯(Conv K (m + 1))) :
Submodule (β†₯(Conv K (m + 1))) (Fin p β†’ β†₯(Conv K (m + 1)))

The relations of a row G over π’ͺ_n: {P ∣ βˆ‘_j G j * P j = 0} (the relation module of a system at one point, relationSubmodule of Hironaka/AnalyticSpace/Coherent.lean, is this with the germs of the entries).

Equations
Instances For
    theorem Analytic.mem_rowKer_iff {K : Type u_1} [RCLike K] {m p : β„•} (G P : Fin p β†’ β†₯(Conv K (m + 1))) :
    P ∈ rowKer G ↔ βˆ‘ j : Fin p, G j * P j = 0
    def Analytic.degLtRel {K : Type u_1} [RCLike K] {m p : β„•} (N : β„•) (G : Fin p β†’ β†₯(Conv K (m + 1))) :
    Set (Fin p β†’ β†₯(Conv K (m + 1)))

    The relations of G whose components have x_0-degree < N: the submodule K_N of [Fre17, Ch. I, 10.4].

    Equations
    Instances For
      theorem Analytic.degLtRel_mono {K : Type u_1} [RCLike K] {m p N N' : β„•} (h : N ≀ N') (G : Fin p β†’ β†₯(Conv K (m + 1))) :
      degLtRel N G βŠ† degLtRel N' G
      noncomputable def Analytic.trivialRel {K : Type u_1} [RCLike K] {m p : β„•} (Q : β†₯(Conv K (m + 1))) (F : Fin p β†’ β†₯(Conv K (m + 1))) (j : Fin p) :
      Fin (p + 1) β†’ β†₯(Conv K (m + 1))

      The trivial relation H^{(j)} = (βˆ’F_j, 0, …, 0, Q, 0, …, 0) (Q in slot j + 1).

      Equations
      Instances For
        noncomputable def Analytic.scaled {K : Type u_1} [RCLike K] {m p : β„•} (c : β†₯(Conv K (m + 1))) (H : Fin (p + 1) β†’ β†₯(Conv K (m + 1))) :
        Fin (p + 1) β†’ β†₯(Conv K (m + 1))

        c β€’ H, written componentwise (definitionally c β€’ H; avoids the Pi.smul simp set on the subtype ring).

        Equations
        Instances For
          theorem Analytic.scaled_eq_smul {K : Type u_1} [RCLike K] {m p : β„•} (c : β†₯(Conv K (m + 1))) (H : Fin (p + 1) β†’ β†₯(Conv K (m + 1))) :
          scaled c H = c β€’ H
          theorem Analytic.trivialRel_mem_rowKer {K : Type u_1} [RCLike K] {m p : β„•} (Q : β†₯(Conv K (m + 1))) (F : Fin p β†’ β†₯(Conv K (m + 1))) (j : Fin p) :
          theorem Analytic.rowKer_le_span_degLt_of_weierstrass {K : Type u_1} [RCLike K] {m p d d' : β„•} (hd' : d' < d) {c : Fin d' β†’ MvPowerSeries (Fin m) K} (hc0 : βˆ€ (k : Fin d'), MvPowerSeries.constantCoeff (c k) = 0) (Q : β†₯(Conv K (m + 1))) (hQ : ↑Q = weierstrassPoly d' c) (F : Fin p β†’ β†₯(Conv K (m + 1))) (hF : βˆ€ (j : Fin p), DegLt d ↑(F j)) :
          rowKer (Fin.cons Q F) ≀ Submodule.span (β†₯(Conv K (m + 1))) (degLtRel d (Fin.cons Q F))

          Case A of Oka's lemma (the first step of the proof of [Fre17, Ch. I, 10.4]): for Q a Weierstrass polynomial of degree d' < d and F_1, …, F_p of x_0-degree < d, every relation of (Q, F_1, …, F_p) is an π’ͺ_n-combination of relations whose components have x_0-degree < d.

          theorem Analytic.weierstrassPoly_mem_conv {K : Type u_1} [RCLike K] {m n : β„•} {c : Fin n β†’ MvPowerSeries (Fin m) K} (hc : βˆ€ (j : Fin n), c j ∈ Conv K m) :

          A monic polynomial in x_0 with convergent tail coefficients is convergent.

          theorem Analytic.degLt_unit_of_monic {K : Type u_1} [RCLike K] {m : β„•} {Q : Polynomial (MvPowerSeries (Fin m) K)} (hF : ofPoly Q ∈ Conv K (m + 1)) {d' : β„•} {u : MvPowerSeries (Fin (m + 1)) K} {c' : Fin d' β†’ MvPowerSeries (Fin m) K} (hc' : βˆ€ (j : Fin d'), c' j ∈ Conv K m) (hc'0 : βˆ€ (j : Fin d'), MvPowerSeries.constantCoeff (c' j) = 0) (hprep : ofPoly Q = u * weierstrassPoly d' c') :
          DegLt (Q.natDegree - d' + 1) u

          The second step of the proof of [Fre17, Ch. I, 10.4]: for Fβ‚€ = ofPoly Q with Q monic in x_0 of degree e, regular of order d', the unit u of its Weierstrass preparation Fβ‚€ = u Β· Q' is itself a polynomial in x_0 of degree ≀ e βˆ’ d', by the polynomial division of Q by the monic Weierstrass polynomial Q' and the uniqueness of the Weierstrass division.

          theorem Analytic.rowKer_le_span_degLt {K : Type u_1} [RCLike K] {m p d e : β„•} (he : e < d) {Q : Polynomial (MvPowerSeries (Fin m) K)} (hQ : Q.Monic) (hQe : Q.natDegree = e) (F0 : β†₯(Conv K (m + 1))) (hF0 : ↑F0 = ofPoly Q) (F : Fin p β†’ β†₯(Conv K (m + 1))) (hF : βˆ€ (j : Fin p), DegLt d ↑(F j)) :
          rowKer (Fin.cons F0 F) ≀ Submodule.span (β†₯(Conv K (m + 1))) (degLtRel (3 * d) (Fin.cons F0 F))

          Oka's lemma [Fre17, Ch. I, 10.4]: for Fβ‚€ a monic polynomial in x_0 of degree e < d and F_1, …, F_p of x_0-degree < d, every relation of (Fβ‚€, F_1, …, F_p) is an π’ͺ_n-combination of relations whose components have x_0-degree < 3d (the proof gives < 2d). The hypothesis is weaker than the printed one, where Fβ‚€ is a Weierstrass polynomial (monic with coefficients in the maximal ideal): only monicity of Fβ‚€ is used.