answersLogoWhite

0

1]empty set

2]singleton set

3]finite set

4]infinite set

>.<

User Avatar

Wiki User

13y ago

Still curious? Ask our experts.

Chat with our AI personalities

BeauBeau
You're doing better than you think!
Chat with Beau
ViviVivi
Your ride-or-die bestie who's seen you through every high and low.
Chat with Vivi
JordanJordan
Looking for a career mentor? I've seen my fair share of shake-ups.
Chat with Jordan

Add your answer:

Earn +20 pts
Q: What are the kinds of sets and definition?
Write your answer...
Submit
Still have questions?
magnify glass
imp
Continue Learning about Algebra

What is the kinds of algebra?

kinds of sets in college algebra?


What is definition of joined set?

joined sets in math


What is the definition of ordered pair in math?

An ordered pair is a pair of numbers, in cases where the order is relevant. Often used to indicate coordinates. Also, in general, to create new (larger) sets out of existing sets, in a process known as "Cartesian product"


Are equivalent sets equal sets why?

No, because equivalent sets are sets that have the SAME cardinality but equal sets are sets that all their elements are precisely the SAME. example: A={a,b,c} and B={1,2,3} equivalent sets C={1,2,3} and D={1,2,3} equal sets


What is a disjoint set?

ExplanationFormally, two sets A and B are disjoint if their intersection is the empty set, i.e. if This definition extends to any collection of sets. A collection of sets is pairwise disjoint or mutually disjoint if, given any two sets in the collection, those two sets are disjoint.Formally, let I be an index set, and for each i in I, let Ai be a set. Then the family of sets {Ai : i &isin; I} is pairwise disjoint if for any i and j in I with i &ne; j,For example, the collection of sets { {1}, {2}, {3}, ... } is pairwise disjoint. If {Ai} is a pairwise disjoint collection (containing at least two sets), then clearly its intersection is empty:However, the converse is not true: the intersection of the collection {{1, 2}, {2, 3}, {3, 1}} is empty, but the collection is not pairwise disjoint. In fact, there are no two disjoint sets in this collection.A partition of a set X is any collection of non-empty subsets {Ai : i &isin; I} of X such that {Ai} are pairwise disjoint andSets that are not the same.