Free monoid over a given alphabet

Main definitions

• FreeMonoid α: free monoid over alphabet α; defined as a synonym for List α with multiplication given by (++).
• FreeMonoid.of: embedding α → FreeMonoid α sending each element x to [x];
• FreeMonoid.lift: natural equivalence between α → M and FreeMonoid α →* M
• FreeMonoid.map: embedding of α → β into FreeMonoid α →* FreeMonoid β given by List.map.

def FreeMonoid (α : Type u_6) : Type u_6

Free monoid over a given alphabet.

Equations

• FreeMonoid α = List α

def FreeAddMonoid (α : Type u_6) : Type u_6

Free nonabelian additive monoid over a given alphabet

Equations

• FreeAddMonoid α = List α

def FreeMonoid.toList {α : Type u_1} : FreeMonoid α ≃ List α

The identity equivalence between FreeMonoid α and List α.

Equations

• FreeMonoid.toList = Equiv.refl (FreeMonoid α)

def FreeAddMonoid.toList {α : Type u_1} : FreeAddMonoid α ≃ List α

The identity equivalence between FreeAddMonoid α and List α.

Equations

• FreeAddMonoid.toList = Equiv.refl (FreeAddMonoid α)

def FreeMonoid.ofList {α : Type u_1} : List α ≃ FreeMonoid α

The identity equivalence between List α and FreeMonoid α.

Equations

• FreeMonoid.ofList = Equiv.refl (List α)

def FreeAddMonoid.ofList {α : Type u_1} : List α ≃ FreeAddMonoid α

The identity equivalence between List α and FreeAddMonoid α.

Equations

• FreeAddMonoid.ofList = Equiv.refl (List α)

@[simp]

theorem FreeMonoid.toList_symm {α : Type u_1} : toList.symm = ofList

@[simp]

theorem FreeAddMonoid.toList_symm {α : Type u_1} : toList.symm = ofList

@[simp]

theorem FreeMonoid.ofList_symm {α : Type u_1} : ofList.symm = toList

@[simp]

theorem FreeAddMonoid.ofList_symm {α : Type u_1} : ofList.symm = toList

@[simp]

theorem FreeMonoid.toList_ofList {α : Type u_1} (l : List α) : toList (ofList l) = l

@[simp]

theorem FreeAddMonoid.toList_ofList {α : Type u_1} (l : List α) : toList (ofList l) = l

@[simp]

theorem FreeMonoid.ofList_toList {α : Type u_1} (xs : FreeMonoid α) : ofList (toList xs) = xs

@[simp]

theorem FreeAddMonoid.ofList_toList {α : Type u_1} (xs : FreeAddMonoid α) : ofList (toList xs) = xs

@[simp]

theorem FreeMonoid.toList_comp_ofList {α : Type u_1} : ⇑toList ∘ ⇑ofList = id

@[simp]

theorem FreeAddMonoid.toList_comp_ofList {α : Type u_1} : ⇑toList ∘ ⇑ofList = id

@[simp]

theorem FreeMonoid.ofList_comp_toList {α : Type u_1} : ⇑ofList ∘ ⇑toList = id

@[simp]

theorem FreeAddMonoid.ofList_comp_toList {α : Type u_1} : ⇑ofList ∘ ⇑toList = id

instance FreeMonoid.instCancelMonoid {α : Type u_1} : CancelMonoid (FreeMonoid α)

Equations

• FreeMonoid.instCancelMonoid = CancelMonoid.mk ⋯

instance FreeAddMonoid.instAddCancelMonoid {α : Type u_1} : AddCancelMonoid (FreeAddMonoid α)

Equations

• FreeAddMonoid.instAddCancelMonoid = AddCancelMonoid.mk ⋯

instance FreeMonoid.instInhabited {α : Type u_1} : Inhabited (FreeMonoid α)

Equations

• FreeMonoid.instInhabited = { default := 1 }

instance FreeAddMonoid.instInhabited {α : Type u_1} : Inhabited (FreeAddMonoid α)

Equations

• FreeAddMonoid.instInhabited = { default := 0 }

instance FreeMonoid.instUniqueOfIsEmpty {α : Type u_1} [IsEmpty α] : Unique (FreeMonoid α)

Equations

• FreeMonoid.instUniqueOfIsEmpty = inferInstanceAs (Unique (List α))

instance FreeAddMonoid.instUniqueOfIsEmpty {α : Type u_1} [IsEmpty α] : Unique (FreeAddMonoid α)

Equations

• FreeAddMonoid.instUniqueOfIsEmpty = inferInstanceAs (Unique (List α))

@[simp]

