The smallest infinity in mathematics | Joel David Hamkins and Lex Fridman

Quick Overview

The discussion between Lex Fridman and Joel David Hamkins centers on the mathematical concept of countability within the context of different infinite sets, particularly demonstrating how the set of all pairs of natural numbers (the integer lattice) is countable, unlike the set of all real numbers, which is uncountably infinite.

Key Points: The discussion uses a visual zigzag path on a grid (the integer lattice) to prove that the set of pairs of natural numbers, $\mathbb{N} \times \mathbb{N}$, is countable. The path starts at (0,0) and snakes through the grid, assigning a unique natural number to every pair (row, column), thereby establishing a one-to-one correspondence with $\mathbb{N}$. Hamkins argues that this method provides a direct and intuitive way to count points in the lattice, contrasting with potentially overly arithmetic or convoluted counting methods. The concept of countability is contrasted with uncountability, exemplified by the set of real numbers, which Cantor proved cannot be put into a one-to-one correspondence with the natural numbers. The visual demonstration shows the path hitting every grid point in the upper-right quadrant, suggesting that even though the lattice is two-dimensional, it can be mapped onto a one-dimensional count (natural numbers). Lex Fridman acknowledges the visual method as a very nice way to think about assigning room numbers to all points on the grid, thereby confirming their countability.

Context: This segment is an excerpt from the Lex Fridman Podcast, featuring mathematician Joel David Hamkins. The conversation delves into foundational concepts of set theory and infinity, specifically focusing on the mathematical proof that the set of all ordered pairs of natural numbers (the integer lattice) is countable, meaning its elements can be enumerated, which is a crucial distinction from uncountable sets like the real numbers.

Detailed Analysis

Lex Fridman and Joel David Hamkins discuss the countability of the integer lattice, $\mathbb{N} \times \mathbb{N}$. Hamkins explains that one can establish a correspondence between the points on the grid and the natural numbers by following a specific path. He illustrates this path visually, showing a zigzagging line starting at the origin (0,0), moving diagonally up and right, then down and right, and repeating this pattern to cover every point on the grid. This systematic path ensures that every pair $(r, c)$ of natural numbers is eventually visited, meaning the set is countable. Hamkins notes that this method is superior to overly arithmetic approaches because it is a direct, visual way to enumerate the points, akin to assigning train cars sequentially. This concept is contrasted with the uncountability of the real numbers, which cannot be enumerated this way. Fridman agrees that this visual approach effectively demonstrates the countability of the lattice, allowing one to assign a unique 'room number' to every point.