Documentation

Mathlib.RingTheory.HahnSeries.Lex

Lexicographical order on Hahn series #

In this file, we define lexicographical ordered Lex (HahnSeries Γ R), and show this is a LinearOrder when Γ and R themselves are linearly ordered. Additionally, it is an ordered group when R is.

theorem HahnSeries.lt_iff {Γ : Type u_1} {R : Type u_2} [LinearOrder Γ] [Zero R] [PartialOrder R] (a b : Lex (HahnSeries Γ R)) :
a < b ∃ (i : Γ), (∀ j < i, (ofLex a).coeff j = (ofLex b).coeff j) (ofLex a).coeff i < (ofLex b).coeff i
noncomputable instance HahnSeries.instLinearOrderLex {Γ : Type u_1} {R : Type u_2} [LinearOrder Γ] [Zero R] [LinearOrder R] :
Equations
  • One or more equations did not get rendered due to their size.
theorem HahnSeries.leadingCoeff_pos_iff {Γ : Type u_1} {R : Type u_2} [LinearOrder Γ] [Zero R] [LinearOrder R] {x : Lex (HahnSeries Γ R)} :
theorem HahnSeries.leadingCoeff_nonneg_iff {Γ : Type u_1} {R : Type u_2} [LinearOrder Γ] [Zero R] [LinearOrder R] {x : Lex (HahnSeries Γ R)} :
theorem HahnSeries.leadingCoeff_neg_iff {Γ : Type u_1} {R : Type u_2} [LinearOrder Γ] [Zero R] [LinearOrder R] {x : Lex (HahnSeries Γ R)} :
theorem HahnSeries.leadingCoeff_nonpos_iff {Γ : Type u_1} {R : Type u_2} [LinearOrder Γ] [Zero R] [LinearOrder R] {x : Lex (HahnSeries Γ R)} :
theorem HahnSeries.order_abs {Γ : Type u_1} {R : Type u_2} [LinearOrder Γ] [LinearOrder R] [AddCommGroup R] [IsOrderedAddMonoid R] [Zero Γ] (x : Lex (HahnSeries Γ R)) :