Documentation

Mathlib.Algebra.TotalMonoidAlgebra.Defs

Total Monoid Algebras #

This file mirrors the construction in MonoidAlgebra/Defs.lean, but drops the finiteness condition on the support of the elements. In the literature, this construction is called the "large algebra of a monoid" or "total algebra" (see https://en.wikipedia.org/wiki/Total_algebra). When the underlying monoid is finitely supported functions valued in ℕ, this construction corresponds to the multivariate formal power series in the large sense, where arbitrary infinite sums of monomials are permitted.

structure TotalAddMonoidAlgebra (R : Type u_1) (M : Type u_2) [Semiring R] :
Type (max u_1 u_2)

The additive total monoid algebra over a semiring R generated by the additive monoid M.

It is the type of all formal R-linear combinations of terms of M, endowed with the convolution product.

  • ofCoeff :: (
    • coeff : M → R

      The coefficients M → R of an element of the total additive monoid algebra R⟦M⟧.

  • )
Instances For
    structure TotalMonoidAlgebra (R : Type u_1) (M : Type u_2) [Semiring R] :
    Type (max u_1 u_2)

    The total monoid algebra over a semiring R generated by the monoid M.

    It is the type of all formal R-linear combinations of terms of M, endowed with the convolution product.

    • ofCoeff :: (
      • coeff : M → R

        The coefficients M → R of an element of the total monoid algebra R⟦M⟧.

    • )
    Instances For

      The additive total monoid algebra over a semiring R generated by the additive monoid M.

      It is the type of all formal R-linear combinations of terms of M, endowed with the convolution product.

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

        Unexpander for TotalAddMonoidAlgebra.

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

          The total monoid algebra over a semiring R generated by the monoid M.

          It is the type of all formal R-linear combinations of terms of M, endowed with the convolution product.

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

            Unexpander for TotalMonoidAlgebra.

            Equations
            • One or more equations did not get rendered due to their size.
            Instances For
              theorem TotalMonoidAlgebra.coeff_ofCoeff {R : Type u_1} {M : Type u_2} [Semiring R] (x : M → R) :
              theorem TotalAddMonoidAlgebra.coeff_ofCoeff {R : Type u_1} {M : Type u_2} [Semiring R] (x : M → R) :
              def TotalMonoidAlgebra.coeffEquiv {R : Type u_1} {M : Type u_2} [Semiring R] :
              TotalMonoidAlgebra R M ≃ (M → R)

              TotalMonoidAlgebra.coeff as an equiv.

              Equations
              Instances For
                def TotalAddMonoidAlgebra.coeffEquiv {R : Type u_1} {M : Type u_2} [Semiring R] :

                TotalAddMonoidAlgebra.coeff as an equiv.

                Equations
                Instances For
                  @[simp]
                  theorem TotalMonoidAlgebra.coeffEquiv_symm_apply {R : Type u_1} {M : Type u_2} [Semiring R] (coeff : M → R) :
                  coeffEquiv.symm coeff = ofCoeff coeff
                  @[simp]
                  theorem TotalAddMonoidAlgebra.coeffEquiv_symm_apply {R : Type u_1} {M : Type u_2} [Semiring R] (coeff : M → R) :
                  coeffEquiv.symm coeff = ofCoeff coeff
                  @[simp]
                  theorem TotalMonoidAlgebra.forall {R : Type u_1} {M : Type u_2} [Semiring R] {P : TotalMonoidAlgebra R M → Prop} :
                  (∀ (p : TotalMonoidAlgebra R M), P p) ↔ ∀ (q : M → R), P (ofCoeff q)
                  theorem TotalAddMonoidAlgebra.forall {R : Type u_1} {M : Type u_2} [Semiring R] {P : TotalAddMonoidAlgebra R M → Prop} :
                  (∀ (p : TotalAddMonoidAlgebra R M), P p) ↔ ∀ (q : M → R), P (ofCoeff q)
                  theorem TotalMonoidAlgebra.exists {R : Type u_1} {M : Type u_2} [Semiring R] {P : TotalMonoidAlgebra R M → Prop} :
                  (∃ (p : TotalMonoidAlgebra R M), P p) ↔ ∃ (q : M → R), P (ofCoeff q)
                  theorem TotalAddMonoidAlgebra.exists {R : Type u_1} {M : Type u_2} [Semiring R] {P : TotalAddMonoidAlgebra R M → Prop} :
                  (∃ (p : TotalAddMonoidAlgebra R M), P p) ↔ ∃ (q : M → R), P (ofCoeff q)
                  @[simp]
                  theorem TotalMonoidAlgebra.coeff_inj {R : Type u_1} {M : Type u_2} [Semiring R] {x y : TotalMonoidAlgebra R M} :
                  x.coeff = y.coeff ↔ x = y
                  @[simp]
                  theorem TotalAddMonoidAlgebra.coeff_inj {R : Type u_1} {M : Type u_2} [Semiring R] {x y : TotalAddMonoidAlgebra R M} :
                  x.coeff = y.coeff ↔ x = y
                  theorem TotalMonoidAlgebra.ofCoeff_inj {R : Type u_1} {M : Type u_2} [Semiring R] {x y : M → R} :
                  theorem TotalAddMonoidAlgebra.ofCoeff_inj {R : Type u_1} {M : Type u_2} [Semiring R] {x y : M → R} :
                  theorem TotalMonoidAlgebra.ext {R : Type u_1} {M : Type u_2} [Semiring R] {x y : TotalMonoidAlgebra R M} :
                  x.coeff = y.coeff → x = y

                  Alias of the forward direction of TotalMonoidAlgebra.coeff_inj.

                  theorem TotalAddMonoidAlgebra.ext {R : Type u_1} {M : Type u_2} [Semiring R] {x y : TotalAddMonoidAlgebra R M} :
                  x.coeff = y.coeff → x = y

                  Alias of the forward direction of TotalAddMonoidAlgebra.coeff_inj.

                  theorem TotalAddMonoidAlgebra.ext_iff {R : Type u_1} {M : Type u_2} [Semiring R] {x y : TotalAddMonoidAlgebra R M} :
                  x = y ↔ x.coeff = y.coeff
                  theorem TotalMonoidAlgebra.ext_iff {R : Type u_1} {M : Type u_2} [Semiring R] {x y : TotalMonoidAlgebra R M} :
                  x = y ↔ x.coeff = y.coeff
                  @[instance_reducible]
                  Equations
                  @[instance_reducible]
                  Equations
                  @[instance_reducible]
                  Equations
                  • One or more equations did not get rendered due to their size.
                  @[instance_reducible]
                  Equations
                  • One or more equations did not get rendered due to their size.
                  @[instance_reducible]
                  Equations
                  @[simp]
                  theorem TotalMonoidAlgebra.coeffAddEquiv_symm_apply {R : Type u_1} {M : Type u_2} [Semiring R] (coeff : M → R) :
                  @[simp]
                  theorem TotalMonoidAlgebra.coeffAddEquiv_apply {R : Type u_1} {M : Type u_2} [Semiring R] (self : TotalMonoidAlgebra R M) (a✝ : M) :
                  coeffAddEquiv self a✝ = self.coeff a✝
                  @[simp]
                  theorem TotalAddMonoidAlgebra.coeffAddEquiv_apply {R : Type u_1} {M : Type u_2} [Semiring R] (self : TotalAddMonoidAlgebra R M) (a✝ : M) :
                  coeffAddEquiv self a✝ = self.coeff a✝
                  @[simp]
                  theorem TotalAddMonoidAlgebra.coeffAddEquiv_symm_apply {R : Type u_1} {M : Type u_2} [Semiring R] (coeff : M → R) :
                  @[simp]
                  theorem TotalMonoidAlgebra.coeff_zero {R : Type u_1} {M : Type u_2} [Semiring R] :
                  coeff 0 = 0
                  @[simp]
                  theorem TotalAddMonoidAlgebra.coeff_zero {R : Type u_1} {M : Type u_2} [Semiring R] :
                  coeff 0 = 0
                  @[simp]
                  theorem TotalMonoidAlgebra.ofCoeff_zero {R : Type u_1} {M : Type u_2} [Semiring R] :
                  @[simp]
                  theorem TotalAddMonoidAlgebra.ofCoeff_zero {R : Type u_1} {M : Type u_2} [Semiring R] :
                  @[simp]
                  theorem TotalMonoidAlgebra.coeff_eq_zero {R : Type u_1} {M : Type u_2} [Semiring R] {x : TotalMonoidAlgebra R M} :
                  x.coeff = 0 ↔ x = 0
                  @[simp]
                  theorem TotalAddMonoidAlgebra.coeff_eq_zero {R : Type u_1} {M : Type u_2} [Semiring R] {x : TotalAddMonoidAlgebra R M} :
                  x.coeff = 0 ↔ x = 0
                  @[simp]
                  theorem TotalMonoidAlgebra.ofCoeff_eq_zero {R : Type u_1} {M : Type u_2} [Semiring R] {x : M → R} :
                  ofCoeff x = 0 ↔ x = 0
                  @[simp]
                  theorem TotalAddMonoidAlgebra.ofCoeff_eq_zero {R : Type u_1} {M : Type u_2} [Semiring R] {x : M → R} :
                  ofCoeff x = 0 ↔ x = 0
                  @[simp]
                  theorem TotalMonoidAlgebra.coeff_add {R : Type u_1} {M : Type u_2} [Semiring R] (x y : TotalMonoidAlgebra R M) :
                  (x + y).coeff = x.coeff + y.coeff
                  @[simp]
                  theorem TotalAddMonoidAlgebra.coeff_add {R : Type u_1} {M : Type u_2} [Semiring R] (x y : TotalAddMonoidAlgebra R M) :
                  (x + y).coeff = x.coeff + y.coeff
                  @[simp]
                  theorem TotalMonoidAlgebra.ofCoeff_add {R : Type u_1} {M : Type u_2} [Semiring R] (x y : M → R) :
                  @[simp]
                  theorem TotalAddMonoidAlgebra.ofCoeff_add {R : Type u_1} {M : Type u_2} [Semiring R] (x y : M → R) :
                  @[simp]
                  theorem TotalMonoidAlgebra.coeff_sum {R : Type u_1} {M : Type u_2} {ι : Type u_5} [Semiring R] (s : Finset ι) (f : ι → TotalMonoidAlgebra R M) :
                  (∑ i ∈ s, f i).coeff = ∑ i ∈ s, (f i).coeff
                  @[simp]
                  theorem TotalAddMonoidAlgebra.coeff_sum {R : Type u_1} {M : Type u_2} {ι : Type u_5} [Semiring R] (s : Finset ι) (f : ι → TotalAddMonoidAlgebra R M) :
                  (∑ i ∈ s, f i).coeff = ∑ i ∈ s, (f i).coeff
                  @[simp]
                  theorem TotalMonoidAlgebra.ofCoeff_sum {R : Type u_1} {M : Type u_2} {ι : Type u_5} [Semiring R] (s : Finset ι) (f : ι → M → R) :
                  ofCoeff (∑ i ∈ s, f i) = ∑ i ∈ s, ofCoeff (f i)
                  @[simp]
                  theorem TotalAddMonoidAlgebra.ofCoeff_sum {R : Type u_1} {M : Type u_2} {ι : Type u_5} [Semiring R] (s : Finset ι) (f : ι → M → R) :
                  ofCoeff (∑ i ∈ s, f i) = ∑ i ∈ s, ofCoeff (f i)
                  @[simp]
                  theorem TotalMonoidAlgebra.coeff_finsuppSum {R : Type u_1} {M : Type u_2} {N : Type u_3} {ι : Type u_5} [Semiring R] [AddCommMonoid N] (f : ι →₀ N) (g : ι → N → TotalMonoidAlgebra R M) :
                  (f.sum g).coeff = f.sum fun (i : ι) (n : N) => (g i n).coeff
                  @[simp]
                  theorem TotalAddMonoidAlgebra.coeff_finsuppSum {R : Type u_1} {M : Type u_2} {N : Type u_3} {ι : Type u_5} [Semiring R] [AddCommMonoid N] (f : ι →₀ N) (g : ι → N → TotalAddMonoidAlgebra R M) :
                  (f.sum g).coeff = f.sum fun (i : ι) (n : N) => (g i n).coeff
                  @[simp]
                  theorem TotalMonoidAlgebra.ofCoeff_finsuppSum {R : Type u_1} {M : Type u_2} {N : Type u_3} {ι : Type u_5} [Semiring R] [AddCommMonoid N] (f : ι →₀ N) (g : ι → N → M → R) :
                  ofCoeff (f.sum g) = f.sum fun (i : ι) (n : N) => ofCoeff (g i n)
                  @[simp]
                  theorem TotalAddMonoidAlgebra.ofCoeff_finsuppSum {R : Type u_1} {M : Type u_2} {N : Type u_3} {ι : Type u_5} [Semiring R] [AddCommMonoid N] (f : ι →₀ N) (g : ι → N → M → R) :
                  ofCoeff (f.sum g) = f.sum fun (i : ι) (n : N) => ofCoeff (g i n)
                  def TotalMonoidAlgebra.single {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] (m : M) (r : R) :

                  TotalMonoidAlgebra.single m r for m : M, r : R is the element rm : R⟦M⟧.

                  Equations
                  Instances For
                    def TotalAddMonoidAlgebra.single {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] (m : M) (r : R) :

                    TotalAddMonoidAlgebra.single m r for m : M, r : R is the element rm : R⟦M⟧.

                    Equations
                    Instances For
                      @[simp]
                      theorem TotalMonoidAlgebra.coeff_single {R : Type u_1} {M : Type u_2} [Semiring R] (m : M) (r : R) [DecidableEq M] :
                      @[simp]
                      theorem TotalAddMonoidAlgebra.coeff_single {R : Type u_1} {M : Type u_2} [Semiring R] (m : M) (r : R) [DecidableEq M] :
                      @[simp]
                      theorem TotalMonoidAlgebra.ofCoeff_single {R : Type u_1} {M : Type u_2} [Semiring R] (m : M) (r : R) [DecidableEq M] :
                      @[simp]
                      theorem TotalAddMonoidAlgebra.ofCoeff_single {R : Type u_1} {M : Type u_2} [Semiring R] (m : M) (r : R) [DecidableEq M] :
                      theorem TotalMonoidAlgebra.single_inj {R : Type u_1} {M : Type u_2} [Semiring R] {r₁ r₂ : R} {m₁ m₂ : M} [DecidableEq M] :
                      single m₁ r₁ = single m₂ r₂ ↔ m₁ = m₂ ∧ r₁ = r₂ ∨ r₁ = 0 ∧ r₂ = 0
                      theorem TotalAddMonoidAlgebra.single_inj {R : Type u_1} {M : Type u_2} [Semiring R] {r₁ r₂ : R} {m₁ m₂ : M} [DecidableEq M] :
                      single m₁ r₁ = single m₂ r₂ ↔ m₁ = m₂ ∧ r₁ = r₂ ∨ r₁ = 0 ∧ r₂ = 0
                      theorem TotalMonoidAlgebra.single_left_inj {R : Type u_1} {M : Type u_2} [Semiring R] {r : R} {m₁ m₂ : M} [DecidableEq M] (hr : r ≠ 0) :
                      single m₁ r = single m₂ r ↔ m₁ = m₂
                      theorem TotalAddMonoidAlgebra.single_left_inj {R : Type u_1} {M : Type u_2} [Semiring R] {r : R} {m₁ m₂ : M} [DecidableEq M] (hr : r ≠ 0) :
                      single m₁ r = single m₂ r ↔ m₁ = m₂
                      @[simp]
                      theorem TotalMonoidAlgebra.single_right_inj {R : Type u_1} {M : Type u_2} [Semiring R] {r₁ r₂ : R} {m : M} [DecidableEq M] :
                      single m r₁ = single m r₂ ↔ r₁ = r₂
                      @[simp]
                      theorem TotalAddMonoidAlgebra.single_right_inj {R : Type u_1} {M : Type u_2} [Semiring R] {r₁ r₂ : R} {m : M} [DecidableEq M] :
                      single m r₁ = single m r₂ ↔ r₁ = r₂
                      theorem TotalMonoidAlgebra.single_left_injective {R : Type u_1} {M : Type u_2} [Semiring R] {r : R} [DecidableEq M] (hr : r ≠ 0) :
                      Function.Injective fun (m : M) => single m r

                      TotalMonoidAlgebra.single m r is injective in m if r ≠ 0. For injectivity in r, see TotalMonoidAlgebra.single_right_injective.

                      theorem TotalAddMonoidAlgebra.single_left_injective {R : Type u_1} {M : Type u_2} [Semiring R] {r : R} [DecidableEq M] (hr : r ≠ 0) :
                      Function.Injective fun (m : M) => single m r

                      TotalAddMonoidAlgebra.single m r is injective in m if r ≠ 0. For injectivity in r, see TotalAddMonoidAlgebra.single_right_injective.

                      def TotalMonoidAlgebra.update {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] (m : M) (r : R) (x : TotalMonoidAlgebra R M) :

                      Replace the m-th coefficient of an element x of the total monoid algebra by a given value r : R.

                      Equations
                      Instances For
                        def TotalAddMonoidAlgebra.update {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] (m : M) (r : R) (x : TotalAddMonoidAlgebra R M) :

                        Replace the m-th coefficient of an element x of the total additive monoid algebra by a given value r : R.

                        Equations
                        Instances For
                          @[simp]
                          theorem TotalMonoidAlgebra.coeff_update {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] (m : M) (r : R) (x : TotalMonoidAlgebra R M) :
                          @[simp]
                          theorem TotalAddMonoidAlgebra.coeff_update {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] (m : M) (r : R) (x : TotalAddMonoidAlgebra R M) :
                          @[simp]
                          theorem TotalMonoidAlgebra.ofCoeff_update {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] (m : M) (r : R) (x : M → R) :
                          @[simp]
                          theorem TotalAddMonoidAlgebra.ofCoeff_update {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] (m : M) (r : R) (x : M → R) :
                          @[instance_reducible]
                          instance TotalMonoidAlgebra.smulZeroClass {R : Type u_1} {M : Type u_2} [Semiring R] {A : Type u_6} [SMulZeroClass A R] :
                          Equations
                          • One or more equations did not get rendered due to their size.
                          @[instance_reducible]
                          Equations
                          • One or more equations did not get rendered due to their size.
                          @[simp]
                          theorem TotalMonoidAlgebra.coeff_smul {R : Type u_1} {M : Type u_2} [Semiring R] {A : Type u_6} [SMulZeroClass A R] (a : A) (x : TotalMonoidAlgebra R M) :
                          (a • x).coeff = a • x.coeff
                          @[simp]
                          theorem TotalAddMonoidAlgebra.coeff_smul {R : Type u_1} {M : Type u_2} [Semiring R] {A : Type u_6} [SMulZeroClass A R] (a : A) (x : TotalAddMonoidAlgebra R M) :
                          (a • x).coeff = a • x.coeff
                          @[simp]
                          theorem TotalMonoidAlgebra.ofCoeff_smul {R : Type u_1} {M : Type u_2} [Semiring R] {A : Type u_6} [SMulZeroClass A R] (a : A) (x : M → R) :
                          ofCoeff (a • x) = a • ofCoeff x
                          @[simp]
                          theorem TotalAddMonoidAlgebra.ofCoeff_smul {R : Type u_1} {M : Type u_2} [Semiring R] {A : Type u_6} [SMulZeroClass A R] (a : A) (x : M → R) :
                          ofCoeff (a • x) = a • ofCoeff x
                          theorem TotalMonoidAlgebra.coeff_smul_apply {R : Type u_1} {M : Type u_2} [Semiring R] {A : Type u_6} [SMulZeroClass A R] (a : A) (x : TotalMonoidAlgebra R M) (m : M) :
                          (a • x).coeff m = a • x.coeff m
                          theorem TotalAddMonoidAlgebra.coeff_smul_apply {R : Type u_1} {M : Type u_2} [Semiring R] {A : Type u_6} [SMulZeroClass A R] (a : A) (x : TotalAddMonoidAlgebra R M) (m : M) :
                          (a • x).coeff m = a • x.coeff m
                          @[simp]
                          theorem TotalMonoidAlgebra.smul_single {R : Type u_1} {M : Type u_2} [Semiring R] {A : Type u_6} [SMulZeroClass A R] [DecidableEq M] (a : A) (m : M) (r : R) :
                          a • single m r = single m (a • r)
                          @[simp]
                          theorem TotalAddMonoidAlgebra.smul_single {R : Type u_1} {M : Type u_2} [Semiring R] {A : Type u_6} [SMulZeroClass A R] [DecidableEq M] (a : A) (m : M) (r : R) :
                          a • single m r = single m (a • r)
                          theorem TotalMonoidAlgebra.smul_single' {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] (r' : R) (m : M) (r : R) :
                          r' • single m r = single m (r' * r)
                          theorem TotalAddMonoidAlgebra.smul_single' {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] (r' : R) (m : M) (r : R) :
                          r' • single m r = single m (r' * r)
                          @[instance_reducible]
                          instance TotalMonoidAlgebra.distribSMul {R : Type u_1} {M : Type u_2} {N : Type u_3} [Semiring R] [DistribSMul N R] :
                          Equations
                          @[instance_reducible]
                          instance TotalAddMonoidAlgebra.distribSMul {R : Type u_1} {M : Type u_2} {N : Type u_3} [Semiring R] [DistribSMul N R] :
                          Equations
                          instance TotalMonoidAlgebra.isScalarTower {R : Type u_1} {M : Type u_2} {N : Type u_3} {O : Type u_4} [Semiring R] [SMulZeroClass N R] [SMulZeroClass O R] [SMul N O] [IsScalarTower N O R] :
                          instance TotalAddMonoidAlgebra.isScalarTower {R : Type u_1} {M : Type u_2} {N : Type u_3} {O : Type u_4} [Semiring R] [SMulZeroClass N R] [SMulZeroClass O R] [SMul N O] [IsScalarTower N O R] :
                          instance TotalMonoidAlgebra.smulCommClass {R : Type u_1} {M : Type u_2} {N : Type u_3} {O : Type u_4} [Semiring R] [SMulZeroClass N R] [SMulZeroClass O R] [SMulCommClass N O R] :
                          instance TotalAddMonoidAlgebra.smulCommClass {R : Type u_1} {M : Type u_2} {N : Type u_3} {O : Type u_4} [Semiring R] [SMulZeroClass N R] [SMulZeroClass O R] [SMulCommClass N O R] :
                          @[simp]
                          theorem TotalMonoidAlgebra.single_zero {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] (m : M) :
                          single m 0 = 0
                          @[simp]
                          theorem TotalAddMonoidAlgebra.single_zero {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] (m : M) :
                          single m 0 = 0
                          @[simp]
                          theorem TotalMonoidAlgebra.single_add {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] (m : M) (r₁ r₂ : R) :
                          single m (r₁ + r₂) = single m r₁ + single m r₂
                          @[simp]
                          theorem TotalAddMonoidAlgebra.single_add {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] (m : M) (r₁ r₂ : R) :
                          single m (r₁ + r₂) = single m r₁ + single m r₂

                          TotalMonoidAlgebra.single as an AddMonoidHom.

                          Equations
                          Instances For
                            @[simp]
                            theorem TotalAddMonoidAlgebra.singleAddAddMonoidHom_apply {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] (m : M) (r : R) :
                            @[simp]
                            theorem TotalMonoidAlgebra.singleAddMonoidHom_apply {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] (m : M) (r : R) :
                            theorem TotalMonoidAlgebra.coeff_single_apply {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] {a a' : M} {b : R} :
                            (single a b).coeff a' = if a = a' then b else 0
                            theorem TotalAddMonoidAlgebra.coeff_single_apply {R : Type u_1} {M : Type u_2} [Semiring R] [DecidableEq M] {a a' : M} {b : R} :
                            (single a b).coeff a' = if a = a' then b else 0
                            @[simp]
                            theorem TotalMonoidAlgebra.single_eq_zero {R : Type u_1} {M : Type u_2} [Semiring R] {r : R} {m : M} [DecidableEq M] :
                            single m r = 0 ↔ r = 0
                            @[simp]
                            theorem TotalAddMonoidAlgebra.single_eq_zero {R : Type u_1} {M : Type u_2} [Semiring R] {r : R} {m : M} [DecidableEq M] :
                            single m r = 0 ↔ r = 0
                            theorem TotalMonoidAlgebra.single_ne_zero {R : Type u_1} {M : Type u_2} [Semiring R] {r : R} {m : M} [DecidableEq M] :
                            single m r ≠ 0 ↔ r ≠ 0
                            theorem TotalAddMonoidAlgebra.single_ne_zero {R : Type u_1} {M : Type u_2} [Semiring R] {r : R} {m : M} [DecidableEq M] :
                            single m r ≠ 0 ↔ r ≠ 0
                            @[instance_reducible]
                            instance TotalMonoidAlgebra.one {R : Type u_1} {M : Type u_2} [Semiring R] [One M] [DecidableEq M] :

                            The unit of the multiplication is single 1 1, i.e. the function that is 1 at 1 and 0 elsewhere.

                            Equations
                            @[instance_reducible]
                            instance TotalAddMonoidAlgebra.zero {R : Type u_1} {M : Type u_2} [Semiring R] [Zero M] [DecidableEq M] :

                            The unit of the multiplication is single 0 1, i.e. the function that is 1 at 0 and 0 elsewhere.

                            Equations
                            theorem TotalMonoidAlgebra.one_def {R : Type u_1} {M : Type u_2} [Semiring R] [One M] [DecidableEq M] :
                            1 = single 1 1
                            theorem TotalAddMonoidAlgebra.one_def {R : Type u_1} {M : Type u_2} [Semiring R] [Zero M] [DecidableEq M] :
                            1 = single 0 1
                            @[simp]
                            theorem TotalMonoidAlgebra.coeff_one_one {R : Type u_1} {M : Type u_2} [Semiring R] [One M] [DecidableEq M] :
                            coeff 1 1 = 1
                            @[simp]
                            theorem TotalAddMonoidAlgebra.coeff_one_zero {R : Type u_1} {M : Type u_2} [Semiring R] [Zero M] [DecidableEq M] :
                            coeff 1 0 = 1

                            The multiplication in a total monoid algebra. #

                            Unlike MonoidAlgebra which is based on finitely supported functions, TotalMonoidAlgebra allows elements with infinite support. Consequently, to ensure that the convolution product is well-defined (i.e., the coefficient sum is finite), we require the underlying monoid M to satisfy the Finset.HasMulAntidiagonal condition. This guarantees that for any element z : M, there are only finitely many pairs (x, y) such that x * y = z.

                            @[instance_reducible]

                            The product of x y : R⟦M⟧ is the function whose value at m is the sum of x m₁ * y m₂ over all pairs m₁, m₂ such that m₁ * m₂ = m.

                            Equations
                            @[instance_reducible]

                            The product of x y : R⟦M⟧ is the function whose value at m is the sum of x m₁ * y m₂ over all pairs m₁, m₂ such that m₁ + m₂ = m.

                            Equations
                            theorem TotalMonoidAlgebra.mul_def {R : Type u_1} {M : Type u_2} [Semiring R] [Mul M] [Finset.HasMulAntidiagonal M] (x y : TotalMonoidAlgebra R M) :
                            x * y = ofCoeff fun (z : M) => ∑ p ∈ Finset.mulAntidiagonal z, x.coeff p.1 * y.coeff p.2
                            theorem TotalAddMonoidAlgebra.mul_def {R : Type u_1} {M : Type u_2} [Semiring R] [Add M] [Finset.HasAntidiagonal M] (x y : TotalAddMonoidAlgebra R M) :
                            x * y = ofCoeff fun (z : M) => ∑ p ∈ Finset.antidiagonal z, x.coeff p.1 * y.coeff p.2
                            theorem TotalMonoidAlgebra.coeff_mul {R : Type u_1} {M : Type u_2} [Semiring R] [Mul M] [Finset.HasMulAntidiagonal M] (x y : TotalMonoidAlgebra R M) (m : M) :
                            (x * y).coeff m = ∑ p ∈ Finset.mulAntidiagonal m, x.coeff p.1 * y.coeff p.2
                            theorem TotalAddMonoidAlgebra.coeff_mul {R : Type u_1} {M : Type u_2} [Semiring R] [Add M] [Finset.HasAntidiagonal M] (x y : TotalAddMonoidAlgebra R M) (m : M) :
                            (x * y).coeff m = ∑ p ∈ Finset.antidiagonal m, x.coeff p.1 * y.coeff p.2
                            @[instance_reducible]
                            Equations
                            • One or more equations did not get rendered due to their size.
                            @[instance_reducible]
                            Equations
                            • One or more equations did not get rendered due to their size.
                            @[simp]
                            theorem TotalMonoidAlgebra.single_mul_single {R : Type u_1} {M : Type u_2} [Semiring R] [Mul M] [Finset.HasMulAntidiagonal M] [DecidableEq M] (m₁ m₂ : M) (r₁ r₂ : R) :
                            single m₁ r₁ * single m₂ r₂ = single (m₁ * m₂) (r₁ * r₂)
                            @[simp]
                            theorem TotalAddMonoidAlgebra.single_mul_single {R : Type u_1} {M : Type u_2} [Semiring R] [Add M] [Finset.HasAntidiagonal M] [DecidableEq M] (m₁ m₂ : M) (r₁ r₂ : R) :
                            single m₁ r₁ * single m₂ r₂ = single (m₁ + m₂) (r₁ * r₂)
                            @[simp]
                            theorem TotalMonoidAlgebra.single_commute_single {R : Type u_1} {M : Type u_2} [Semiring R] {r₁ r₂ : R} {m₁ m₂ : M} [Mul M] [Finset.HasMulAntidiagonal M] [DecidableEq M] (hm : Commute m₁ m₂) (hr : Commute r₁ r₂) :
                            Commute (single m₁ r₁) (single m₂ r₂)
                            @[simp]
                            theorem TotalAddMonoidAlgebra.single_commute_single {R : Type u_1} {M : Type u_2} [Semiring R] {r₁ r₂ : R} {m₁ m₂ : M} [Add M] [Finset.HasAntidiagonal M] [DecidableEq M] (hm : AddCommute m₁ m₂) (hr : Commute r₁ r₂) :
                            Commute (single m₁ r₁) (single m₂ r₂)
                            @[simp]
                            theorem TotalMonoidAlgebra.single_commute {R : Type u_1} {M : Type u_2} [Semiring R] {r : R} {m : M} [Mul M] [Finset.HasMulAntidiagonal M] [DecidableEq M] (hm : ∀ (m' : M), Commute m m') (hr : ∀ (r' : R), Commute r r') (x : TotalMonoidAlgebra R M) :
                            Commute (single m r) x
                            @[simp]
                            theorem TotalAddMonoidAlgebra.single_commute {R : Type u_1} {M : Type u_2} [Semiring R] {r : R} {m : M} [Add M] [Finset.HasAntidiagonal M] [DecidableEq M] (hm : ∀ (m' : M), AddCommute m m') (hr : ∀ (r' : R), Commute r r') (x : TotalAddMonoidAlgebra R M) :
                            Commute (single m r) x
                            theorem TotalMonoidAlgebra.coeff_mul_single_eq_coeff_mul {R : Type u_1} {M : Type u_2} [Semiring R] {x : TotalMonoidAlgebra R M} {r : R} {m m₁ : M} [Mul M] [Finset.HasMulAntidiagonal M] [DecidableEq M] (m₂ : M) (H : ∀ (m' : M), m' * m = m₁ ↔ m' = m₂) :
                            (x * single m r).coeff m₁ = x.coeff m₂ * r
                            theorem TotalAddMonoidAlgebra.coeff_mul_single_eq_coeff_mul {R : Type u_1} {M : Type u_2} [Semiring R] {x : TotalAddMonoidAlgebra R M} {r : R} {m m₁ : M} [Add M] [Finset.HasAntidiagonal M] [DecidableEq M] (m₂ : M) (H : ∀ (m' : M), m' + m = m₁ ↔ m' = m₂) :
                            (x * single m r).coeff m₁ = x.coeff m₂ * r
                            theorem TotalMonoidAlgebra.coeff_single_mul_eq_mul_coeff {R : Type u_1} {M : Type u_2} [Semiring R] {x : TotalMonoidAlgebra R M} {r : R} {m m₁ : M} [Mul M] [Finset.HasMulAntidiagonal M] [DecidableEq M] (m₂ : M) (H : ∀ (m' : M), m * m' = m₁ ↔ m' = m₂) :
                            (single m r * x).coeff m₁ = r * x.coeff m₂
                            theorem TotalAddMonoidAlgebra.coeff_single_mul_eq_mul_coeff {R : Type u_1} {M : Type u_2} [Semiring R] {x : TotalAddMonoidAlgebra R M} {r : R} {m m₁ : M} [Add M] [Finset.HasAntidiagonal M] [DecidableEq M] (m₂ : M) (H : ∀ (m' : M), m + m' = m₁ ↔ m' = m₂) :
                            (single m r * x).coeff m₁ = r * x.coeff m₂
                            @[simp]
                            theorem TotalMonoidAlgebra.coeff_mul_single_of_forall_mul_ne {R : Type u_1} {M : Type u_2} [Semiring R] {m m' : M} [Mul M] [Finset.HasMulAntidiagonal M] [DecidableEq M] (r : R) (x : TotalMonoidAlgebra R M) (h : ∀ (d : M), d * m ≠ m') :
                            (x * single m r).coeff m' = 0
                            @[simp]
                            theorem TotalAddMonoidAlgebra.coeff_mul_single_of_forall_add_ne {R : Type u_1} {M : Type u_2} [Semiring R] {m m' : M} [Add M] [Finset.HasAntidiagonal M] [DecidableEq M] (r : R) (x : TotalAddMonoidAlgebra R M) (h : ∀ (d : M), d + m ≠ m') :
                            (x * single m r).coeff m' = 0
                            @[simp]
                            theorem TotalMonoidAlgebra.coeff_single_mul_of_forall_mul_ne {R : Type u_1} {M : Type u_2} [Semiring R] {m m' : M} [Mul M] [Finset.HasMulAntidiagonal M] [DecidableEq M] (r : R) (x : TotalMonoidAlgebra R M) (h : ∀ (d : M), m * d ≠ m') :
                            (single m r * x).coeff m' = 0
                            @[simp]
                            theorem TotalAddMonoidAlgebra.coeff_single_mul_of_forall_add_ne {R : Type u_1} {M : Type u_2} [Semiring R] {m m' : M} [Add M] [Finset.HasAntidiagonal M] [DecidableEq M] (r : R) (x : TotalAddMonoidAlgebra R M) (h : ∀ (d : M), m + d ≠ m') :
                            (single m r * x).coeff m' = 0

                            The embedding of a magma into its total magma algebra.

                            Equations
                            Instances For
                              @[simp]
                              theorem TotalMonoidAlgebra.ofMagma_apply (R : Type u_6) (M : Type u_7) [Semiring R] [Mul M] [Finset.HasMulAntidiagonal M] [DecidableEq M] (a : M) :
                              (ofMagma R M) a = single a 1
                              @[instance_reducible]
                              Equations
                              • One or more equations did not get rendered due to their size.
                              @[instance_reducible]
                              Equations
                              • One or more equations did not get rendered due to their size.
                              @[simp]
                              @[simp]
                              theorem TotalMonoidAlgebra.coeff_mul_single_one {R : Type u_1} {M : Type u_2} [Semiring R] [MulOneClass M] [Finset.HasMulAntidiagonal M] [DecidableEq M] (x : TotalMonoidAlgebra R M) (r : R) (m : M) :
                              (x * single 1 r).coeff m = x.coeff m * r
                              theorem TotalAddMonoidAlgebra.coeff_mul_single_zero {R : Type u_1} {M : Type u_2} [Semiring R] [AddZeroClass M] [Finset.HasAntidiagonal M] [DecidableEq M] (x : TotalAddMonoidAlgebra R M) (r : R) (m : M) :
                              (x * single 0 r).coeff m = x.coeff m * r
                              theorem TotalMonoidAlgebra.coeff_single_one_mul {R : Type u_1} {M : Type u_2} [Semiring R] [MulOneClass M] [Finset.HasMulAntidiagonal M] [DecidableEq M] (x : TotalMonoidAlgebra R M) (r : R) (m : M) :
                              (single 1 r * x).coeff m = r * x.coeff m
                              theorem TotalAddMonoidAlgebra.coeff_single_zero_mul {R : Type u_1} {M : Type u_2} [Semiring R] [AddZeroClass M] [Finset.HasAntidiagonal M] [DecidableEq M] (x : TotalAddMonoidAlgebra R M) (r : R) (m : M) :
                              (single 0 r * x).coeff m = r * x.coeff m
                              theorem TotalMonoidAlgebra.coeff_mul_natCast {R : Type u_1} {M : Type u_2} [Semiring R] [MulOneClass M] [Finset.HasMulAntidiagonal M] [DecidableEq M] (x : TotalMonoidAlgebra R M) (n : ℕ) (m : M) :
                              (x * ↑n).coeff m = x.coeff m * ↑n
                              theorem TotalAddMonoidAlgebra.coeff_mul_natCast {R : Type u_1} {M : Type u_2} [Semiring R] [AddZeroClass M] [Finset.HasAntidiagonal M] [DecidableEq M] (x : TotalAddMonoidAlgebra R M) (n : ℕ) (m : M) :
                              (x * ↑n).coeff m = x.coeff m * ↑n
                              theorem TotalMonoidAlgebra.coeff_natCast_mul {R : Type u_1} {M : Type u_2} [Semiring R] [MulOneClass M] [Finset.HasMulAntidiagonal M] [DecidableEq M] (x : TotalMonoidAlgebra R M) (n : ℕ) (m : M) :
                              (↑n * x).coeff m = ↑n * x.coeff m
                              theorem TotalAddMonoidAlgebra.coeff_natCast_mul {R : Type u_1} {M : Type u_2} [Semiring R] [AddZeroClass M] [Finset.HasAntidiagonal M] [DecidableEq M] (x : TotalAddMonoidAlgebra R M) (n : ℕ) (m : M) :
                              (↑n * x).coeff m = ↑n * x.coeff m

                              The embedding of a unital magma into its total magma algebra.

                              Equations
                              Instances For
                                @[simp]
                                theorem TotalMonoidAlgebra.of_apply (R : Type u_6) (M : Type u_7) [Semiring R] [MulOneClass M] [Finset.HasMulAntidiagonal M] [DecidableEq M] (a✝ : M) :
                                (of R M) a✝ = single a✝ 1
                                theorem TotalMonoidAlgebra.of_commute {R : Type u_1} {M : Type u_2} [Semiring R] {m : M} [MulOneClass M] [Finset.HasMulAntidiagonal M] [DecidableEq M] (h : ∀ (m' : M), Commute m m') (f : TotalMonoidAlgebra R M) :
                                Commute ((of R M) m) f

                                TotalMonoidAlgebra.single as a MonoidHom from the product type into the total monoid algebra.

                                Note the order of the elements of the product are reversed compared to the arguments of TotalMonoidAlgebra.single.

                                Equations
                                Instances For
                                  @[simp]

                                  TotalMonoidAlgebra.single 1 as a RingHom

                                  Equations
                                  Instances For

                                    TotalAddMonoidAlgebra.single 1 as a RingHom

                                    Equations
                                    • One or more equations did not get rendered due to their size.
                                    Instances For
                                      @[instance_reducible]
                                      Equations
                                      • One or more equations did not get rendered due to their size.
                                      @[instance_reducible]
                                      Equations
                                      • One or more equations did not get rendered due to their size.
                                      @[simp]
                                      theorem TotalMonoidAlgebra.single_pow {R : Type u_1} {M : Type u_2} [Semiring R] [Monoid M] [Finset.HasMulAntidiagonal M] [DecidableEq M] (m : M) (r : R) (n : ℕ) :
                                      single m r ^ n = single (m ^ n) (r ^ n)
                                      @[simp]
                                      theorem TotalAddMonoidAlgebra.single_pow {R : Type u_1} {M : Type u_2} [Semiring R] [AddMonoid M] [Finset.HasAntidiagonal M] [DecidableEq M] (m : M) (r : R) (n : ℕ) :
                                      single m r ^ n = single (n • m) (r ^ n)