Sets as a semiring under union #

This file defines SetSemiring α, an alias of Set α, which we endow with ∪ as addition and pointwise * as multiplication. If α is a (commutative) monoid, SetSemiring α is a (commutative) semiring.

source

def SetSemiring (α : Type u_3) :

Type u_3

An alias for Set α, which has a semiring structure given by ∪ as "addition" and pointwise multiplication * as "multiplication".

Equations

SetSemiring α = Set α

Instances For

source

noncomputable instance instInhabitedSetSemiring (α : Type u_3) :

Inhabited (SetSemiring α)

Equations

instInhabitedSetSemiring α = inferInstance

source

instance instPartialOrderSetSemiring (α : Type u_3) :

PartialOrder (SetSemiring α)

Equations

instPartialOrderSetSemiring α = inferInstance

source

instance instOrderBotSetSemiring (α : Type u_3) :

OrderBot (SetSemiring α)

Equations

instOrderBotSetSemiring α = inferInstance

source

def Set.up {α : Type u_1} :

Set α ≃ SetSemiring α

The identity function Set α → SetSemiring α.

Equations

Set.up = Equiv.refl (Set α)

Instances For

source

def SetSemiring.down {α : Type u_1} :

SetSemiring α ≃ Set α

The identity function SetSemiring α → Set α.

Equations

SetSemiring.down = Equiv.refl (SetSemiring α)

Instances For

source

@[simp]

theorem SetSemiring.down_up {α : Type u_1} (s : Set α) :

SetSemiring.down (Set.up s) = s

source

@[simp]

theorem SetSemiring.up_down {α : Type u_1} (s : SetSemiring α) :

Set.up (SetSemiring.down s) = s

source

theorem SetSemiring.up_le_up {α : Type u_1} {s : Set α} {t : Set α} :

Set.up s ≤ Set.up t ↔ s ⊆ t

source

theorem SetSemiring.up_lt_up {α : Type u_1} {s : Set α} {t : Set α} :

Set.up s < Set.up t ↔ s ⊂ t

source

@[simp]

theorem SetSemiring.down_subset_down {α : Type u_1} {s : SetSemiring α} {t : SetSemiring α} :

SetSemiring.down s ⊆ SetSemiring.down t ↔ s ≤ t

source

@[simp]

theorem SetSemiring.down_ssubset_down {α : Type u_1} {s : SetSemiring α} {t : SetSemiring α} :

SetSemiring.down s ⊂ SetSemiring.down t ↔ s < t

source

instance SetSemiring.instZero {α : Type u_1} :

Zero (SetSemiring α)

Equations

SetSemiring.instZero = { zero := Set.up ∅ }

source

instance SetSemiring.instAdd {α : Type u_1} :

Add (SetSemiring α)

Equations

SetSemiring.instAdd = { add := fun (s t : SetSemiring α) => Set.up (SetSemiring.down s ∪ SetSemiring.down t) }

source

instance SetSemiring.instAddCommMonoid {α : Type u_1} :

AddCommMonoid (SetSemiring α)

Equations

SetSemiring.instAddCommMonoid = AddCommMonoid.mk ⋯

source

theorem SetSemiring.zero_def {α : Type u_1} :

0 = Set.up ∅

source

@[simp]

theorem SetSemiring.down_zero {α : Type u_1} :

SetSemiring.down 0 = ∅

source

@[simp]

theorem Set.up_empty {α : Type u_1} :

Set.up ∅ = 0

source

theorem SetSemiring.add_def {α : Type u_1} (s : SetSemiring α) (t : SetSemiring α) :

s + t = Set.up (SetSemiring.down s ∪ SetSemiring.down t)

source

@[simp]

theorem SetSemiring.down_add {α : Type u_1} (s : SetSemiring α) (t : SetSemiring α) :

SetSemiring.down (s + t) = SetSemiring.down s ∪ SetSemiring.down t

source

@[simp]

theorem Set.up_union {α : Type u_1} (s : Set α) (t : Set α) :

Set.up (s ∪ t) = Set.up s + Set.up t

source

instance SetSemiring.addLeftMono {α : Type u_1} :

AddLeftMono (SetSemiring α)

Equations

⋯ = ⋯

source

instance SetSemiring.instNonUnitalNonAssocSemiring {α : Type u_1} [Mul α] :

NonUnitalNonAssocSemiring (SetSemiring α)

Equations

SetSemiring.instNonUnitalNonAssocSemiring = NonUnitalNonAssocSemiring.mk ⋯ ⋯ ⋯ ⋯

source

theorem SetSemiring.mul_def {α : Type u_1} [Mul α] (s : SetSemiring α) (t : SetSemiring α) :

s * t = Set.up (SetSemiring.down s * SetSemiring.down t)

source

@[simp]

theorem SetSemiring.down_mul {α : Type u_1} [Mul α] (s : SetSemiring α) (t : SetSemiring α) :

SetSemiring.down (s * t) = SetSemiring.down s * SetSemiring.down t

source

