Naรฏve set theory MOC

Multiset

A multiset ๐‘€ is a generalization of a set which may contain the same element more than once, set where we write suppโก๐‘€ for the underlying set. This may be formalized as

  • as a set suppโก๐‘€ with a generalized characteristic function ๐œ’๐‘€ :suppโก๐‘€ โ†’โ„• so that ๐œ’๐‘€(๐‘ ) is the multiplicity of ๐‘  in ๐‘€
  • as a set ๐‘€โ€ฒ with an equivalence relation ๐‘…, such that suppโก๐‘€ =๐‘€โ€ฒ/๐‘… and ๐œ’๐‘€([๐‘ ]) =|[๐‘ ]|.

In these notes, we will write M๐‘ก for the multiset related to an ordered tuple ๐‘ก. When it is clear, I may use ๐‘€ to refer to suppโก๐‘€.


tidy | en | SemBr