theorem FreeMonoid.toList_one {α : Type u_1} : toList 1 = []

@[simp]

theorem FreeAddMonoid.toList_zero {α : Type u_1} : toList 0 = []

@[simp]

theorem FreeMonoid.ofList_nil {α : Type u_1} : ofList [] = 1

@[simp]

theorem FreeAddMonoid.ofList_nil {α : Type u_1} : ofList [] = 0

@[simp]

theorem FreeMonoid.toList_mul {α : Type u_1} (xs ys : FreeMonoid α) : toList (xs * ys) = toList xs ++ toList ys

@[simp]

theorem FreeAddMonoid.toList_add {α : Type u_1} (xs ys : FreeAddMonoid α) : toList (xs + ys) = toList xs ++ toList ys

@[simp]

theorem FreeMonoid.ofList_append {α : Type u_1} (xs ys : List α) : ofList (xs ++ ys) = ofList xs * ofList ys

@[simp]

theorem FreeAddMonoid.ofList_append {α : Type u_1} (xs ys : List α) : ofList (xs ++ ys) = ofList xs + ofList ys

@[simp]

theorem FreeMonoid.toList_prod {α : Type u_1} (xs : List (FreeMonoid α)) : toList xs.prod = (List.map (⇑toList) xs).flatten

@[simp]

theorem FreeAddMonoid.toList_sum {α : Type u_1} (xs : List (FreeAddMonoid α)) : toList xs.sum = (List.map (⇑toList) xs).flatten

@[simp]

theorem FreeMonoid.ofList_flatten {α : Type u_1} (xs : List (List α)) : ofList xs.flatten = (List.map (⇑ofList) xs).prod

@[simp]

theorem FreeAddMonoid.ofList_flatten {α : Type u_1} (xs : List (List α)) : ofList xs.flatten = (List.map (⇑ofList) xs).sum

@[deprecated FreeMonoid.ofList_flatten (since := "2024-10-15")]

theorem FreeMonoid.ofList_join {α : Type u_1} (xs : List (List α)) : ofList xs.flatten = (List.map (⇑ofList) xs).prod

Alias of FreeMonoid.ofList_flatten.

@[deprecated FreeAddMonoid.ofList_flatten (since := "2024-10-15")]

theorem FreeAddMonoid.ofList_join {α : Type u_1} (xs : List (List α)) : ofList xs.flatten = (List.map (⇑ofList) xs).sum

Alias of FreeAddMonoid.ofList_flatten.

def FreeMonoid.of {α : Type u_1} (x : α) : FreeMonoid α

Embeds an element of α into FreeMonoid α as a singleton list.

Equations

• FreeMonoid.of x = FreeMonoid.ofList [x]

def FreeAddMonoid.of {α : Type u_1} (x : α) : FreeAddMonoid α

Embeds an element of α into FreeAddMonoid α as a singleton list.

Equations

• FreeAddMonoid.of x = FreeAddMonoid.ofList [x]

@[simp]

theorem FreeMonoid.toList_of {α : Type u_1} (x : α) : toList (of x) = [x]

@[simp]

theorem FreeAddMonoid.toList_of {α : Type u_1} (x : α) : toList (of x) = [x]

theorem FreeMonoid.ofList_singleton {α : Type u_1} (x : α) : ofList [x] = of x

theorem FreeAddMonoid.ofList_singleton {α : Type u_1} (x : α) : ofList [x] = of x

@[simp]

theorem FreeMonoid.ofList_cons {α : Type u_1} (x : α) (xs : List α) : ofList (x :: xs) = of x * ofList xs

@[simp]

theorem FreeAddMonoid.ofList_cons {α : Type u_1} (x : α) (xs : List α) : ofList (x :: xs) = of x + ofList xs

theorem FreeMonoid.toList_of_mul {α : Type u_1} (x : α) (xs : FreeMonoid α) : toList (of x * xs) = x :: toList xs

theorem FreeAddMonoid.toList_of_add {α : Type u_1} (x : α) (xs : FreeAddMonoid α) : toList (of x + xs) = x :: toList xs

theorem FreeMonoid.of_injective {α : Type u_1} : Function.Injective of

theorem FreeAddMonoid.of_injective {α : Type u_1} : Function.Injective of

Length

def FreeMonoid.length {α : Type u_1} (a : FreeMonoid α) : ℕ

The length of a free monoid element: 1.length = 0 and (a * b).length = a.length + b.length

Equations

• a.length = (FreeMonoid.toList a).length

def FreeAddMonoid.length {α : Type u_1} (a : FreeAddMonoid α) : ℕ

The length of an additive free monoid element: 1.length = 0 and (a + b).length = a.length + b.length

