The hottest Set Theory Substack posts right now

And their main takeaways
Category
Top Education Topics
Infinitely More • 7 implied HN points • 15 Mar 26
  1. The natural sum and product (Hessenberg operations) make the ordinals into a commutative semiring, contrasting with standard ordinal arithmetic where addition and multiplication are not commutative.
  2. The natural ordinal operations match the operations on surreal numbers, so the ordinals under natural addition and multiplication form a subsemiring of the surreals.
  3. There are five independent, self-contained ways to define the natural sum and product—order-theoretic, computational, proof-theoretic, and others—and all five are equivalent, giving complementary perspectives and routes to generalization.
lcamtuf’s thing • 4489 implied HN points • 15 Feb 26
  1. Natural numbers can be built from a base element (zero) and a successor rule, and addition and multiplication follow from simple recursive definitions.
  2. Integers and rationals are formed by ordered pairs and equivalence classes so subtraction and division have in-system representations, and these extended sets remain countable.
  3. Computable numbers are those a Turing machine can approximate and are still countable, but the real numbers are uncountable (by diagonalization), so most reals cannot be computed.
Infinitely More • 35 implied HN points • 04 Mar 26
  1. Counting ordinals continues past the finite numbers to ω, then ω+1, ω+2, and onward through blocks like ω·2, ω·3, … so that each new limit ordinal begins a new ω-long era.
  2. By iterating these constructions and forming longer and longer exponential towers—ω, ω^ω, ω^(ω^ω), …—we reach ever higher ordinals, and the supremum of all finite such towers is the ordinal ε0.
  3. ε0 is the first ordinal fixed point of exponentiation by ω (so ω^ε0 = ε0), and there is a computable notation system for all ordinals below ε0 with important applications like Goodstein’s theorem and the Hydra game.
Infinitely More • 23 implied HN points • 12 Feb 26
  1. Cantor normal form gives every ordinal a unique, canonical representation, acting like a numeral system built on base ω instead of base ten.
  2. The notation is as powerful and convenient for working with ordinals as the decimal system is for ordinary numbers, so it makes representing and comparing ordinals systematic and clear.
  3. Using Cantor normal form simplifies ordinal arithmetic because many terms cancel or "disappear," and it provides a foundation for further topics like the surreal numbers.
Infinitely More • 38 implied HN points • 01 Feb 26
  1. An ordinal λ>0 is additively indecomposable when the sum of any two smaller ordinals is still below λ; equivalently, it cannot be expressed as a sum of two smaller ordinals.
  2. Concrete examples: ω is additively indecomposable, ω·2 is not, and the next indecomposable after ω is ω^2, so such ordinals must exceed every finite multiple of ω.
  3. There are analogous notions for multiplication and exponentiation — multiplicative or exponential indecomposability raises similar questions about whether indecomposable equals irreducible and motivates a full characterization via tools like Cantor normal form.
Get a weekly roundup of the best Substack posts, by hacker news affinity:
Infinitely More • 30 implied HN points • 22 Jan 26
  1. The series develops the basics of ordinal arithmetic—standard addition, multiplication, and exponentiation—and then moves on to topics like indecomposable and irreducible ordinals, Cantor normal form, and binary ordinal representation.
  2. It introduces the natural (Hessenberg) ordinal operations, which are commutative and make the ordinals into a commutative semiring, and it will study the natural ring of ordinals ⟨Ord⟩ inside the surreal numbers, asking about expressions, algebraic properties, and unique factorization.
  3. This essay first lays a rigorous foundation by giving order-theoretic and recursive definitions of the standard ordinal operations, which the later, deeper investigations will rely on.
Infinitely More • 25 implied HN points • 28 Nov 25
  1. Compactness in mathematics means that a set can be covered by a limited number of open sets, making it easier to work with. This concept is important in various areas of math like topology and analysis.
  2. The surreal numbers initially seem to lack compactness compared to real numbers, showing that many of the typical properties may not apply directly.
  3. However, by looking at the surreal numbers from a different perspective, we can discover surprising instances of compactness that we didn't expect.
Deep-Tech Newsletter • 19 implied HN points • 22 Sep 20
  1. The free mathematical course by Zaiku Group is attracting professionals from diverse backgrounds, aiming to equip them with advanced mathematical knowledge for fields like quantum algorithms.
  2. The power of mathematical abstraction was showcased by Zaiku Group's co-founder, Bambordé Baldé, who reconstructed the notion of probability measure using basic set-theoretic concepts.
  3. The course covers foundational topics over 12 weeks, with plans for fireside chats involving industry and academia experts to provide guidance and answer questions from learners.
Quantum Formalism • 0 implied HN points • 12 Apr 21
  1. The Lie Theory prerequisite mini-series will focus on point-set topology, metric spaces, and basics of differentiable manifolds.
  2. Reviewing basics of set theory, including intersections, unions, Cartesian products, and maps between sets, is recommended for the upcoming lectures.
  3. While the Lie Theory module may not be sufficient to understand Eric Weinstein's 'Geometric Unity' paper, it provides a foundational knowledge base that can ease the understanding of complex topics in differential geometry and topology.