
Relations and Counting
Zachary Abel continues MIT's 6.1200J Mathematics for Computer Science with a lecture on relations and the start of counting. He defines a relation as a domain, a codomain, and a subset of ordered pairs, then narrows to relations on a single set, working through equivalence relations and partial orders with the properties that define them, such as reflexivity, symmetry, and transitivity. The second half of the lecture shifts into counting, laying groundwork for combinatorics used throughout computer science. The session is part of MIT OpenCourseWare's Spring 2024 offering of the course, delivered in the standard lecture hall format with board work and worked examples. It assumes familiarity with earlier material in the sequence on logic and proof technique, and it sets up the counting methods that later lectures build on.