Equations

• a.length = (FreeAddMonoid.toList a).length

@[simp]

theorem FreeMonoid.length_one {α : Type u_1} : length 1 = 0

@[simp]

theorem FreeAddMonoid.length_zero {α : Type u_1} : length 0 = 0

@[simp]

theorem FreeMonoid.length_eq_zero {α : Type u_1} {a : FreeMonoid α} : a.length = 0 ↔ a = 1

@[simp]

theorem FreeAddMonoid.length_eq_zero {α : Type u_1} {a : FreeAddMonoid α} : a.length = 0 ↔ a = 0

@[simp]

theorem FreeMonoid.length_of {α : Type u_1} (m : α) : (of m).length = 1

@[simp]

theorem FreeAddMonoid.length_of {α : Type u_1} (m : α) : (of m).length = 1

theorem FreeMonoid.length_eq_one {α : Type u_1} {a : FreeMonoid α} : a.length = 1 ↔ ∃ (m : α), a = of m

theorem FreeMonoid.length_eq_two {α : Type u_1} {v : FreeMonoid α} : v.length = 2 ↔ ∃ (c : α), ∃ (d : α), v = of c * of d

theorem FreeAddMonoid.length_eq_two {α : Type u_1} {v : FreeAddMonoid α} : v.length = 2 ↔ ∃ (c : α), ∃ (d : α), v = of c + of d

theorem FreeMonoid.length_eq_three {α : Type u_1} {v : FreeMonoid α} : v.length = 3 ↔ ∃ (a : α), ∃ (b : α), ∃ (c : α), v = of a * of b * of c

theorem FreeAddMonoid.length_eq_three {α : Type u_1} {v : FreeAddMonoid α} : v.length = 3 ↔ ∃ (a : α), ∃ (b : α), ∃ (c : α), v = of a + of b + of c

@[simp]

theorem FreeMonoid.length_mul {α : Type u_1} (a b : FreeMonoid α) : (a * b).length = a.length + b.length

@[simp]

theorem FreeAddMonoid.length_add {α : Type u_1} (a b : FreeAddMonoid α) : (a + b).length = a.length + b.length

@[simp]

theorem FreeMonoid.of_ne_one {α : Type u_1} (a : α) : of a ≠ 1

@[simp]

theorem FreeAddMonoid.of_ne_zero {α : Type u_1} (a : α) : of a ≠ 0

@[simp]

theorem FreeMonoid.one_ne_of {α : Type u_1} (a : α) : 1 ≠ of a

@[simp]

theorem FreeAddMonoid.zero_ne_of {α : Type u_1} (a : α) : 0 ≠ of a

def FreeMonoid.mem {α : Type u_1} (a : FreeMonoid α) (m : α) : Prop

Membership in a free monoid element

Equations

• a.mem m = (m ∈ FreeMonoid.toList a)

def FreeAddMonoid.mem {α : Type u_1} (a : FreeAddMonoid α) (m : α) : Prop

Membership in a free monoid element

Equations

• a.mem m = (m ∈ FreeAddMonoid.toList a)

instance FreeMonoid.instMembership {α : Type u_1} : Membership α (FreeMonoid α)

Equations

• FreeMonoid.instMembership = { mem := FreeMonoid.mem }

instance FreeAddMonoid.instMembership {α : Type u_1} : Membership α (FreeAddMonoid α)

Equations

• FreeAddMonoid.instMembership = { mem := FreeAddMonoid.mem }

theorem FreeMonoid.not_mem_one {α : Type u_1} {m : α} : ¬m ∈ 1

theorem FreeAddMonoid.not_mem_zero {α : Type u_1} {m : α} : ¬m ∈ 0

@[simp]

theorem FreeMonoid.mem_of {α : Type u_1} {m n : α} : m ∈ of n ↔ m = n

@[simp]

theorem FreeAddMonoid.mem_of {α : Type u_1} {m n : α} : m ∈ of n ↔ m = n

theorem FreeMonoid.mem_of_self {α : Type u_1} {m : α} : m ∈ of m

theorem FreeAddMonoid.mem_of_self {α : Type u_1} {m : α} : m ∈ of m

@[simp]

theorem FreeMonoid.mem_mul {α : Type u_1} {m : α} {a b : FreeMonoid α} : m ∈ a * b ↔ m ∈ a ∨ m ∈ b

@[simp]

theorem FreeAddMonoid.mem_add {α : Type u_1} {m : α} {a b : FreeAddMonoid α} : m ∈ a + b ↔ m ∈ a ∨ m ∈ b

