Documentation

LeanPool.ConwayRefinement.ConwayRefinement.HahnSeries.Factorization.AlmostIrreducibleFactorization

Factorisations over a divisible exponent subgroup #

This file defines the factorisation objects in LM24, Theorem 6.5.7. The coefficient scalar is retained explicitly: the printed product omits it, and therefore does not represent a nonunit constant series. A nonpositive subgroup exponent represents the monomial factor, while a list represents the finite family of almost irreducible factors.

The normalized finite-support factor and the monomial exponent have separate uniqueness predicates. No uniqueness is asserted for the list of almost irreducible or irreducible factors.

A corrected LM24, Theorem 6.5.7 factorisation: a nonzero coefficient scalar, a normalized finite-support factor, a coefficient-one monomial, and finitely many almost irreducible factors with infinite support.

Equations
  • One or more equations did not get rendered due to their size.
Instances For
    theorem HahnSeries.Nonpositive.isAlmostIrreducibleFactorization_iff {H : AddSubgroup ℝ} {K : Type v} [Field K] (b : Nonpositive (↥H) K) (k : Kˣ) (p : ConstantTermOneFiniteSupport) (x : ↥(exponentMonoid ↥H)) (factors : List (Nonpositive (↥H) K)) :
    b.IsAlmostIrreducibleFactorization k p x factors ↔ b = C ↑k * ↑↑p * ↑(finiteSupportMonomial x) * factors.prod ∧ ∀ c ∈ factors, c.IsAlmostIrreducible ∧ (↑c).support.Infinite

    Characterization of an almost-irreducible factorisation over an exponent subgroup.

    The normalized finite-support factor is unique among all corrected almost-irreducible factorisations of the same series.

    Equations
    • One or more equations did not get rendered due to their size.
    Instances For

      Characterization of uniqueness of the normalized finite-support factor.

      The strengthened factorisation in LM24, Theorem 6.5.7, in which every infinite-support factor is irreducible rather than merely almost irreducible.

      Equations
      • One or more equations did not get rendered due to their size.
      Instances For
        theorem HahnSeries.Nonpositive.isIrreducibleSubgroupFactorization_iff {H : AddSubgroup ℝ} {K : Type v} [Field K] (b : Nonpositive (↥H) K) (k : Kˣ) (p : ConstantTermOneFiniteSupport) (x : ↥(exponentMonoid ↥H)) (factors : List (Nonpositive (↥H) K)) :
        b.IsIrreducibleSubgroupFactorization k p x factors ↔ b = C ↑k * ↑↑p * ↑(finiteSupportMonomial x) * factors.prod ∧ ∀ c ∈ factors, Irreducible c ∧ (↑c).support.Infinite

        Characterization of an irreducible infinite-support factorisation over an exponent subgroup.

        An irreducible subgroup factorisation is, in particular, an almost-irreducible factorisation with the same data.

        The monomial exponent is unique among all irreducible subgroup factorisations of the same series.

        Equations
        • One or more equations did not get rendered due to their size.
        Instances For

          Characterization of uniqueness of the monomial exponent in irreducible subgroup factorisations.