Overview of recurring patterns such as duality, symmetry, local-to-global reasoning, decomposition, recursion, and induction.
Mathematics is organized by recurring patterns. The same forms of reasoning appear in algebra, geometry, topology, analysis, combinatorics, computation, and logic. Once these patterns are recognized, new subjects become easier to learn because their methods are no longer isolated.
This chapter studies several of the most common patterns.
Duality appears when a concept has a counterpart obtained by reversing direction, exchanging roles, or changing perspective. Products and coproducts, subobjects and quotients, points and functions, syntax and semantics are examples of dual pairs.
Symmetry and invariance appear when transformations preserve structure. A symmetry changes representation while leaving essential properties unchanged. Invariants record what survives these transformations.
Local-to-global reasoning appears when small pieces are understood first and then assembled into a statement about the whole. This pattern is central in topology, geometry, analysis, and sheaf-like reasoning.
Decomposition and composition appear when complex objects are broken into simpler parts or built from them. Direct sums, products, factorizations, connected components, and modular proofs all follow this pattern.
Recursion and induction appear when objects are defined or proved step by step. Natural numbers, trees, syntax, algorithms, and many combinatorial structures are governed by recursive formation rules and inductive proofs.
These patterns do not replace field-specific methods. They explain why those methods work and how they transfer. A technique learned in one area may become useful elsewhere once its pattern is identified.
The purpose of this chapter is to make these recurring forms explicit. Each section develops one pattern, gives examples, and shows how it supports mathematical reasoning across domains.