These are the notes about point-set topology from Munkres.

Set Theory

Sets

  • Sets: Elements, objects, Subsets, proper subsets, Union, intersection, disjoint, empty set.
  • Contrapositive, Converse and Negation
  • Complement of a set relative to other set:
  • DeMorgan’s Law:
  • For a collection of set S, Arbitrary Union and Intersection
  • Cartesian Product of Sets:
    Functions
  • Def: A function: is a subset of with each appearing exactly once as the first coordinate of an ordered pair in this subset.
    • Ex: defined as . Then the subset . A different function
  • Restriction of to subset is defined as .
  • Composite Function
  • Injectivity, Surjectivity and Bijectivity
  • Image, Pre-image of a set
  • Example: .
    Relation
  • Def: A relation on a set A is a subset
  • Def: Equivalence relation has three properties:
    • Reflexivity, Symmetry, Transitivity
  • Def: Equivalence class, subset
    • Equivalence classes of set A form a partition (disjoint nonempty subsets whose union is A).
    • Given partition D of A, there is exactly one equivalence relation on A from which it is derived.
      • Prove existence and uniqueness of equivalence relation from partition D.
  • Def: Order Relation is a relation satisfying
    • Comparability: if , Either or
    • Non-reflexivity: and implies
    • Transitivity:
  • Def: Order Type
  • Def: Dictionary order relation
    Integers and
  • Def: Field, ordered field, linear continuum
  • Least upper bound property and archimedes principle is one of the most important properties of
  • Inductive set: If and , then , where is the binary operation for the field.

Resources