discrete_mathematics_notes/sec02

sec02

dz / discrete_mathematics_notes / sec02

Summary

section 2

Node Tree

Nodes

sec_2_2
content 2.2
children set

set
content set
children subset, cardinality, collection_of_things (definition), disjoint, formalization_of_counting, important_sets, intersection
parents sec_2_2

formalization_of_counting
content Formalization for assertions that involve counting things
parents set

collection_of_things
content colletion of things
children elements
parents set

elements
content elements
children things_in_set (definition)
parents collection_of_things

things_in_set
content Things in the set
parents elements

important_sets
content important sets in math
children set_of, empty
parents set

set_of
content Set of
children rational_numbers, real_numbers, integers
parents important_sets

real_numbers
content Real Numbers
parents set_of

rational_numbers
content Rational Numbers
parents set_of

empty
content empty set
parents important_sets

integers
content integers
children non-negative, positive
parents set_of

positive
content positive
children non-negative (yes, there is a distinction (does non-negative include 0?))
parents integers

non-negative
content non-negative
parents positive, integers

cardinality
content Cardinality
children number_of_elements (definition)
parents set

number_of_elements
content Number of elements in set
parents cardinality

subset
content subset
children subset_definition (definition)
parents set

subset_definition
content A is said to be a subset of B if every element of A is also in B
parents subset

intersection
content Intersection
children intersection_definition (definition)
parents set

intersection_definition
content An intersection of A and B is the set containing elements from both A and B.
parents intersection

disjoint
content Disjoint
children disjoint_definition (definition)
parents set

disjoint_definition
content When intersection of two sets is empty, they are said to be disjoint
parents disjoint