@[simp]

theorem Set.up_mul {α : Type u_1} [Mul α] (s : Set α) (t : Set α) :

Set.up (s * t) = Set.up s * Set.up t

source

instance SetSemiring.instNoZeroDivisors {α : Type u_1} [Mul α] :

NoZeroDivisors (SetSemiring α)

Equations

⋯ = ⋯

source

instance SetSemiring.mulLeftMono {α : Type u_1} [Mul α] :

MulLeftMono (SetSemiring α)

Equations

⋯ = ⋯

source

instance SetSemiring.mulRightMono {α : Type u_1} [Mul α] :

MulRightMono (SetSemiring α)

Equations

⋯ = ⋯

source

instance SetSemiring.instOne {α : Type u_1} [One α] :

One (SetSemiring α)

Equations

SetSemiring.instOne = { one := Set.up 1 }

source

theorem SetSemiring.one_def {α : Type u_1} [One α] :

1 = Set.up 1

source

@[simp]

theorem SetSemiring.down_one {α : Type u_1} [One α] :

SetSemiring.down 1 = 1

source

@[simp]

theorem Set.up_one {α : Type u_1} [One α] :

Set.up 1 = 1

source

instance SetSemiring.instNonAssocSemiringOfMulOneClass {α : Type u_1} [MulOneClass α] :

NonAssocSemiring (SetSemiring α)

Equations

SetSemiring.instNonAssocSemiringOfMulOneClass = NonAssocSemiring.mk ⋯ ⋯ ⋯ ⋯

source

instance SetSemiring.instNonUnitalSemiringOfSemigroup {α : Type u_1} [Semigroup α] :

NonUnitalSemiring (SetSemiring α)

Equations

SetSemiring.instNonUnitalSemiringOfSemigroup = NonUnitalSemiring.mk ⋯

source

instance SetSemiring.instIdemSemiringOfMonoid {α : Type u_1} [Monoid α] :

IdemSemiring (SetSemiring α)

Equations

SetSemiring.instIdemSemiringOfMonoid = IdemSemiring.mk ⋯ ⊥ ⋯

source

instance SetSemiring.instNonUnitalCommSemiringOfCommSemigroup {α : Type u_1} [CommSemigroup α] :

NonUnitalCommSemiring (SetSemiring α)

Equations

SetSemiring.instNonUnitalCommSemiringOfCommSemigroup = NonUnitalCommSemiring.mk ⋯

source

instance SetSemiring.instIdemCommSemiringOfCommMonoid {α : Type u_1} [CommMonoid α] :

IdemCommSemiring (SetSemiring α)

Equations

SetSemiring.instIdemCommSemiringOfCommMonoid = IdemCommSemiring.mk ⋯ IdemSemiring.bot ⋯

source

instance SetSemiring.instCommMonoid {α : Type u_1} [CommMonoid α] :

CommMonoid (SetSemiring α)

Equations

SetSemiring.instCommMonoid = CommMonoid.mk ⋯

source

instance SetSemiring.instCanonicallyOrderedCommSemiringOfCommMonoid {α : Type u_1} [CommMonoid α] :

CanonicallyOrderedCommSemiring (SetSemiring α)

Equations

SetSemiring.instCanonicallyOrderedCommSemiringOfCommMonoid = CanonicallyOrderedCommSemiring.mk ⋯ ⋯ ⋯ ⋯ ⋯ ⋯ ⋯ ⋯ ⋯ Semiring.npow ⋯ ⋯ ⋯ ⋯

source

def SetSemiring.imageHom {α : Type u_1} {β : Type u_2} [MulOneClass α] [MulOneClass β] (f : α →* β) :

SetSemiring α →+* SetSemiring β

The image of a set under a multiplicative homomorphism is a ring homomorphism with respect to the pointwise operations on sets.

Equations

SetSemiring.imageHom f = { toFun := fun (s : SetSemiring α) => Set.up (⇑f '' SetSemiring.down s), map_one' := ⋯, map_mul' := ⋯, map_zero' := ⋯, map_add' := ⋯ }

Instances For

source

theorem SetSemiring.imageHom_def {α : Type u_1} {β : Type u_2} [MulOneClass α] [MulOneClass β] (f : α →* β) (s : SetSemiring α) :

(SetSemiring.imageHom f) s = Set.up (⇑f '' SetSemiring.down s)

source

@[simp]

theorem SetSemiring.down_imageHom {α : Type u_1} {β : Type u_2} [MulOneClass α] [MulOneClass β] (f : α →* β) (s : SetSemiring α) :

SetSemiring.down ((SetSemiring.imageHom f) s) = ⇑f '' SetSemiring.down s

source

@[simp]

theorem Set.up_image {α : Type u_1} {β : Type u_2} [MulOneClass α] [MulOneClass β] (f : α →* β) (s : Set α) :

Set.up (⇑f '' s) = (SetSemiring.imageHom f) (Set.up s)

Documentation

Mathlib.Data.Set.Semiring

Sets as a semiring under union #