def FreeMonoid.recOn {α : Type u_1} {C : FreeMonoid α → Sort u_6} (xs : FreeMonoid α) (h0 : C 1) (ih : (x : α) → (xs : FreeMonoid α) → C xs → C (of x * xs)) : C xs

Recursor for FreeMonoid using 1 and FreeMonoid.of x * xs instead of [] and x :: xs.

Equations

• xs.recOn h0 ih = List.rec h0 ih xs

def FreeAddMonoid.recOn {α : Type u_1} {C : FreeAddMonoid α → Sort u_6} (xs : FreeAddMonoid α) (h0 : C 0) (ih : (x : α) → (xs : FreeAddMonoid α) → C xs → C (of x + xs)) : C xs

Recursor for FreeAddMonoid using 0 and FreeAddMonoid.of x + xsinstead of[]andx :: xs`.

Equations

• xs.recOn h0 ih = List.rec h0 ih xs

@[simp]

theorem FreeMonoid.recOn_one {α : Type u_1} {C : FreeMonoid α → Sort u_6} (h0 : C 1) (ih : (x : α) → (xs : FreeMonoid α) → C xs → C (of x * xs)) : recOn 1 h0 ih = h0

@[simp]

theorem FreeAddMonoid.recOn_zero {α : Type u_1} {C : FreeAddMonoid α → Sort u_6} (h0 : C 0) (ih : (x : α) → (xs : FreeAddMonoid α) → C xs → C (of x + xs)) : recOn 0 h0 ih = h0

@[simp]

theorem FreeMonoid.recOn_of_mul {α : Type u_1} {C : FreeMonoid α → Sort u_6} (x : α) (xs : FreeMonoid α) (h0 : C 1) (ih : (x : α) → (xs : FreeMonoid α) → C xs → C (of x * xs)) : (of x * xs).recOn h0 ih = ih x xs (xs.recOn h0 ih)

@[simp]

theorem FreeAddMonoid.recOn_of_add {α : Type u_1} {C : FreeAddMonoid α → Sort u_6} (x : α) (xs : FreeAddMonoid α) (h0 : C 0) (ih : (x : α) → (xs : FreeAddMonoid α) → C xs → C (of x + xs)) : (of x + xs).recOn h0 ih = ih x xs (xs.recOn h0 ih)

Induction

theorem FreeMonoid.inductionOn {α : Type u_1} {C : FreeMonoid α → Prop} (z : FreeMonoid α) (one : C 1) (of : ∀ (x : α), C (of x)) (mul : ∀ (x y : FreeMonoid α), C x → C y → C (x * y)) : C z

An induction principle on free monoids, with cases for 1, FreeMonoid.of and *.

theorem FreeAddMonoid.inductionOn {α : Type u_1} {C : FreeAddMonoid α → Prop} (z : FreeAddMonoid α) (one : C 0) (of : ∀ (x : α), C (of x)) (mul : ∀ (x y : FreeAddMonoid α), C x → C y → C (x + y)) : C z

An induction principle on free monoids, with cases for 0, FreeAddMonoid.of and +.

theorem FreeMonoid.inductionOn' {α : Type u_1} {p : FreeMonoid α → Prop} (a : FreeMonoid α) (one : p 1) (mul_of : ∀ (b : α) (a : FreeMonoid α), p a → p (of b * a)) : p a

An induction principle for free monoids which mirrors induction on lists, with cases analogous to the empty list and cons

theorem FreeAddMonoid.inductionOn' {α : Type u_1} {p : FreeAddMonoid α → Prop} (a : FreeAddMonoid α) (one : p 0) (mul_of : ∀ (b : α) (a : FreeAddMonoid α), p a → p (of b + a)) : p a

An induction principle for free monoids which mirrors induction on lists, with cases analogous to the empty list and cons

def FreeMonoid.casesOn {α : Type u_1} {C : FreeMonoid α → Sort u_6} (xs : FreeMonoid α) (h0 : C 1) (ih : (x : α) → (xs : FreeMonoid α) → C (of x * xs)) : C xs

A version of List.cases_on for FreeMonoid using 1 and FreeMonoid.of x * xs instead of [] and x :: xs.

Equations

• xs.casesOn h0 ih = List.casesOn xs h0 ih

def FreeAddMonoid.casesOn {α : Type u_1} {C : FreeAddMonoid α → Sort u_6} (xs : FreeAddMonoid α) (h0 : C 0) (ih : (x : α) → (xs : FreeAddMonoid α) → C (of x + xs)) : C xs

A version of List.casesOn for FreeAddMonoid using 0 and FreeAddMonoid.of x + xs instead of [] and x :: xs.

Equations

• xs.casesOn h0 ih = List.casesOn xs h0 ih

@[simp]

theorem FreeMonoid.casesOn_one {α : Type u_1} {C : FreeMonoid α → Sort u_6} (h0 : C 1) (ih : (x : α) → (xs : FreeMonoid α) → C (of x * xs)) : casesOn 1 h0 ih = h0

@[simp]

theorem FreeAddMonoid.casesOn_zero {α : Type u_1} {C : FreeAddMonoid α → Sort u_6} (h0 : C 0) (ih : (x : α) → (xs : FreeAddMonoid α) → C (of x + xs)) : casesOn 0 h0 ih = h0

@[simp]

theorem FreeMonoid.casesOn_of_mul {α : Type u_1} {C : FreeMonoid α → Sort u_6} (x : α) (xs : FreeMonoid α) (h0 : C 1) (ih : (x : α) → (xs : FreeMonoid α) → C (of x * xs)) : (of x * xs).casesOn h0 ih = ih x xs

@[simp]

theorem FreeAddMonoid.casesOn_of_add {α : Type u_1} {C : FreeAddMonoid α → Sort u_6} (x : α) (xs : FreeAddMonoid α) (h0 : C 0) (ih : (x : α) → (xs : FreeAddMonoid α) → C (of x + xs)) : (of x + xs).casesOn h0 ih = ih x xs

theorem FreeAddMonoid.hom_eq {α : Type u_1} {M : Type u_4} [AddMonoid M] ⦃f g : FreeAddMonoid α →+ M⦄ (h : ∀ (x : α), f (of x) = g (of x)) : f = g

theorem FreeMonoid.hom_eq {α : Type u_1} {M : Type u_4} [Monoid M] ⦃f g : FreeMonoid α →* M⦄ (h : ∀ (x : α), f (of x) = g (of x)) : f = g

def FreeMonoid.prodAux {M : Type u_6} [Monoid M] : List M → M

A variant of List.prod that has [x].prod = x true definitionally. The purpose is to make FreeMonoid.lift_eval_of true by rfl.

Equations

• FreeMonoid.prodAux [] = 1
• FreeMonoid.prodAux (x_1 :: xs) = List.foldl (fun (x1 x2 : M) => x1 * x2) x_1 xs

def FreeAddMonoid.sumAux {M : Type u_6} [AddMonoid M] : List M → M

A variant of List.sum that has [x].sum = x true definitionally. The purpose is to make FreeAddMonoid.lift_eval_of true by rfl.

Equations

• FreeAddMonoid.sumAux [] = 0
• FreeAddMonoid.sumAux (x_1 :: xs) = List.foldl (fun (x1 x2 : M) => x1 + x2) x_1 xs

theorem FreeMonoid.prodAux_eq {M : Type u_4} [Monoid M] (l : List M) : prodAux l = l.prod

theorem FreeAddMonoid.sumAux_eq {M : Type u_4} [AddMonoid M] (l : List M) : sumAux l = l.sum

def FreeMonoid.lift {α : Type u_1} {M : Type u_4} [Monoid M] : (α → M) ≃ (FreeMonoid α →* M)

Equivalence between maps α → M and monoid homomorphisms FreeMonoid α →* M.

Equations

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

def FreeAddMonoid.lift {α : Type u_1} {M : Type u_4} [AddMonoid M] : (α → M) ≃ (FreeAddMonoid α →+ M)

Equivalence between maps α → A and additive monoid homomorphisms FreeAddMonoid α →+ A.

Equations

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

@[simp]

theorem FreeMonoid.lift_ofList {α : Type u_1} {M : Type u_4} [Monoid M] (f : α → M) (l : List α) : (lift f) (ofList l) = (List.map f l).prod

@[simp]

theorem FreeAddMonoid.lift_ofList {α : Type u_1} {M : Type u_4} [AddMonoid M] (f : α → M) (l : List α) : (lift f) (ofList l) = (List.map f l).sum

@[simp]

theorem FreeMonoid.lift_symm_apply {α : Type u_1} {M : Type u_4} [Monoid M] (f : FreeMonoid α →* M) : lift.symm f = ⇑f ∘ of

@[simp]

theorem FreeAddMonoid.lift_symm_apply {α : Type u_1} {M : Type u_4} [AddMonoid M] (f : FreeAddMonoid α →+ M) : lift.symm f = ⇑f ∘ of

theorem FreeMonoid.lift_apply {α : Type u_1} {M : Type u_4} [Monoid M] (f : α → M) (l : FreeMonoid α) : (lift f) l = (List.map f (toList l)).prod

theorem FreeAddMonoid.lift_apply {α : Type u_1} {M : Type u_4} [AddMonoid M] (f : α → M) (l : FreeAddMonoid α) : (lift f) l = (List.map f (toList l)).sum

theorem FreeMonoid.lift_comp_of {α : Type u_1} {M : Type u_4} [Monoid M] (f : α → M) : ⇑(lift f) ∘ of = f

theorem FreeAddMonoid.lift_comp_of {α : Type u_1} {M : Type u_4} [AddMonoid M] (f : α → M) : ⇑(lift f) ∘ of = f

@[simp]

theorem FreeMonoid.lift_eval_of {α : Type u_1} {M : Type u_4} [Monoid M] (f : α → M) (x : α) : (lift f) (of x) = f x

@[simp]

theorem FreeAddMonoid.lift_eval_of {α : Type u_1} {M : Type u_4} [AddMonoid M] (f : α → M) (x : α) : (lift f) (of x) = f x

@[simp]

theorem FreeMonoid.lift_restrict {α : Type u_1} {M : Type u_4} [Monoid M] (f : FreeMonoid α →* M) : lift (⇑f ∘ of) = f

@[simp]

theorem FreeAddMonoid.lift_restrict {α : Type u_1} {M : Type u_4} [AddMonoid M] (f : FreeAddMonoid α →+ M) : lift (⇑f ∘ of) = f

theorem FreeMonoid.comp_lift {α : Type u_1} {M : Type u_4} [Monoid M] {N : Type u_5} [Monoid N] (g : M →* N) (f : α → M) : g.comp (lift f) = lift (⇑g ∘ f)

theorem FreeAddMonoid.comp_lift {α : Type u_1} {M : Type u_4} [AddMonoid M] {N : Type u_5} [AddMonoid N] (g : M →+ N) (f : α → M) : g.comp (lift f) = lift (⇑g ∘ f)

theorem FreeMonoid.hom_map_lift {α : Type u_1} {M : Type u_4} [Monoid M] {N : Type u_5} [Monoid N] (g : M →* N) (f : α → M) (x : FreeMonoid α) : g ((lift f) x) = (lift (⇑g ∘ f)) x

theorem FreeAddMonoid.hom_map_lift {α : Type u_1} {M : Type u_4} [AddMonoid M] {N : Type u_5} [AddMonoid N] (g : M →+ N) (f : α → M) (x : FreeAddMonoid α) : g ((lift f) x) = (lift (⇑g ∘ f)) x

def FreeMonoid.mkMulAction {α : Type u_1} {β : Type u_2} (f : α → β → β) : MulAction (FreeMonoid α) β

Define a multiplicative action of FreeMonoid α on β.

Equations

• FreeMonoid.mkMulAction f = MulAction.mk ⋯ ⋯

def FreeAddMonoid.mkAddAction {α : Type u_1} {β : Type u_2} (f : α → β → β) : AddAction (FreeAddMonoid α) β

Define an additive action of FreeAddMonoid α on β.

Equations

• FreeAddMonoid.mkAddAction f = AddAction.mk ⋯ ⋯

theorem FreeMonoid.smul_def {α : Type u_1} {β : Type u_2} (f : α → β → β) (l : FreeMonoid α) (b : β) : l • b = List.foldr f b (toList l)

theorem FreeAddMonoid.vadd_def {α : Type u_1} {β : Type u_2} (f : α → β → β) (l : FreeAddMonoid α) (b : β) : l +ᵥ b = List.foldr f b (toList l)

theorem FreeMonoid.ofList_smul {α : Type u_1} {β : Type u_2} (f : α → β → β) (l : List α) (b : β) : ofList l • b = List.foldr f b l

theorem FreeAddMonoid.ofList_vadd {α : Type u_1} {β : Type u_2} (f : α → β → β) (l : List α) (b : β) : ofList l +ᵥ b = List.foldr f b l

@[simp]

theorem FreeMonoid.of_smul {α : Type u_1} {β : Type u_2} (f : α → β → β) (x : α) (y : β) : of x • y = f x y

@[simp]

theorem FreeAddMonoid.of_vadd {α : Type u_1} {β : Type u_2} (f : α → β → β) (x : α) (y : β) : of x +ᵥ y = f x y

map

def FreeMonoid.map {α : Type u_1} {β : Type u_2} (f : α → β) : FreeMonoid α →* FreeMonoid β

The unique monoid homomorphism FreeMonoid α →* FreeMonoid β that sends each of x to of (f x).

Equations

• FreeMonoid.map f = { toFun := fun (l : FreeMonoid α) => FreeMonoid.ofList (List.map f (FreeMonoid.toList l)), map_one' := ⋯, map_mul' := ⋯ }

def FreeAddMonoid.map {α : Type u_1} {β : Type u_2} (f : α → β) : FreeAddMonoid α →+ FreeAddMonoid β

The unique additive monoid homomorphism FreeAddMonoid α →+ FreeAddMonoid β that sends each of x to of (f x).

Equations

• FreeAddMonoid.map f = { toFun := fun (l : FreeAddMonoid α) => FreeAddMonoid.ofList (List.map f (FreeAddMonoid.toList l)), map_zero' := ⋯, map_add' := ⋯ }

@[simp]

theorem FreeMonoid.map_of {α : Type u_1} {β : Type u_2} (f : α → β) (x : α) : (map f) (of x) = of (f x)

@[simp]

theorem FreeAddMonoid.map_of {α : Type u_1} {β : Type u_2} (f : α → β) (x : α) : (map f) (of x) = of (f x)

theorem FreeMonoid.mem_map {α : Type u_1} {β : Type u_2} {f : α → β} {a : FreeMonoid α} {m : β} : m ∈ (map f) a ↔ ∃ (n : α), n ∈ a ∧ f n = m

theorem FreeAddMonoid.mem_map {α : Type u_1} {β : Type u_2} {f : α → β} {a : FreeAddMonoid α} {m : β} : m ∈ (map f) a ↔ ∃ (n : α), n ∈ a ∧ f n = m

theorem FreeMonoid.map_map {α : Type u_1} {β : Type u_2} {f : α → β} {α₁ : Type u_6} {g : α₁ → α} {x : FreeMonoid α₁} : (map f) ((map g) x) = (map (f ∘ g)) x

theorem FreeAddMonoid.map_map {α : Type u_1} {β : Type u_2} {f : α → β} {α₁ : Type u_6} {g : α₁ → α} {x : FreeAddMonoid α₁} : (map f) ((map g) x) = (map (f ∘ g)) x

theorem FreeMonoid.toList_map {α : Type u_1} {β : Type u_2} (f : α → β) (xs : FreeMonoid α) : toList ((map f) xs) = List.map f (toList xs)

theorem FreeAddMonoid.toList_map {α : Type u_1} {β : Type u_2} (f : α → β) (xs : FreeAddMonoid α) : toList ((map f) xs) = List.map f (toList xs)

theorem FreeMonoid.ofList_map {α : Type u_1} {β : Type u_2} (f : α → β) (xs : List α) : ofList (List.map f xs) = (map f) (ofList xs)

theorem FreeAddMonoid.ofList_map {α : Type u_1} {β : Type u_2} (f : α → β) (xs : List α) : ofList (List.map f xs) = (map f) (ofList xs)

theorem FreeMonoid.lift_of_comp_eq_map {α : Type u_1} {β : Type u_2} (f : α → β) : (lift fun (x : α) => of (f x)) = map f

theorem FreeAddMonoid.lift_of_comp_eq_map {α : Type u_1} {β : Type u_2} (f : α → β) : (lift fun (x : α) => of (f x)) = map f

theorem FreeMonoid.map_comp {α : Type u_1} {β : Type u_2} {γ : Type u_3} (g : β → γ) (f : α → β) : map (g ∘ f) = (map g).comp (map f)

theorem FreeAddMonoid.map_comp {α : Type u_1} {β : Type u_2} {γ : Type u_3} (g : β → γ) (f : α → β) : map (g ∘ f) = (map g).comp (map f)

@[simp]

theorem FreeMonoid.map_id {α : Type u_1} : map id = MonoidHom.id (FreeMonoid α)

@[simp]

theorem FreeAddMonoid.map_id {α : Type u_1} : map id = AddMonoidHom.id (FreeAddMonoid α)

@[simp]

theorem FreeMonoid.map_symm_apply_map_eq {α : Type u_1} {β : Type u_2} {x : FreeMonoid α} (e : α ≃ β) : (map ⇑e.symm) ((map ⇑e) x) = x

@[simp]

theorem FreeAddMonoid.map_symm_apply_map_eq {α : Type u_1} {β : Type u_2} {x : FreeAddMonoid α} (e : α ≃ β) : (map ⇑e.symm) ((map ⇑e) x) = x

@[simp]

theorem FreeMonoid.map_apply_map_symm_eq {α : Type u_1} {β : Type u_2} {x : FreeMonoid β} (e : α ≃ β) : (map ⇑e) ((map ⇑e.symm) x) = x

@[simp]

theorem FreeAddMonoid.map_apply_map_symm_eq {α : Type u_1} {β : Type u_2} {x : FreeAddMonoid β} (e : α ≃ β) : (map ⇑e) ((map ⇑e.symm) x) = x

instance FreeMonoid.uniqueUnits {α : Type u_1} : Unique (FreeMonoid α)ˣ

The only invertible element of the free monoid is 1; this instance enables units_eq_one.

Equations

• FreeMonoid.uniqueUnits = { toInhabited := Units.instInhabited, uniq := ⋯ }

instance FreeAddMonoid.uniqueAddUnits {α : Type u_1} : Unique (AddUnits (FreeAddMonoid α))

Equations

• FreeAddMonoid.uniqueAddUnits = { toInhabited := AddUnits.instInhabited, uniq := ⋯ }

@[simp]

theorem FreeMonoid.map_surjective {α : Type u_1} {β : Type u_2} {f : α → β} : Function.Surjective ⇑(map f) ↔ Function.Surjective f

@[simp]

theorem FreeAddMonoid.map_surjective {α : Type u_1} {β : Type u_2} {f : α → β} : Function.Surjective ⇑(map f) ↔ Function.Surjective f

reverse

def FreeMonoid.reverse {α : Type u_1} : FreeMonoid α → FreeMonoid α

reverses the symbols in a free monoid element

Equations

• FreeMonoid.reverse = List.reverse

def FreeAddMonoid.reverse {α : Type u_1} : FreeAddMonoid α → FreeAddMonoid α

reverses the symbols in an additive free monoid element

Equations

• FreeAddMonoid.reverse = List.reverse

@[simp]

theorem FreeMonoid.reverse_of {α : Type u_1} (a : α) : (of a).reverse = of a

@[simp]

theorem FreeAddMonoid.reverse_of {α : Type u_1} (a : α) : (of a).reverse = of a

theorem FreeMonoid.reverse_mul {α : Type u_1} {a b : FreeMonoid α} : (a * b).reverse = b.reverse * a.reverse

theorem FreeAddMonoid.reverse_add {α : Type u_1} {a b : FreeAddMonoid α} : (a + b).reverse = b.reverse + a.reverse

@[simp]

theorem FreeMonoid.reverse_reverse {α : Type u_1} {a : FreeMonoid α} : a.reverse.reverse = a

@[simp]

theorem FreeAddMonoid.reverse_reverse {α : Type u_1} {a : FreeAddMonoid α} : a.reverse.reverse = a

@[simp]

theorem FreeMonoid.length_reverse {α : Type u_1} {a : FreeMonoid α} : a.reverse.length = a.length

@[simp]

theorem FreeAddMonoid.length_reverse {α : Type u_1} {a : FreeAddMonoid α} : a.reverse.length = a.length

def FreeMonoid.freeMonoidCongr {α : Type u_6} {β : Type u_7} (e : α ≃ β) : FreeMonoid α ≃* FreeMonoid β

free monoids over isomorphic types are isomorphic

Equations

• FreeMonoid.freeMonoidCongr e = { toFun := ⇑(FreeMonoid.map ⇑e), invFun := ⇑(FreeMonoid.map ⇑e.symm), left_inv := ⋯, right_inv := ⋯, map_mul' := ⋯ }

def FreeAddMonoid.freeAddMonoidCongr {α : Type u_6} {β : Type u_7} (e : α ≃ β) : FreeAddMonoid α ≃+ FreeAddMonoid β

if two types are isomorphic, the additive free monoids over those types are isomorphic

Equations

• FreeAddMonoid.freeAddMonoidCongr e = { toFun := ⇑(FreeAddMonoid.map ⇑e), invFun := ⇑(FreeAddMonoid.map ⇑e.symm), left_inv := ⋯, right_inv := ⋯, map_add' := ⋯ }

@[simp]

theorem FreeMonoid.freeMonoidCongr_of {α : Type u_6} {β : Type u_7} (e : α ≃ β) (a : α) : (freeMonoidCongr e) (of a) = of (e a)

@[simp]

theorem FreeAddMonoid.freeAddMonoidCongr_of {α : Type u_6} {β : Type u_7} (e : α ≃ β) (a : α) : (freeAddMonoidCongr e) (of a) = of (e a)

@[simp]

theorem FreeMonoid.freeMonoidCongr_symm_of {α : Type u_6} {β : Type u_7} (e : α ≃ β) (b : β) : (freeMonoidCongr e.symm) (of b) = of (e.symm b)

@[simp]

theorem FreeAddMonoid.freeAddMonoidCongr_symm_of {α : Type u_6} {β : Type u_7} (e : α ≃ β) (b : β) : (freeAddMonoidCongr e.symm) (of b) = of (e.symm b)