1. Overview
  2. 1. Overview
    ❱
    1. 1.1. Home
    2. 1.2. Community
      ❱
      1. 1.2.1. Maintainers
      2. 1.2.2. Contributors
      3. 1.2.3. Statement of inclusivity
      4. 1.2.4. Projects using Agda-Unimath
      5. 1.2.5. Grant acknowledgements
    3. 1.3. Guides
      ❱
      1. 1.3.1. Installing the library
      2. 1.3.2. Design principles
      3. 1.3.3. Contributing to the library
      4. 1.3.4. Structuring your file
        ❱
        1. 1.3.4.1. File template
      5. 1.3.5. The library coding style
      6. 1.3.6. Guidelines for mixfix operators
      7. 1.3.7. Citing sources
      8. 1.3.8. Citing the library
    4. 1.4. Library contents
    5. 1.5. Art
  3. The agda-unimath library
  4. 2. Category theory
    ❱
    1. 2.1. Adjunctions between large categories
    2. 2.2. Adjunctions between large precategories
    3. 2.3. Anafunctors between categories
    4. 2.4. Anafunctors between precategories
    5. 2.5. The augmented simplex category
    6. 2.6. Categories
    7. 2.7. The category of functors and natural transformations between two categories
    8. 2.8. The category of functors and natural transformations from small to large categories
    9. 2.9. The category of maps and natural transformations between two categories
    10. 2.10. The category of maps and natural transformations from small to large categories
    11. 2.11. Commuting squares of morphisms in large precategories
    12. 2.12. Commuting squares of morphisms in precategories
    13. 2.13. Commuting squares of morphisms in set-magmoids
    14. 2.14. Composition operations on binary families of sets
    15. 2.15. Conservative functors between precategories
    16. 2.16. Constant functors
    17. 2.17. Copresheaf categories
    18. 2.18. Coproducts in precategories
    19. 2.19. Cores of categories
    20. 2.20. Cores of precategories
    21. 2.21. Dependent products of categories
    22. 2.22. Dependent products of large categories
    23. 2.23. Dependent products of large precategories
    24. 2.24. Dependent products of precategories
    25. 2.25. Discrete categories
    26. 2.26. Embedding maps between precategories
    27. 2.27. Embeddings between precategories
    28. 2.28. Endomorphisms in categories
    29. 2.29. Endomorphisms in precategories
    30. 2.30. Epimorphism in large precategories
    31. 2.31. Equivalences between categories
    32. 2.32. Equivalences between large precategories
    33. 2.33. Equivalences between precategories
    34. 2.34. Essential fibers of functors between precategories
    35. 2.35. Essentially injective functors between precategories
    36. 2.36. Essentially surjective functors between precategories
    37. 2.37. Exponential objects in precategories
    38. 2.38. Faithful functors between precategories
    39. 2.39. Faithful maps between precategories
    40. 2.40. Full functors between precategories
    41. 2.41. Full large subcategories
    42. 2.42. Full large subprecategories
    43. 2.43. Full maps between precategories
    44. 2.44. Full subcategories
    45. 2.45. Full subprecategories
    46. 2.46. Fully faithful functors between precategories
    47. 2.47. Fully faithful maps between precategories
    48. 2.48. Function categories
    49. 2.49. Function precategories
    50. 2.50. Functors between categories
    51. 2.51. Functors from small to large categories
    52. 2.52. Functors from small to large precategories
    53. 2.53. Functors between large categories
    54. 2.54. Functors between large precategories
    55. 2.55. Functors between nonunital precategories
    56. 2.56. Functors between precategories
    57. 2.57. Functors between set-magmoids
    58. 2.58. Gaunt categories
    59. 2.59. Groupoids
    60. 2.60. Homotopies of natural transformations in large precategories
    61. 2.61. Indiscrete precategories
    62. 2.62. The initial category
    63. 2.63. Initial objects of large categories
    64. 2.64. Initial objects of large precategories
    65. 2.65. Initial objects in a precategory
    66. 2.66. Isomorphism induction in categories
    67. 2.67. Isomorphism induction in precategories
    68. 2.68. Isomorphisms in categories
    69. 2.69. Isomorphisms in large categories
    70. 2.70. Isomorphisms in large precategories
    71. 2.71. Isomorphisms in precategories
    72. 2.72. Isomorphisms in subprecategories
    73. 2.73. Large categories
    74. 2.74. Large function categories
    75. 2.75. Large function precategories
    76. 2.76. Large precategories
    77. 2.77. Large subcategories
    78. 2.78. Large subprecategories
    79. 2.79. Maps between categories
    80. 2.80. Maps from small to large categories
    81. 2.81. Maps from small to large precategories
    82. 2.82. Maps between precategories
    83. 2.83. Maps between set-magmoids
    84. 2.84. Monads on categories
    85. 2.85. Monads on precategories
    86. 2.86. Monomorphisms in large precategories
    87. 2.87. Natural isomorphisms between functors between categories
    88. 2.88. Natural isomorphisms between functors between large precategories
    89. 2.89. Natural isomorphisms between functors between precategories
    90. 2.90. Natural isomorphisms between maps between categories
    91. 2.91. Natural isomorphisms between maps between precategories
    92. 2.92. Natural numbers object in a precategory
    93. 2.93. Natural transformations between functors between categories
    94. 2.94. Natural transformations between functors from small to large categories
    95. 2.95. Natural transformations between functors from small to large precategories
    96. 2.96. Natural transformations between functors between large categories
    97. 2.97. Natural transformations between functors between large precategories
    98. 2.98. Natural transformations between functors between precategories
    99. 2.99. Natural transformations between maps between categories
    100. 2.100. Natural transformations between maps from small to large precategories
    101. 2.101. Natural transformations between maps between precategories
    102. 2.102. Nonunital precategories
    103. 2.103. One object precategories
    104. 2.104. Opposite categories
    105. 2.105. Opposite large precategories
    106. 2.106. Opposite precategories
    107. 2.107. Opposite preunivalent categories
    108. 2.108. Pointed endofunctors on categories
    109. 2.109. Pointed endofunctors
    110. 2.110. Precategories
    111. 2.111. Precategory of elements of a presheaf
    112. 2.112. The precategory of functors and natural transformations between two precategories
    113. 2.113. The precategory of functors and natural transformations from small to large precategories
    114. 2.114. The precategory of maps and natural transformations from a small to a large precategory
    115. 2.115. The precategory of maps and natural transformations between two precategories
    116. 2.116. Pregroupoids
    117. 2.117. Presheaf categories
    118. 2.118. Preunivalent categories
    119. 2.119. Products in precategories
    120. 2.120. Products of precategories
    121. 2.121. Pseudomonic functors between precategories
    122. 2.122. Pullbacks in precategories
    123. 2.123. Replete subprecategories
    124. 2.124. Representable functors between categories
    125. 2.125. Representable functors between large precategories
    126. 2.126. Representable functors between precategories
    127. 2.127. The representing arrow category
    128. 2.128. Restrictions of functors to cores of precategories
    129. 2.129. Rigid objects in a category
    130. 2.130. Rigid objects in a precategory
    131. 2.131. Set-magmoids
    132. 2.132. Sieves in categories
    133. 2.133. The simplex category
    134. 2.134. Slice precategories
    135. 2.135. Split essentially surjective functors between precategories
    136. 2.136. Strict categories
    137. 2.137. Structure equivalences between set-magmoids
    138. 2.138. Subcategories
    139. 2.139. Subprecategories
    140. 2.140. Subterminal precategories
    141. 2.141. The terminal category
    142. 2.142. Terminal objects in a precategory
    143. 2.143. Wide subcategories
    144. 2.144. Wide subprecategories
    145. 2.145. The Yoneda lemma for categories
    146. 2.146. The Yoneda lemma for precategories
  5. 3. Commutative algebra
    ❱
    1. 3.1. The binomial theorem in commutative rings
    2. 3.2. The binomial theorem in commutative semirings
    3. 3.3. Boolean rings
    4. 3.4. The category of commutative rings
    5. 3.5. Commutative rings
    6. 3.6. Commutative semirings
    7. 3.7. Dependent products of commutative rings
    8. 3.8. Dependent products of commutative semirings
    9. 3.9. Discrete fields
    10. 3.10. The Eisenstein integers
    11. 3.11. Euclidean domains
    12. 3.12. Full ideals of commutative rings
    13. 3.13. Function commutative rings
    14. 3.14. Function commutative semirings
    15. 3.15. The Gaussian integers
    16. 3.16. The group of multiplicative units of a commutative ring
    17. 3.17. Homomorphisms of commutative rings
    18. 3.18. Homomorphisms of commutative semirings
    19. 3.19. Ideals of commutative rings
    20. 3.20. Ideals of commutative semirings
    21. 3.21. Ideals generated by subsets of commutative rings
    22. 3.22. Integer multiples of elements of commutative rings
    23. 3.23. Integral domains
    24. 3.24. Intersections of ideals of commutative rings
    25. 3.25. Intersections of radical ideals of commutative rings
    26. 3.26. Invertible elements in commutative rings
    27. 3.27. Isomorphisms of commutative rings
    28. 3.28. Joins of ideals of commutative rings
    29. 3.29. Joins of radical ideals of commutative rings
    30. 3.30. Local commutative rings
    31. 3.31. Maximal ideals of commutative rings
    32. 3.32. Multiples of elements in commutative rings
    33. 3.33. Nilradical of a commutative ring
    34. 3.34. The nilradical of a commutative semiring
    35. 3.35. The poset of ideals of a commutative ring
    36. 3.36. The poset of radical ideals of a commutative ring
    37. 3.37. Powers of elements in commutative rings
    38. 3.38. Powers of elements in commutative semirings
    39. 3.39. The precategory of commutative rings
    40. 3.40. The precategory of commutative semirings
    41. 3.41. Prime ideals of commutative rings
    42. 3.42. Products of commutative rings
    43. 3.43. Products of ideals of commutative rings
    44. 3.44. Products of radical ideals of a commutative ring
    45. 3.45. Products of subsets of commutative rings
    46. 3.46. Radical ideals of commutative rings
    47. 3.47. Radical ideals generated by subsets of commutative rings
    48. 3.48. Radicals of ideals of commutative rings
    49. 3.49. Subsets of commutative rings
    50. 3.50. Subsets of commutative semirings
    51. 3.51. Sums in commutative rings
    52. 3.52. Sums in commutative semirings
    53. 3.53. Transporting commutative ring structures along isomorphisms of abelian groups
    54. 3.54. Trivial commutative rings
    55. 3.55. The Zariski locale
    56. 3.56. The Zariski topology on the set of prime ideals of a commutative ring
  6. 4. Elementary number theory
    ❱
    1. 4.1. The absolute value function on the integers
    2. 4.2. The Ackermann function
    3. 4.3. Addition on integer fractions
    4. 4.4. Addition on the integers
    5. 4.5. Addition on the natural numbers
    6. 4.6. Addition of positive, negative, nonnegative and nonpositive integers
    7. 4.7. Addition on the rational numbers
    8. 4.8. The additive group of rational numbers
    9. 4.9. Arithmetic functions
    10. 4.10. The based induction principle of the natural numbers
    11. 4.11. Based strong induction for the natural numbers
    12. 4.12. Bezout's lemma in the integers
    13. 4.13. Bezout's lemma on the natural numbers
    14. 4.14. The binomial coefficients
    15. 4.15. The binomial theorem for the integers
    16. 4.16. The binomial theorem for the natural numbers
    17. 4.17. Bounded sums of arithmetic functions
    18. 4.18. Catalan numbers
    19. 4.19. The cofibonacci sequence
    20. 4.20. The Collatz bijection
    21. 4.21. The Collatz conjecture
    22. 4.22. The commutative semiring of natural numbers
    23. 4.23. The congruence relations on the integers
    24. 4.24. The congruence relations on the natural numbers
    25. 4.25. The cross-multiplication difference of two integer fractions
    26. 4.26. Cubes of natural numbers
    27. 4.27. Decidable dependent function types
    28. 4.28. The decidable total order of integers
    29. 4.29. The decidable total order of natural numbers
    30. 4.30. The decidable total order of rational numbers
    31. 4.31. The decidable total order of a standard finite type
    32. 4.32. Decidable types in elementary number theory
    33. 4.33. The difference between integers
    34. 4.34. The difference between rational numbers
    35. 4.35. Dirichlet convolution
    36. 4.36. The distance between integers
    37. 4.37. The distance between natural numbers
    38. 4.38. Divisibility of integers
    39. 4.39. Divisibility in modular arithmetic
    40. 4.40. Divisibility of natural numbers
    41. 4.41. The divisibility relation on the standard finite types
    42. 4.42. Equality of integers
    43. 4.43. Equality of natural numbers
    44. 4.44. Euclidean division on the natural numbers
    45. 4.45. Euler's totient function
    46. 4.46. Exponentiation of natural numbers
    47. 4.47. Factorials of natural numbers
    48. 4.48. Falling factorials
    49. 4.49. The Fibonacci sequence
    50. 4.50. The field of rational numbers
    51. 4.51. The natural numbers base k
    52. 4.52. Finitely cyclic maps
    53. 4.53. The fundamental theorem of arithmetic
    54. 4.54. The Goldbach conjecture
    55. 4.55. The greatest common divisor of integers
    56. 4.56. The greatest common divisor of natural numbers
    57. 4.57. The group of integers
    58. 4.58. The half-integers
    59. 4.59. The Hardy-Ramanujan number
    60. 4.60. Inequality on integer fractions
    61. 4.61. Inequality on the integers
    62. 4.62. Inequality of natural numbers
    63. 4.63. Inequality on the rational numbers
    64. 4.64. Inequality on the standard finite types
    65. 4.65. The infinitude of primes
    66. 4.66. Initial segments of the natural numbers
    67. 4.67. Integer fractions
    68. 4.68. Integer partitions
    69. 4.69. The integers
    70. 4.70. The Jacobi symbol
    71. 4.71. The Kolakoski sequence
    72. 4.72. The Legendre symbol
    73. 4.73. Lower bounds of type families over the natural numbers
    74. 4.74. Maximum on the natural numbers
    75. 4.75. Maximum on the standard finite types
    76. 4.76. The mediant fraction of two integer fractions
    77. 4.77. Mersenne primes
    78. 4.78. Minimum on the natural numbers
    79. 4.79. Minimum on the standard finite types
    80. 4.80. Modular arithmetic
    81. 4.81. Modular arithmetic on the standard finite types
    82. 4.82. The monoid of natural numbers with addition
    83. 4.83. The monoid of the natural numbers with maximum
    84. 4.84. Multiplication on integer fractions
    85. 4.85. Multiplication of integers
    86. 4.86. Multiplication of the elements of a list of natural numbers
    87. 4.87. Multiplication of natural numbers
    88. 4.88. Multiplication of positive, negative, nonnegative and nonpositive integers
    89. 4.89. Multiplication on the rational numbers
    90. 4.90. The multiplicative group of positive rational numbers
    91. 4.91. The multiplicative group of rational numbers
    92. 4.92. Multiplicative inverses of positive integer fractions
    93. 4.93. The multiplicative monoid of natural numbers
    94. 4.94. The multiplicative monoid of rational numbers
    95. 4.95. Multiplicative units in the integers
    96. 4.96. Multiplicative units in modular arithmetic
    97. 4.97. Multiset coefficients
    98. 4.98. The type of natural numbers
    99. 4.99. The negative integers
    100. 4.100. The nonnegative integers
    101. 4.101. The nonpositive integers
    102. 4.102. Nonzero integers
    103. 4.103. Nonzero natural numbers
    104. 4.104. Nonzero rational numbers
    105. 4.105. The ordinal induction principle for the natural numbers
    106. 4.106. Parity of the natural numbers
    107. 4.107. Peano arithmetic
    108. 4.108. Pisano periods
    109. 4.109. The poset of natural numbers ordered by divisibility
    110. 4.110. The positive, negative, nonnegative and nonpositive integers
    111. 4.111. Positive integer fractions
    112. 4.112. The positive integers
    113. 4.113. Positive rational numbers
    114. 4.114. Powers of integers
    115. 4.115. Powers of two
    116. 4.116. Prime numbers
    117. 4.117. Products of natural numbers
    118. 4.118. Proper divisors of natural numbers
    119. 4.119. Pythagorean triples
    120. 4.120. The rational numbers
    121. 4.121. Reduced integer fractions
    122. 4.122. Relatively prime integers
    123. 4.123. Relatively prime natural numbers
    124. 4.124. Repeating an element in a standard finite type
    125. 4.125. Retracts of the type of natural numbers
    126. 4.126. The ring of integers
    127. 4.127. The ring of rational numbers
    128. 4.128. The sieve of Eratosthenes
    129. 4.129. Square-free natural numbers
    130. 4.130. Squares in the integers
    131. 4.131. Squares in ℤₚ
    132. 4.132. Squares in the natural numbers
    133. 4.133. The standard cyclic groups
    134. 4.134. The standard cyclic rings
    135. 4.135. Stirling numbers of the second kind
    136. 4.136. Strict inequality on the integer fractions
    137. 4.137. Strict inequality on the integers
    138. 4.138. Strict inequality on the natural numbers
    139. 4.139. Strict inequality on the rational numbers
    140. 4.140. Strictly ordered pairs of natural numbers
    141. 4.141. The strong induction principle for the natural numbers
    142. 4.142. Sums of natural numbers
    143. 4.143. Taxicab numbers
    144. 4.144. Telephone numbers
    145. 4.145. The triangular numbers
    146. 4.146. The Twin Prime conjecture
    147. 4.147. Type arithmetic with natural numbers
    148. 4.148. Unit elements in the standard finite types
    149. 4.149. Unit similarity on the standard finite types
    150. 4.150. The universal property of the integers
    151. 4.151. The universal property of the natural numbers
    152. 4.152. Upper bounds for type families over the natural numbers
    153. 4.153. The Well-Ordering Principle of the natural numbers
    154. 4.154. The well-ordering principle of the standard finite types
  7. 5. Finite algebra
    ❱
    1. 5.1. Commutative finite rings
    2. 5.2. Dependent products of commutative finit rings
    3. 5.3. Dependent products of finite rings
    4. 5.4. Finite fields
    5. 5.5. Finite rings
    6. 5.6. Homomorphisms of commutative finite rings
    7. 5.7. Homomorphisms of finite rings
    8. 5.8. Products of commutative finite rings
    9. 5.9. Products of finite rings
    10. 5.10. Semisimple commutative finite rings
  8. 6. Finite group theory
    ❱
    1. 6.1. The abstract quaternion group of order 8
    2. 6.2. Alternating concrete groups
    3. 6.3. Alternating groups
    4. 6.4. Cartier's delooping of the sign homomorphism
    5. 6.5. The concrete quaternion group
    6. 6.6. Deloopings of the sign homomorphism
    7. 6.7. Abelian groups
    8. 6.8. Finite Commutative monoids
    9. 6.9. Finite groups
    10. 6.10. Finite monoids
    11. 6.11. Finite semigroups
    12. 6.12. The group of n-element types
    13. 6.13. Groups of order 2
    14. 6.14. Orbits of permutations
    15. 6.15. Permutations
    16. 6.16. Permutations of standard finite types
    17. 6.17. The sign homomorphism
    18. 6.18. Simpson's delooping of the sign homomorphism
    19. 6.19. Subgroups of finite groups
    20. 6.20. Tetrahedra in 3-dimensional space
    21. 6.21. Transpositions
    22. 6.22. Transpositions of standard finite types
  9. 7. Foundation
    ❱
    1. 7.1. 0-Connected types
    2. 7.2. 0-Images of maps
    3. 7.3. 0-Maps
    4. 7.4. 1-Types
    5. 7.5. 2-Types
    6. 7.6. Action on equivalences of functions
    7. 7.7. The action on equivalences of functions out of subuniverses
    8. 7.8. Action on equivalences of type families
    9. 7.9. Action on equivalences in type families over subuniverses
    10. 7.10. The action of functions on higher identifications
    11. 7.11. The action on homotopies of functions
    12. 7.12. The binary action on identifications of binary functions
    13. 7.13. The action on identifications of dependent functions
    14. 7.14. The action on identifications of functions
    15. 7.15. Apartness relations
    16. 7.16. Arithmetic law for coproduct decomposition and Σ-decomposition
    17. 7.17. Arithmetic law for product decomposition and Π-decomposition
    18. 7.18. Automorphisms
    19. 7.19. The axiom of choice
    20. 7.20. Bands
    21. 7.21. Base changes of span diagrams
    22. 7.22. Binary embeddings
    23. 7.23. Binary equivalences
    24. 7.24. Binary equivalences on unordered pairs of types
    25. 7.25. Binary functoriality of set quotients
    26. 7.26. Homotopies of binary operations
    27. 7.27. Binary operations on unordered pairs of types
    28. 7.28. Binary reflecting maps of equivalence relations
    29. 7.29. Binary relations
    30. 7.30. Transitive Closures
    31. 7.31. Binary relations with extensions
    32. 7.32. Binary relations with lifts
    33. 7.33. Binary transport
    34. 7.34. Binary type duality
    35. 7.35. The booleans
    36. 7.36. The Cantor–Schröder–Bernstein–Escardó theorem
    37. 7.37. Cantor's diagonal argument
    38. 7.38. Cartesian morphisms of arrows
    39. 7.39. Cartesian morphisms of span diagrams
    40. 7.40. Cartesian product types
    41. 7.41. Cartesian products of set quotients
    42. 7.42. The category of families of sets
    43. 7.43. The category of sets
    44. 7.44. Choice of representatives for an equivalence relation
    45. 7.45. Codiagonal maps of types
    46. 7.46. Coherently invertible maps
    47. 7.47. Coinhabited pairs of types
    48. 7.48. Commuting cubes of maps
    49. 7.49. Commuting hexagons of identifications
    50. 7.50. Commuting pentagons of identifications
    51. 7.51. Commuting prisms of maps
    52. 7.52. Commuting squares of homotopies
    53. 7.53. Commuting squares of identifications
    54. 7.54. Commuting squares of maps
    55. 7.55. Commuting tetrahedra of homotopies
    56. 7.56. Commuting tetrahedra of maps
    57. 7.57. Commuting triangles of homotopies
    58. 7.58. Commuting triangles of identifications
    59. 7.59. Commuting triangles of maps
    60. 7.60. Commuting triangles of morphisms of arrows
    61. 7.61. Complements of type families
    62. 7.62. Complements of subtypes
    63. 7.63. Composite maps in inverse sequential diagrams
    64. 7.64. Composition algebra
    65. 7.65. Computational identity types
    66. 7.66. Cones over cospan diagrams
    67. 7.67. Cones over inverse sequential diagrams
    68. 7.68. Conjunction
    69. 7.69. Connected components of types
    70. 7.70. Connected components of universes
    71. 7.71. Connected maps
    72. 7.72. Connected types
    73. 7.73. Constant maps
    74. 7.74. Constant span diagrams
    75. 7.75. Constant type families
    76. 7.76. Contractible maps
    77. 7.77. Contractible types
    78. 7.78. Copartial elements
    79. 7.79. Copartial functions
    80. 7.80. Coproduct decompositions
    81. 7.81. Coproduct decompositions in a subuniverse
    82. 7.82. Coproduct types
    83. 7.83. Coproducts of pullbacks
    84. 7.84. Morphisms in the coslice category of types
    85. 7.85. Cospan diagrams
    86. 7.86. Cospans of types
    87. 7.87. Decidability of dependent function types
    88. 7.88. Decidability of dependent pair types
    89. 7.89. Decidable embeddings
    90. 7.90. Decidable equality
    91. 7.91. Decidable equivalence relations
    92. 7.92. Decidable maps
    93. 7.93. Decidable propositions
    94. 7.94. Decidable relations on types
    95. 7.95. Decidable subtypes
    96. 7.96. Decidable types
    97. 7.97. Dependent binary homotopies
    98. 7.98. The dependent binomial theorem for types (distributivity of dependent function types over coproduct types)
    99. 7.99. Dependent epimorphisms
    100. 7.100. Dependent epimorphisms with respect to truncated types
    101. 7.101. Dependent function types
    102. 7.102. Dependent homotopies
    103. 7.103. Dependent identifications
    104. 7.104. Dependent inverse sequential diagrams of types
    105. 7.105. Dependent pair types
    106. 7.106. Dependent products of pullbacks
    107. 7.107. Dependent sequences
    108. 7.108. Dependent sums of pullbacks
    109. 7.109. Dependent telescopes
    110. 7.110. The dependent universal property of equivalences
    111. 7.111. Descent for coproduct types
    112. 7.112. Descent for dependent pair types
    113. 7.113. Descent for the empty type
    114. 7.114. Descent for equivalences
    115. 7.115. Diagonal maps into cartesian products of types
    116. 7.116. Diagonal maps of types
    117. 7.117. Diagonal span diagrams
    118. 7.118. Diagonals of maps
    119. 7.119. Diagonals of morphisms of arrows
    120. 7.120. Discrete relations
    121. 7.121. Discrete relaxed Σ-decompositions
    122. 7.122. Discrete Σ-decompositions
    123. 7.123. Discrete types
    124. 7.124. Disjunction
    125. 7.125. Double arrows
    126. 7.126. Double negation
    127. 7.127. The double negation modality
    128. 7.128. Double powersets
    129. 7.129. Dubuc-Penon compact types
    130. 7.130. Effective maps for equivalence relations
    131. 7.131. Embeddings
    132. 7.132. Empty types
    133. 7.133. Endomorphisms
    134. 7.134. Epimorphisms
    135. 7.135. Epimorphisms with respect to maps into sets
    136. 7.136. Epimorphisms with respect to truncated types
    137. 7.137. Equality of cartesian product types
    138. 7.138. Equality of coproduct types
    139. 7.139. Equality on dependent function types
    140. 7.140. Equality of dependent pair types
    141. 7.141. Equality in the fibers of a map
    142. 7.142. Equivalence classes
    143. 7.143. Equivalence extensionality
    144. 7.144. Equivalence induction
    145. 7.145. Equivalence injective type families
    146. 7.146. Equivalence relations
    147. 7.147. Equivalences
    148. 7.148. Equivalences of arrows
    149. 7.149. Equivalences of cospans
    150. 7.150. Equivalences of double arrows
    151. 7.151. Equivalences of inverse sequential diagrams of types
    152. 7.152. Equivalences on Maybe
    153. 7.153. Equivalences of span diagrams
    154. 7.154. Equivalences of span diagrams on families of types
    155. 7.155. Equivalences of spans
    156. 7.156. Equivalences of spans of families of types
    157. 7.157. Evaluation of functions
    158. 7.158. Exclusive disjunctions
    159. 7.159. Exclusive sums
    160. 7.160. Existential quantification
    161. 7.161. Exponents of set quotients
    162. 7.162. Extensions of types
    163. 7.163. Faithful maps
    164. 7.164. Families of equivalences
    165. 7.165. Families of maps
    166. 7.166. Families of types over telescopes
    167. 7.167. Fiber inclusions
    168. 7.168. Fibered equivalences
    169. 7.169. Fibered involutions
    170. 7.170. Maps fibered over a map
    171. 7.171. Fibers of maps
    172. 7.172. Finitely coherent equivalences
    173. 7.173. Finitely coherently invertible maps
    174. 7.174. Fixed points of endofunctions
    175. 7.175. Full subtypes of types
    176. 7.176. Function extensionality
    177. 7.177. Function types
    178. 7.178. Functional correspondences
    179. 7.179. Functoriality of cartesian product types
    180. 7.180. Functoriality of coproduct types
    181. 7.181. Functoriality of dependent function types
    182. 7.182. Functoriality of dependent pair types
    183. 7.183. Functoriality of fibers of maps
    184. 7.184. Functoriality of function types
    185. 7.185. Functoriality of propositional truncations
    186. 7.186. Functorialty of pullbacks
    187. 7.187. Functoriality of sequential limits
    188. 7.188. Functoriality of set quotients
    189. 7.189. Functoriality of set truncation
    190. 7.190. Functoriality of truncations
    191. 7.191. The fundamental theorem of identity types
    192. 7.192. Global choice
    193. 7.193. Global subuniverses
    194. 7.194. Higher homotopies of morphisms of arrows
    195. 7.195. Hilbert's ε-operators
    196. 7.196. Homotopies
    197. 7.197. Homotopies of morphisms of arrows
    198. 7.198. Homotopy algebra
    199. 7.199. Homotopy induction
    200. 7.200. The homotopy preorder of types
    201. 7.201. Idempotent maps
    202. 7.202. Identity systems
    203. 7.203. Identity types of truncated types
    204. 7.204. Identity types
    205. 7.205. The image of a map
    206. 7.206. Images of subtypes
    207. 7.207. Implicit function types
    208. 7.208. Impredicative encodings of the logical operations
    209. 7.209. Impredicative universes
    210. 7.210. The induction principle for propositional truncation
    211. 7.211. Infinitely coherent equivalences
    212. 7.212. Inhabited subtypes
    213. 7.213. Inhabited types
    214. 7.214. Injective maps
    215. 7.215. The interchange law
    216. 7.216. Intersections of subtypes
    217. 7.217. Inverse sequential diagrams of types
    218. 7.218. Invertible maps
    219. 7.219. Involutions
    220. 7.220. Isolated elements
    221. 7.221. Isomorphisms of sets
    222. 7.222. Iterated cartesian product types
    223. 7.223. Iterated dependent pair types
    224. 7.224. Iterated dependent product types
    225. 7.225. Iterating automorphisms
    226. 7.226. Iterating functions
    227. 7.227. Iterating involutions
    228. 7.228. Kernel span diagrams of maps
    229. 7.229. Large binary relations
    230. 7.230. Large dependent pair types
    231. 7.231. Large homotopies
    232. 7.232. Large identity types
    233. 7.233. The large locale of propositions
    234. 7.234. The large locale of subtypes
    235. 7.235. The law of excluded middle
    236. 7.236. Lawvere's fixed point theorem
    237. 7.237. The lesser limited principle of omniscience
    238. 7.238. Lifts of types
    239. 7.239. The limited principle of omniscience
    240. 7.240. Locally small types
    241. 7.241. Logical equivalences
    242. 7.242. The maybe modality
    243. 7.243. Mere embeddings
    244. 7.244. Mere equality
    245. 7.245. Mere equivalences
    246. 7.246. Mere functions
    247. 7.247. Mere logical equivalences
    248. 7.248. Monomorphisms
    249. 7.249. Morphisms of arrows
    250. 7.250. Morphisms of binary relations
    251. 7.251. Morphisms of cospan diagrams
    252. 7.252. Morphisms of cospans
    253. 7.253. Morphisms of double arrows
    254. 7.254. Morphisms of inverse sequential diagrams of types
    255. 7.255. Morphisms of span diagrams
    256. 7.256. Morphisms of spans
    257. 7.257. Morphisms of spans on families of types
    258. 7.258. Morphisms of twisted arrows
    259. 7.259. Multisubsets
    260. 7.260. Multivariable correspondences
    261. 7.261. Multivariable decidable relations
    262. 7.262. Multivariable functoriality of set quotients
    263. 7.263. Multivariable homotopies
    264. 7.264. Multivariable operations
    265. 7.265. Multivariable relations
    266. 7.266. Multivariable sections
    267. 7.267. Negated equality
    268. 7.268. Negation
    269. 7.269. Noncontractible types
    270. 7.270. Operations on span diagrams
    271. 7.271. Operations on spans
    272. 7.272. Operations on spans of families of types
    273. 7.273. Opposite spans
    274. 7.274. Pairs of distinct elements
    275. 7.275. Partial elements
    276. 7.276. Partial functions
    277. 7.277. Partial sequences
    278. 7.278. Partitions
    279. 7.279. Path algebra
    280. 7.280. Path-split maps
    281. 7.281. Perfect images
    282. 7.282. Permutations of spans of families of types
    283. 7.283. Π-decompositions of types
    284. 7.284. Π-decompositions of types into types in a subuniverse
    285. 7.285. Pointed torsorial type families
    286. 7.286. Postcomposition of dependent functions
    287. 7.287. Postcomposition of functions
    288. 7.288. Postcomposition of pullbacks
    289. 7.289. Powersets
    290. 7.290. Precomposition of dependent functions
    291. 7.291. Precomposition of functions
    292. 7.292. Precomposition of functions into subuniverses
    293. 7.293. Precomposition of type families
    294. 7.294. Preimages of subtypes
    295. 7.295. The preunivalence axiom
    296. 7.296. Preunivalent type families
    297. 7.297. The principle of omniscience
    298. 7.298. Product decompositions
    299. 7.299. Product decompositions of types in a subuniverse
    300. 7.300. Products of binary relations
    301. 7.301. Products of equivalence relataions
    302. 7.302. Products of tuples of types
    303. 7.303. Products of pullbacks
    304. 7.304. Products of unordered pairs of types
    305. 7.305. Products of unordered tuples of types
    306. 7.306. Projective types
    307. 7.307. Proper subsets
    308. 7.308. Propositional extensionality
    309. 7.309. Propositional maps
    310. 7.310. Propositional resizing
    311. 7.311. Propositional truncations
    312. 7.312. Propositions
    313. 7.313. Pullbacks
    314. 7.314. Pullbacks of subtypes
    315. 7.315. Quasicoherently idempotent maps
    316. 7.316. Raising universe levels
    317. 7.317. Reflecting maps for equivalence relations
    318. 7.318. Reflexive relations
    319. 7.319. The Regensburg extension of the fundamental theorem of identity types
    320. 7.320. Relaxed Σ-decompositions of types
    321. 7.321. Repetitions of values of maps
    322. 7.322. Repetitions in sequences
    323. 7.323. The type theoretic replacement axiom
    324. 7.324. Retractions
    325. 7.325. Retracts of maps
    326. 7.326. Retracts of types
    327. 7.327. Russell's paradox
    328. 7.328. Sections
    329. 7.329. Separated types
    330. 7.330. Sequences
    331. 7.331. Sequential limits
    332. 7.332. Set presented types
    333. 7.333. Set quotients
    334. 7.334. Set truncations
    335. 7.335. Sets
    336. 7.336. Shifting sequences
    337. 7.337. Σ-closed subuniverses
    338. 7.338. Σ-decompositions of types into types in a subuniverse
    339. 7.339. Σ-decompositions of types
    340. 7.340. Singleton induction
    341. 7.341. Singleton subtypes
    342. 7.342. Morphisms in the slice category of types
    343. 7.343. Small maps
    344. 7.344. Small types
    345. 7.345. Small universes
    346. 7.346. Sorial type families
    347. 7.347. Span diagrams
    348. 7.348. Span diagrams on families of types
    349. 7.349. Spans of types
    350. 7.350. Spans of families of types
    351. 7.351. Split idempotent maps
    352. 7.352. Split surjective maps
    353. 7.353. Standard apartness relations
    354. 7.354. Standard pullbacks
    355. 7.355. Strict symmetrization of binary relations
    356. 7.356. Strictly involutive identity types
    357. 7.357. The strictly right unital concatenation operation on identifications
    358. 7.358. Strongly extensional maps
    359. 7.359. Structure
    360. 7.360. The structure identity principle
    361. 7.361. Structured type duality
    362. 7.362. Subsingleton induction
    363. 7.363. Subterminal types
    364. 7.364. Subtype duality
    365. 7.365. The subtype identity principle
    366. 7.366. Subtypes
    367. 7.367. Subuniverses
    368. 7.368. Surjective maps
    369. 7.369. Symmetric binary relations
    370. 7.370. Symmetric cores of binary relations
    371. 7.371. Symmetric difference of subtypes
    372. 7.372. The symmetric identity types
    373. 7.373. Symmetric operations
    374. 7.374. Telescopes
    375. 7.375. Terminal spans on families of types
    376. 7.376. Tight apartness relations
    377. 7.377. Torsorial type families
    378. 7.378. Total partial elements
    379. 7.379. Total partial functions
    380. 7.380. Transfinite cocomposition of maps
    381. 7.381. Transport along equivalences
    382. 7.382. Transport along higher identifications
    383. 7.383. Transport along homotopies
    384. 7.384. Transport along identifications
    385. 7.385. Transport-split type families
    386. 7.386. Transposing identifications along equivalences
    387. 7.387. Transposing identifications along retractions
    388. 7.388. Transposing identifications along sections
    389. 7.389. Transposition of span diagrams
    390. 7.390. Trivial relaxed Σ-decompositions
    391. 7.391. Trivial Σ-decompositions
    392. 7.392. Truncated equality
    393. 7.393. Truncated maps
    394. 7.394. Truncated types
    395. 7.395. k-Equivalences
    396. 7.396. Truncation images of maps
    397. 7.397. Truncation levels
    398. 7.398. The truncation modalities
    399. 7.399. Truncations
    400. 7.400. Tuples of types
    401. 7.401. Type arithmetic with the booleans
    402. 7.402. Type arithmetic for cartesian product types
    403. 7.403. Type arithmetic for coproduct types
    404. 7.404. Type arithmetic with dependent function types
    405. 7.405. Type arithmetic for dependent pair types
    406. 7.406. Type arithmetic with the empty type
    407. 7.407. Type arithmetic with the unit type
    408. 7.408. Type duality
    409. 7.409. The type theoretic principle of choice
    410. 7.410. Unions of subtypes
    411. 7.411. Uniqueness of the image of a map
    412. 7.412. Uniqueness quantification
    413. 7.413. The uniqueness of set quotients
    414. 7.414. Uniqueness of set truncations
    415. 7.415. Uniqueness of the truncations
    416. 7.416. The unit type
    417. 7.417. Unital binary operations
    418. 7.418. The univalence axiom
    419. 7.419. The univalence axiom implies function extensionality
    420. 7.420. Univalent type families
    421. 7.421. The universal property of booleans
    422. 7.422. The universal properties of cartesian product types
    423. 7.423. Universal property of contractible types
    424. 7.424. The universal property of coproduct types
    425. 7.425. The universal property of dependent function types
    426. 7.426. The universal property of dependent pair types
    427. 7.427. The universal property of the empty type
    428. 7.428. The universal property of equivalences
    429. 7.429. The universal property of the family of fibers of maps
    430. 7.430. The universal property of fiber products
    431. 7.431. The universal property of identity systems
    432. 7.432. The universal property of identity types
    433. 7.433. The universal property of the image of a map
    434. 7.434. The universal property of maybe
    435. 7.435. The universal property of propositional truncations
    436. 7.436. The universal property of propositional truncations with respect to sets
    437. 7.437. The universal property of pullbacks
    438. 7.438. The universal property of sequential limits
    439. 7.439. The universal property of set quotients
    440. 7.440. The universal property of set truncations
    441. 7.441. The universal property of truncations
    442. 7.442. The universal property of the unit type
    443. 7.443. Universal quantification
    444. 7.444. Universe levels
    445. 7.445. Unordered pairs of elements in a type
    446. 7.446. Unordered pairs of types
    447. 7.447. Unordered n-tuples of elements in a type
    448. 7.448. Unordered tuples of types
    449. 7.449. Vectors of set quotients
    450. 7.450. Weak function extensionality
    451. 7.451. The weak limited principle of omniscience
    452. 7.452. Weakly constant maps
    453. 7.453. Whiskering higher homotopies with respect to composition
    454. 7.454. Whiskering homotopies with respect to composition
    455. 7.455. Whiskering homotopies with respect to concatenation
    456. 7.456. Whiskering identifications with respect to concatenation
    457. 7.457. Whiskering operations
    458. 7.458. Yoneda identity types
  10. 8. Foundation core
    ❱
    1. 8.1. 1-Types
    2. 8.2. Cartesian product types
    3. 8.3. Coherently invertible maps
    4. 8.4. Commuting prisms of maps
    5. 8.5. Commuting squares of homotopies
    6. 8.6. Commuting squares of identifications
    7. 8.7. Commuting squares of maps
    8. 8.8. Commuting triangles of maps
    9. 8.9. Constant maps
    10. 8.10. Contractible maps
    11. 8.11. Contractible types
    12. 8.12. Coproduct types
    13. 8.13. Decidable propositions
    14. 8.14. Dependent identifications
    15. 8.15. Diagonal maps into cartesian products of types
    16. 8.16. Discrete types
    17. 8.17. Embeddings
    18. 8.18. Empty types
    19. 8.19. Endomorphisms
    20. 8.20. Equality of dependent pair types
    21. 8.21. Equivalence relations
    22. 8.22. Equivalences
    23. 8.23. Families of equivalences
    24. 8.24. Fibers of maps
    25. 8.25. Function types
    26. 8.26. Functoriality of dependent function types
    27. 8.27. Functoriality of dependent pair types
    28. 8.28. Homotopies
    29. 8.29. Identity types
    30. 8.30. Injective maps
    31. 8.31. Invertible maps
    32. 8.32. Negation
    33. 8.33. Operations on span diagrams
    34. 8.34. Operations on spans
    35. 8.35. Path-split maps
    36. 8.36. Postcomposition of dependent functions
    37. 8.37. Postcomposition of functions
    38. 8.38. Precomposition of dependent functions
    39. 8.39. Precomposition of functions
    40. 8.40. Propositional maps
    41. 8.41. Propositions
    42. 8.42. Pullbacks
    43. 8.43. Retractions
    44. 8.44. Retracts of types
    45. 8.45. Sections
    46. 8.46. Sets
    47. 8.47. Small types
    48. 8.48. Subtypes
    49. 8.49. Torsorial type families
    50. 8.50. Transport along identifications
    51. 8.51. Truncated maps
    52. 8.52. Truncated types
    53. 8.53. Truncation levels
    54. 8.54. The type theoretic principle of choice
    55. 8.55. The univalence axiom
    56. 8.56. The universal property of pullbacks
    57. 8.57. The universal property of truncations
    58. 8.58. Whiskering homotopies with respect to concatenation
    59. 8.59. Whiskering identifications with respect to concatenation
  11. 9. Graph theory
    ❱
    1. 9.1. Acyclic undirected graphs
    2. 9.2. Circuits in undirected graphs
    3. 9.3. Closed walks in undirected graphs
    4. 9.4. Complete bipartite graphs
    5. 9.5. Complete multipartite graphs
    6. 9.6. Complete undirected graphs
    7. 9.7. Connected graphs
    8. 9.8. Cycles in undirected graphs
    9. 9.9. Directed graph structures on standard finite sets
    10. 9.10. Directed graphs
    11. 9.11. Discrete graphs
    12. 9.12. Displayed large reflexive graphs
    13. 9.13. Edge-coloured undirected graphs
    14. 9.14. Embeddings of directed graphs
    15. 9.15. Embeddings of undirected graphs
    16. 9.16. Enriched undirected graphs
    17. 9.17. Equivalences of directed graphs
    18. 9.18. Equivalences of enriched undirected graphs
    19. 9.19. Equivalences of undirected graphs
    20. 9.20. Eulerian circuits in undirected graphs
    21. 9.21. Faithful morphisms of undirected graphs
    22. 9.22. Fibers of directed graphs
    23. 9.23. Finite graphs
    24. 9.24. Geometric realizations of undirected graphs
    25. 9.25. Higher directed graphs
    26. 9.26. Hypergraphs
    27. 9.27. Large higher directed graphs
    28. 9.28. Large reflexive graphs
    29. 9.29. Matchings
    30. 9.30. Mere equivalences of undirected graphs
    31. 9.31. Morphisms of directed graphs
    32. 9.32. Morphisms of undirected graphs
    33. 9.33. Incidence in undirected graphs
    34. 9.34. Orientations of undirected graphs
    35. 9.35. Paths in undirected graphs
    36. 9.36. Polygons
    37. 9.37. Raising universe levels of directed graphs
    38. 9.38. Reflecting maps of undirected graphs
    39. 9.39. Reflexive graphs
    40. 9.40. Regular undirected graph
    41. 9.41. Simple undirected graphs
    42. 9.42. Stereoisomerism for enriched undirected graphs
    43. 9.43. Totally faithful morphisms of undirected graphs
    44. 9.44. Trails in directed graphs
    45. 9.45. Trails in undirected graphs
    46. 9.46. Undirected graph structures on standard finite sets
    47. 9.47. Undirected graphs
    48. 9.48. Vertex covers
    49. 9.49. Voltage graphs
    50. 9.50. Walks in directed graphs
    51. 9.51. Walks in undirected graphs
    52. 9.52. Wide displayed large reflexive graphs
  12. 10. Group theory
    ❱
    1. 10.1. Abelian groups
    2. 10.2. Abelianization of groups
    3. 10.3. Pointwise addition of morphisms of abelian groups
    4. 10.4. Automorphism groups
    5. 10.5. Cartesian products of abelian groups
    6. 10.6. Cartesian products of concrete groups
    7. 10.7. Cartesian products of groups
    8. 10.8. Cartesian products of monoids
    9. 10.9. Cartesian products of semigroups
    10. 10.10. The category of abelian groups
    11. 10.11. The category of concrete groups
    12. 10.12. The category of group actions
    13. 10.13. The category of groups
    14. 10.14. The orbit category of a group
    15. 10.15. The category of semigroups
    16. 10.16. Cayley's theorem
    17. 10.17. The center of a group
    18. 10.18. Center of a monoid
    19. 10.19. Center of a semigroup
    20. 10.20. Central elements of groups
    21. 10.21. Central elements of monoids
    22. 10.22. Central elements of semirings
    23. 10.23. Centralizer subgroups
    24. 10.24. Characteristic subgroups
    25. 10.25. Commutative monoids
    26. 10.26. Commutator subgroups
    27. 10.27. Commutators of elements in groups
    28. 10.28. Commuting elements of groups
    29. 10.29. Commuting elements of monoids
    30. 10.30. Commuting elements of semigroups
    31. 10.31. Commuting squares of group homomorphisms
    32. 10.32. Concrete group actions
    33. 10.33. Concrete groups
    34. 10.34. Concrete monoids
    35. 10.35. Congruence relations on abelian groups
    36. 10.36. Congruence relations on commutative monoids
    37. 10.37. Congruence relations on groups
    38. 10.38. Congruence relations on monoids
    39. 10.39. Congruence relations on semigroups
    40. 10.40. Conjugation in groups
    41. 10.41. Conjugation on concrete groups
    42. 10.42. Contravariant pushforwards of concrete group actions
    43. 10.43. Cores of monoids
    44. 10.44. Cyclic groups
    45. 10.45. Decidable subgroups of groups
    46. 10.46. Dependent products of abelian groups
    47. 10.47. Dependent products of commutative monoids
    48. 10.48. Dependent products of groups
    49. 10.49. Dependent products of monoids
    50. 10.50. Dependent products of semigroups
    51. 10.51. The dihedral group construction
    52. 10.52. The dihedral groups
    53. 10.53. The E₈-lattice
    54. 10.54. Elements of finite order
    55. 10.55. Embeddings of abelian groups
    56. 10.56. Embeddings of groups
    57. 10.57. The endomorphism rings of abelian groups
    58. 10.58. Epimorphisms in groups
    59. 10.59. Equivalences of concrete group actions
    60. 10.60. Equivalences of concrete groups
    61. 10.61. Equivalences of group actions
    62. 10.62. Equivalences between semigroups
    63. 10.63. Exponents of abelian groups
    64. 10.64. Exponents of groups
    65. 10.65. Free concrete group actions
    66. 10.66. Free groups with one generator
    67. 10.67. The full subgroup of a group
    68. 10.68. The full subsemigroup of a semigroup
    69. 10.69. Function groups of abelian groups
    70. 10.70. Function commutative monoids
    71. 10.71. Function groups
    72. 10.72. Function monoids
    73. 10.73. Function semigroups
    74. 10.74. Functoriality of quotient groups
    75. 10.75. Furstenberg groups
    76. 10.76. Generating elements of groups
    77. 10.77. Generating sets of groups
    78. 10.78. Group actions
    79. 10.79. Abstract groups
    80. 10.80. Homomorphisms of abelian groups
    81. 10.81. Homomorphisms of commutative monoids
    82. 10.82. Morphisms of concrete group actions
    83. 10.83. Homomorphisms of concrete groups
    84. 10.84. Homomorphisms of generated subgroups
    85. 10.85. Homomorphisms of group actions
    86. 10.86. Homomorphisms of groups
    87. 10.87. Homomorphisms of groups equipped with normal subgroups
    88. 10.88. Homomorphisms of monoids
    89. 10.89. Homomorphisms of semigroups
    90. 10.90. Images of group homomorphisms
    91. 10.91. Images of semigroup homomorphisms
    92. 10.92. Integer multiples of elements in abelian groups
    93. 10.93. Integer powers of elements of groups
    94. 10.94. Intersections of subgroups of abelian groups
    95. 10.95. Intersections of subgroups of groups
    96. 10.96. Inverse semigroups
    97. 10.97. Invertible elements in monoids
    98. 10.98. Isomorphisms of abelian groups
    99. 10.99. Isomorphisms of concrete groups
    100. 10.100. Isomorphisms of group actions
    101. 10.101. Isomorphisms of groups
    102. 10.102. Isomorphisms of monoids
    103. 10.103. Isomorphisms of semigroups
    104. 10.104. Iterated cartesian products of concrete groups
    105. 10.105. Kernels of homomorphisms between abelian groups
    106. 10.106. Kernels of homomorphisms of concrete groups
    107. 10.107. Kernels of homomorphisms of groups
    108. 10.108. Large semigroups
    109. 10.109. Concrete automorphism groups on sets
    110. 10.110. Mere equivalences of concrete group actions
    111. 10.111. Mere equivalences of group actions
    112. 10.112. Monoid actions
    113. 10.113. Monoids
    114. 10.114. Monomorphisms of concrete groups
    115. 10.115. Monomorphisms in the category of groups
    116. 10.116. Multiples of elements in abelian groups
    117. 10.117. Nontrivial groups
    118. 10.118. Normal closures of subgroups
    119. 10.119. Normal cores of subgroups
    120. 10.120. Normal subgroups
    121. 10.121. Normal subgroups of concrete groups
    122. 10.122. Normal submonoids
    123. 10.123. Normal submonoids of commutative monoids
    124. 10.124. Normalizer subgroups
    125. 10.125. Nullifying group homomorphisms
    126. 10.126. The opposite of a group
    127. 10.127. The opposite of a semigroup
    128. 10.128. The orbit-stabilizer theorem for concrete groups
    129. 10.129. Orbits of concrete group actions
    130. 10.130. Orbits of group actions
    131. 10.131. The order of an element in a group
    132. 10.132. Perfect cores
    133. 10.133. Perfect groups
    134. 10.134. Perfect subgroups
    135. 10.135. Powers of elements in commutative monoids
    136. 10.136. Powers of elements in groups
    137. 10.137. Powers of elements in monoids
    138. 10.138. The precategory of commutative monoids
    139. 10.139. The precategory of concrete groups
    140. 10.140. The precategory of group actions
    141. 10.141. The precategory of groups
    142. 10.142. The precategory of monoids
    143. 10.143. The precategory of orbits of a monoid action
    144. 10.144. The precategory of semigroups
    145. 10.145. Principal group actions
    146. 10.146. Principal torsors of concrete groups
    147. 10.147. Products of elements in a monoid
    148. 10.148. Products of tuples of elements in commutative monoids
    149. 10.149. Pullbacks of subgroups
    150. 10.150. Pullbacks of subsemigroups
    151. 10.151. Quotient groups
    152. 10.152. Quotient groups of concrete groups
    153. 10.153. Quotients of abelian groups
    154. 10.154. Rational commutative monoids
    155. 10.155. Representations of monoids in precategories
    156. 10.156. Saturated congruence relations on commutative monoids
    157. 10.157. Saturated congruence relations on monoids
    158. 10.158. Semigroups
    159. 10.159. Sheargroups
    160. 10.160. Shriek of concrete group homomorphisms
    161. 10.161. Stabilizer groups
    162. 10.162. Stabilizers of concrete group actions
    163. 10.163. Subgroups
    164. 10.164. Subgroups of abelian groups
    165. 10.165. Subgroups of concrete groups
    166. 10.166. Subgroups generated by elements of a group
    167. 10.167. Subgroups generated by families of elements
    168. 10.168. Subgroups generated by subsets of groups
    169. 10.169. Submonoids
    170. 10.170. Submonoids of commutative monoids
    171. 10.171. Subsemigroups
    172. 10.172. Subsets of abelian groups
    173. 10.173. Subsets of commutative monoids
    174. 10.174. Subsets of groups
    175. 10.175. Subsets of monoids
    176. 10.176. Subsets of semigroups
    177. 10.177. The substitution functor of concrete group actions
    178. 10.178. The substitution functor of group actions
    179. 10.179. Surjective group homomorphisms
    180. 10.180. Surjective semigroup homomorphisms
    181. 10.181. Symmetric concrete groups
    182. 10.182. Symmetric groups
    183. 10.183. Torsion elements of groups
    184. 10.184. Torsion-free groups
    185. 10.185. Torsors of abstract groups
    186. 10.186. Transitive concrete group actions
    187. 10.187. Transitive group actions
    188. 10.188. Trivial concrete groups
    189. 10.189. Trivial group homomorphisms
    190. 10.190. Trivial groups
    191. 10.191. Trivial subgroups
    192. 10.192. Unordered tuples of elements in commutative monoids
    193. 10.193. Wild representations of monoids
  13. 11. Higher group theory
    ❱
    1. 11.1. Cartesian products of higher groups
    2. 11.2. Conjugation in higher groups
    3. 11.3. Cyclic higher groups
    4. 11.4. Deloopable groups
    5. 11.5. Deloopable H-spaces
    6. 11.6. Deloopable types
    7. 11.7. Eilenberg-Mac Lane spaces
    8. 11.8. Equivalences of higher groups
    9. 11.9. Fixed points of higher group actions
    10. 11.10. Free higher group actions
    11. 11.11. Higher group actions
    12. 11.12. Higher groups
    13. 11.13. Homomorphisms of higher group actions
    14. 11.14. Homomorphisms of higher groups
    15. 11.15. The higher group of integers
    16. 11.16. Iterated cartesian products of higher groups
    17. 11.17. Iterated deloopings of pointed types
    18. 11.18. Orbits of higher group actions
    19. 11.19. Small ∞-groups
    20. 11.20. Subgroups of higher groups
    21. 11.21. Symmetric higher groups
    22. 11.22. Transitive higher group actions
    23. 11.23. Trivial higher groups
  14. 12. Linear algebra
    ❱
    1. 12.1. Constant matrices
    2. 12.2. Diagonal vectors
    3. 12.3. Diagonal matrices on rings
    4. 12.4. Functoriality of the type of matrices
    5. 12.5. Functoriality of the type of vectors
    6. 12.6. Matrices
    7. 12.7. Matrices on rings
    8. 12.8. Multiplication of matrices
    9. 12.9. Scalar multiplication on matrices
    10. 12.10. Scalar multiplication of vectors
    11. 12.11. Scalar multiplication of vectors on rings
    12. 12.12. Transposition of matrices
    13. 12.13. Vectors
    14. 12.14. Vectors on commutative rings
    15. 12.15. Vectors on commutative semirings
    16. 12.16. Vectors on euclidean domains
    17. 12.17. Vectors on rings
    18. 12.18. Vectors on semirings
  15. 13. Lists
    ❱
    1. 13.1. Arrays
    2. 13.2. Concatenation of lists
    3. 13.3. Flattening of lists
    4. 13.4. Functoriality of the list operation
    5. 13.5. Lists
    6. 13.6. Lists of elements in discrete types
    7. 13.7. Lists subtypes
    8. 13.8. Permutations of lists
    9. 13.9. Permutations of vectors
    10. 13.10. Predicates on lists
    11. 13.11. Quicksort for lists
    12. 13.12. Reversing lists
    13. 13.13. Sort by insertion for lists
    14. 13.14. Sort by insertion for vectors
    15. 13.15. Sorted lists
    16. 13.16. Sorted vectors
    17. 13.17. Sorting algorithms for lists
    18. 13.18. Sorting algorithms for vectors
    19. 13.19. The universal property of lists with respect to wild monoids
  16. 14. Modal logic
    ❱
    1. 14.1. Modal logic axioms
    2. 14.2. Canonical model theorem
    3. 14.3. Canonical threories
    4. 14.4. Closed under subformulas theories
    5. 14.5. Modal logic completeness
    6. 14.6. Completeness of K
    7. 14.7. Completeness of S5
    8. 14.8. Modal logic decision
    9. 14.9. Modal logic deduction
    10. 14.10. Filtrated Kripke Classes
    11. 14.11. Kripke models filtrations theorem
    12. 14.12. Finite approximability
    13. 14.13. Modal logic formulas
    14. 14.14. Formulas deduction
    15. 14.15. Kripke models filtrations
    16. 14.16. Krikpe semantics
    17. 14.17. L-complete theories
    18. 14.18. L-consistent theories
    19. 14.19. Lindenbaum's lemma
    20. 14.20. Minimal Kripke filtration
    21. 14.21. Minimal transitive Kripke filtration
    22. 14.22. Modal logic K
    23. 14.23. Modal logic S5
    24. 14.24. Modal logic soundness
    25. 14.25. Modal logic subformulas
    26. 14.26. Weak deduction
  17. 15. Modal type theory
    ❱
    1. 15.1. Crisp identity types
    2. 15.2. The crisp law of excluded middle
    3. 15.3. Flat dependent function types
    4. 15.4. Flat dependent pair types
    5. 15.5. Flat discrete types
    6. 15.6. The flat modality
    7. 15.7. The flat-sharp adjunction
    8. 15.8. Sharp codiscrete maps
    9. 15.9. Sharp codiscrete types
    10. 15.10. The sharp modality
  18. 16. Online encyclopedia of integer sequences
    ❱
    1. 16.1. Sequences of the online encyclopedia of integer sequences
  19. 17. Order theory
    ❱
    1. 17.1. Accessible elements with respect to relations
    2. 17.2. Bottom elements in posets
    3. 17.3. Bottom elements in preorders
    4. 17.4. Chains in posets
    5. 17.5. Chains in preorders
    6. 17.6. Closure operators on large locales
    7. 17.7. Closure operators on large posets
    8. 17.8. Commuting squares of Galois connections between large posets
    9. 17.9. Commuting squares of order preserving maps of large posets
    10. 17.10. Coverings in locales
    11. 17.11. Decidable posets
    12. 17.12. Decidable preorders
    13. 17.13. Decidable subposets
    14. 17.14. Decidable subpreorders
    15. 17.15. Decidable total orders
    16. 17.16. Decidable total preorders
    17. 17.17. Dependent products of large frames
    18. 17.18. Dependent products of large locales
    19. 17.19. Dependent products of large meet-semilattices
    20. 17.20. Dependent products of large posets
    21. 17.21. Dependent products large preorders
    22. 17.22. Dependent products of large suplattices
    23. 17.23. Directed complete posets
    24. 17.24. Directed families in posets
    25. 17.25. Distributive lattices
    26. 17.26. Finite coverings in locales
    27. 17.27. Finite posets
    28. 17.28. Finite preorders
    29. 17.29. Finite total orders
    30. 17.30. Finitely graded posets
    31. 17.31. Frames
    32. 17.32. Galois connections
    33. 17.33. Galois connections between large posets
    34. 17.34. Greatest lower bounds in large posets
    35. 17.35. Greatest lower bounds in posets
    36. 17.36. Homomorphisms of frames
    37. 17.37. Homomorphisms of large frames
    38. 17.38. Homomorphisms of large locales
    39. 17.39. Homomorphisms of large meet-semilattices
    40. 17.40. Homomorphisms of large suplattices
    41. 17.41. Homomorphisms of meet-semilattices
    42. 17.42. Homomorphisms of meet sup lattices
    43. 17.43. Homomorphisms of suplattices
    44. 17.44. Ideals in preorders
    45. 17.45. Inhabited finite total orders
    46. 17.46. Interval subposets
    47. 17.47. Join-semilattices
    48. 17.48. Large frames
    49. 17.49. Large locales
    50. 17.50. Large meet-semilattices
    51. 17.51. Large meet-subsemilattices
    52. 17.52. Large posets
    53. 17.53. Large preorders
    54. 17.54. Large quotient locales
    55. 17.55. Large subframes
    56. 17.56. Large subposets
    57. 17.57. Large subpreorders
    58. 17.58. Large subsuplattices
    59. 17.59. Large suplattices
    60. 17.60. Lattices
    61. 17.61. Least upper bounds in large posets
    62. 17.62. Least upper bounds in posets
    63. 17.63. Locales
    64. 17.64. Locally finite posets
    65. 17.65. Lower bounds in large posets
    66. 17.66. Lower bounds in posets
    67. 17.67. Lower sets in large posets
    68. 17.68. Lower types in preorders
    69. 17.69. Maximal chains in posets
    70. 17.70. Maximal chains in preorders
    71. 17.71. Maximal elements in posets
    72. 17.72. Meet-semilattices
    73. 17.73. Meet-suplattices
    74. 17.74. Nuclei on large locales
    75. 17.75. Order preserving maps between large posets
    76. 17.76. Order preserving maps between large preorders
    77. 17.77. Order preserving maps on posets
    78. 17.78. Order preserving maps on preorders
    79. 17.79. Posets
    80. 17.80. Powers of large locales
    81. 17.81. The precategory of decidable total orders
    82. 17.82. The precategory of finite posets
    83. 17.83. The precategory of finite total orders
    84. 17.84. The precategory of inhabited finite total orders
    85. 17.85. The precategory of posets
    86. 17.86. The precategory of total orders
    87. 17.87. Preorders
    88. 17.88. Principal lower sets of large posets
    89. 17.89. Principal upper sets of large posets
    90. 17.90. Reflective Galois connections between large posets
    91. 17.91. Similarity of elements in large posets
    92. 17.92. Similarity of elements in large preorders
    93. 17.93. Similarity of order preserving maps between large posets
    94. 17.94. Similarity of order preserving maps between large preorders
    95. 17.95. Subposets
    96. 17.96. Subpreorders
    97. 17.97. Subtypes leq Posets
    98. 17.98. Suplattices
    99. 17.99. Top elements in large posets
    100. 17.100. Top elements in posets
    101. 17.101. Top elements in preorders
    102. 17.102. Total orders
    103. 17.103. Total preorders
    104. 17.104. Upper bounds of chains in posets
    105. 17.105. Upper bounds in large posets
    106. 17.106. Upper bounds in posets
    107. 17.107. Upper sets of large posets
    108. 17.108. Well-founded orders
    109. 17.109. Well-founded relations
    110. 17.110. Zorn's lemma
  20. 18. Organic Chemistry
    ❱
    1. 18.1. Alcohols
    2. 18.2. Alkanes
    3. 18.3. Alkenes
    4. 18.4. Alkynes
    5. 18.5. Ethane
    6. 18.6. Hydrocarbons
    7. 18.7. Methane
    8. 18.8. Saturated carbons
  21. 19. Orthogonal factorization systems
    ❱
    1. 19.1. Cd-structures
    2. 19.2. Cellular maps
    3. 19.3. The closed modalities
    4. 19.4. Double lifts of families of elements
    5. 19.5. Extensions of double lifts of families of elements
    6. 19.6. Extensions of families of elements
    7. 19.7. Extensions of maps
    8. 19.8. Factorization operations
    9. 19.9. Factorization operations into function classes
    10. 19.10. Factorization operations into global function classes
    11. 19.11. Factorizations of maps
    12. 19.12. Factorizations of maps into function classes
    13. 19.13. Factorizations of maps into global function classes
    14. 19.14. Function classes
    15. 19.15. Functoriality of higher modalities
    16. 19.16. Functoriality of the pullback-hom
    17. 19.17. Global function classes
    18. 19.18. Higher modalities
    19. 19.19. The identity modality
    20. 19.20. Lifting operations
    21. 19.21. Lifting structures on commuting squares of maps
    22. 19.22. Lifts of families of elements
    23. 19.23. Lifts of maps
    24. 19.24. Local families of types
    25. 19.25. Local maps
    26. 19.26. Local types
    27. 19.27. Localizations at maps
    28. 19.28. Localizations at subuniverses
    29. 19.29. Locally small modal-operators
    30. 19.30. Mere lifting properties
    31. 19.31. Modal induction
    32. 19.32. Modal operators
    33. 19.33. Modal subuniverse induction
    34. 19.34. Null families of types
    35. 19.35. Null maps
    36. 19.36. Null types
    37. 19.37. The open modalities
    38. 19.38. Orthogonal factorization systems
    39. 19.39. Orthogonal maps
    40. 19.40. Precomposition of lifts of families of elements by maps
    41. 19.41. The pullback-hom
    42. 19.42. The raise modalities
    43. 19.43. Reflective modalities
    44. 19.44. Reflective subuniverses
    45. 19.45. Regular cd-structures
    46. 19.46. Separated types
    47. 19.47. Σ-closed modalities
    48. 19.48. Σ-closed reflective modalities
    49. 19.49. Σ-closed reflective subuniverses
    50. 19.50. Stable orthogonal factorization systems
    51. 19.51. Uniquely eliminating modalities
    52. 19.52. Wide function classes
    53. 19.53. Wide global function classes
    54. 19.54. The zero modality
  22. 20. Polytopes
    ❱
    1. 20.1. Abstract polytopes
  23. 21. Primitives
    ❱
    1. 21.1. Characters
    2. 21.2. Floats
    3. 21.3. Machine integers
    4. 21.4. Strings
  24. 22. Real numbers
    ❱
    1. 22.1. Dedekind real numbers
    2. 22.2. Rational real numbers
  25. 23. Reflection
    ❱
    1. 23.1. Abstractions
    2. 23.2. Arguments
    3. 23.3. Boolean reflection
    4. 23.4. Definitions
    5. 23.5. Erasing equality
    6. 23.6. Fixity
    7. 23.7. Group solver
    8. 23.8. Literals
    9. 23.9. Metavariables
    10. 23.10. Names
    11. 23.11. Precategory solver
    12. 23.12. Rewriting
    13. 23.13. Terms
    14. 23.14. The type checking monad
  26. 24. Ring theory
    ❱
    1. 24.1. Additive orders of elements of rings
    2. 24.2. Algebras over rings
    3. 24.3. The binomial theorem for rings
    4. 24.4. The binomial theorem for semirings
    5. 24.5. The category of cyclic rings
    6. 24.6. The category of rings
    7. 24.7. Central elements of rings
    8. 24.8. Central elements of semirings
    9. 24.9. Characteristics of rings
    10. 24.10. Commuting elements of rings
    11. 24.11. Congruence relations on rings
    12. 24.12. Congruence relations on semirings
    13. 24.13. Cyclic rings
    14. 24.14. Dependent products of rings
    15. 24.15. Dependent products of semirings
    16. 24.16. Division rings
    17. 24.17. The free ring with one generator
    18. 24.18. Full ideals of rings
    19. 24.19. Function rings
    20. 24.20. Function semirings
    21. 24.21. Generating elements of rings
    22. 24.22. The group of multiplicative units of a ring
    23. 24.23. Homomorphisms of cyclic rings
    24. 24.24. Homomorphisms of rings
    25. 24.25. Homomorphisms of semirings
    26. 24.26. Ideals generated by subsets of rings
    27. 24.27. Ideals of rings
    28. 24.28. Ideals of semirings
    29. 24.29. Idempotent elements in rings
    30. 24.30. Initial rings
    31. 24.31. Integer multiples of elements of rings
    32. 24.32. Intersections of ideals of rings
    33. 24.33. Intersections of ideals of semirings
    34. 24.34. The invariant basis property of rings
    35. 24.35. Invertible elements in rings
    36. 24.36. Isomorphisms of rings
    37. 24.37. Joins of ideals of rings
    38. 24.38. Joins of left ideals of rings
    39. 24.39. Joins of right ideals of rings
    40. 24.40. Kernels of ring homomorphisms
    41. 24.41. Left ideals generated by subsets of rings
    42. 24.42. Left ideals of rings
    43. 24.43. Local rings
    44. 24.44. Localizations of rings
    45. 24.45. Maximal ideals of rings
    46. 24.46. Modules over rings
    47. 24.47. Multiples of elements in rings
    48. 24.48. Multiplicative orders of elements of rings
    49. 24.49. Nil ideals of rings
    50. 24.50. Nilpotent elements in rings
    51. 24.51. Nilpotent elements in semirings
    52. 24.52. Opposite rings
    53. 24.53. The poset of cyclic rings
    54. 24.54. The poset of ideals of a ring
    55. 24.55. The poset of left ideals of a ring
    56. 24.56. The poset of right ideals of a ring
    57. 24.57. Powers of elements in rings
    58. 24.58. Powers of elements in semirings
    59. 24.59. The precategory of rings
    60. 24.60. The precategory of semirings
    61. 24.61. Products of ideals of rings
    62. 24.62. Products of left ideals of rings
    63. 24.63. Products of right ideals of rings
    64. 24.64. Products of rings
    65. 24.65. Products of subsets of rings
    66. 24.66. Quotient rings
    67. 24.67. Radical ideals of rings
    68. 24.68. Right ideals generated by subsets of rings
    69. 24.69. Right ideals of rings
    70. 24.70. Rings
    71. 24.71. Semirings
    72. 24.72. Subsets of rings
    73. 24.73. Subsets of semirings
    74. 24.74. Sums of elements in rings
    75. 24.75. Sums of elements in semirings
    76. 24.76. Transporting ring structures along isomorphisms of abelian groups
    77. 24.77. Trivial rings
  27. 25. Set theory
    ❱
    1. 25.1. Baire space
    2. 25.2. Cantor space
    3. 25.3. Cardinalities of sets
    4. 25.4. Countable sets
    5. 25.5. Cumulative hierarchy
    6. 25.6. Infinite sets
    7. 25.7. Uncountable sets
  28. 26. Species
    ❱
    1. 26.1. Cartesian exponents of species
    2. 26.2. Cartesian products of species of types
    3. 26.3. Cauchy composition of species of types
    4. 26.4. Cauchy composition of species of types in a subuniverse
    5. 26.5. Cauchy exponentials of species of types
    6. 26.6. Cauchy exponentials of species of types in a subuniverse
    7. 26.7. Cauchy products of species of types
    8. 26.8. Cauchy products of species of types in a subuniverse
    9. 26.9. Cauchy series of species of types
    10. 26.10. Cauchy series of species of types in a subuniverse
    11. 26.11. Composition of Cauchy series of species of types
    12. 26.12. Composition of Cauchy series of species of types in subuniverses
    13. 26.13. Coproducts of species of types
    14. 26.14. Coproducts of species of types in subuniverses
    15. 26.15. Cycle index series of species
    16. 26.16. Derivatives of species
    17. 26.17. Dirichlet exponentials of a species of types
    18. 26.18. Dirichlet exponentials of species of types in a subuniverse
    19. 26.19. Dirichlet products of species of types
    20. 26.20. Dirichlet products of species of types in subuniverses
    21. 26.21. Dirichlet series of species of finite inhabited types
    22. 26.22. Dirichlet series of species of types
    23. 26.23. Dirichlet series of species of types in subuniverses
    24. 26.24. Equivalences of species of types
    25. 26.25. Equivalences of species of types in subuniverses
    26. 26.26. Exponential of Cauchy series of species of types
    27. 26.27. Exponential of Cauchy series of species of types in subuniverses
    28. 26.28. Hasse-Weil species
    29. 26.29. Morphisms of finite species
    30. 26.30. Morphisms of species of types
    31. 26.31. Pointing of species of types
    32. 26.32. The precategory of finite species
    33. 26.33. Products of Cauchy series of species of types
    34. 26.34. Products of Cauchy series of species of types in subuniverses
    35. 26.35. Products of Dirichlet series of species of finite inhabited types
    36. 26.36. Products of Dirichlet series of species of types
    37. 26.37. Products of Dirichlet series of species of types in subuniverses
    38. 26.38. Small Composition of species of finite inhabited types
    39. 26.39. Small Cauchy composition of species types in subuniverses
    40. 26.40. Species of finite inhabited types
    41. 26.41. Species of finite types
    42. 26.42. Species of inhabited types
    43. 26.43. Species of types
    44. 26.44. Species of types in subuniverses
    45. 26.45. The unit of Cauchy composition of types
    46. 26.46. The unit of Cauchy composition of species of types in subuniverses
    47. 26.47. Unlabeled structures of finite species
  29. 27. Structured types
    ❱
    1. 27.1. Cartesian products of types equipped with endomorphisms
    2. 27.2. Central H-spaces
    3. 27.3. Commuting squares of pointed homotopies
    4. 27.4. Commuting squares of pointed maps
    5. 27.5. Commuting triangles of pointed maps
    6. 27.6. Conjugation of pointed types
    7. 27.7. Constant pointed maps
    8. 27.8. Contractible pointed types
    9. 27.9. Cyclic types
    10. 27.10. Dependent products of H-spaces
    11. 27.11. Dependent products of pointed types
    12. 27.12. Dependent products of wild monoids
    13. 27.13. Dependent types equipped with automorphisms
    14. 27.14. Equivalences of H-spaces
    15. 27.15. Equivalences of pointed arrows
    16. 27.16. Equivalences of types equipped with automorphisms
    17. 27.17. Equivalences of types equipped with endomorphisms
    18. 27.18. Faithful pointed maps
    19. 27.19. Fibers of pointed maps
    20. 27.20. Finite multiplication in magmas
    21. 27.21. Function H-spaces
    22. 27.22. Function magmas
    23. 27.23. Function wild monoids
    24. 27.24. Globular types
    25. 27.25. H-spaces
    26. 27.26. The initial pointed type equipped with an automorphism
    27. 27.27. The involutive type of H-space structures on a pointed type
    28. 27.28. Involutive types
    29. 27.29. Iterated cartesian products of types equipped with endomorphisms
    30. 27.30. Iterated cartesian products of pointed types
    31. 27.31. Large globular types
    32. 27.32. Large reflexive globular types
    33. 27.33. Large symmetric globular types
    34. 27.34. Large transitive globular types
    35. 27.35. Magmas
    36. 27.36. Mere equivalences of types equipped with endomorphisms
    37. 27.37. Morphisms of H-spaces
    38. 27.38. Morphisms of magmas
    39. 27.39. Morphisms of pointed arrows
    40. 27.40. Morphisms of twisted pointed arrows
    41. 27.41. Morphisms of types equipped with automorphisms
    42. 27.42. Morphisms of types equipped with endomorphisms
    43. 27.43. Morphisms of wild monoids
    44. 27.44. Noncoherent H-spaces
    45. 27.45. Opposite pointed spans
    46. 27.46. Pointed 2-homotopies
    47. 27.47. Pointed cartesian product types
    48. 27.48. Pointed dependent functions
    49. 27.49. Pointed dependent pair types
    50. 27.50. Pointed equivalences
    51. 27.51. Pointed families of types
    52. 27.52. Pointed homotopies
    53. 27.53. Pointed isomorphisms
    54. 27.54. Pointed maps
    55. 27.55. Pointed retractions of pointed maps
    56. 27.56. Pointed sections of pointed maps
    57. 27.57. Pointed span diagrams
    58. 27.58. Pointed spans
    59. 27.59. Pointed types
    60. 27.60. Pointed types equipped with automorphisms
    61. 27.61. The pointed unit type
    62. 27.62. Universal property of contractible types with respect to pointed types and maps
    63. 27.63. Postcomposition of pointed maps
    64. 27.64. Precomposition of pointed maps
    65. 27.65. Reflexive globular types
    66. 27.66. Sets equipped with automorphisms
    67. 27.67. Small pointed types
    68. 27.68. Symmetric elements of involutive types
    69. 27.69. Symmetric globular types
    70. 27.70. Symmetric H-spaces
    71. 27.71. Transitive globular types
    72. 27.72. Transposition of pointed span diagrams
    73. 27.73. Types equipped with automorphisms
    74. 27.74. Types equipped with endomorphisms
    75. 27.75. Uniform pointed homotopies
    76. 27.76. The universal property of pointed equivalences
    77. 27.77. Unpointed maps between pointed types
    78. 27.78. Whiskering pointed homotopies with respect to concatenation
    79. 27.79. Whiskering of pointed homotopies with respect to composition of pointed maps
    80. 27.80. Wild groups
    81. 27.81. Wild loops
    82. 27.82. Wild monoids
    83. 27.83. Wild quasigroups
    84. 27.84. Wild semigroups
  30. 28. Synthetic homotopy theory
    ❱
    1. 28.1. 0-acyclic maps
    2. 28.2. 0-acyclic types
    3. 28.3. 1-acyclic types
    4. 28.4. Formalization of the Symmetry book - 26 id pushout
    5. 28.5. Acyclic maps
    6. 28.6. Acyclic types
    7. 28.7. The category of connected set bundles over the circle
    8. 28.8. Cavallo's trick
    9. 28.9. The circle
    10. 28.10. Cocartesian morphisms of arrows
    11. 28.11. Cocones under pointed span diagrams
    12. 28.12. Cocones under sequential diagrams
    13. 28.13. Cocones under spans
    14. 28.14. Codiagonals of maps
    15. 28.15. Coequalizers
    16. 28.16. Cofibers
    17. 28.17. Coforks
    18. 28.18. Correspondence between cocones under sequential diagrams and certain coforks
    19. 28.19. Conjugation of loops
    20. 28.20. Connected set bundles over the circle
    21. 28.21. Dependent cocones under sequential diagrams
    22. 28.22. Dependent cocones under spans
    23. 28.23. Dependent coforks
    24. 28.24. Dependent descent for the circle
    25. 28.25. The dependent pullback property of pushouts
    26. 28.26. Dependent pushout-products
    27. 28.27. Dependent sequential diagrams
    28. 28.28. Dependent suspension structures
    29. 28.29. The dependent universal property of coequalizers
    30. 28.30. The dependent universal property of pushouts
    31. 28.31. The dependent universal property of sequential colimits
    32. 28.32. Dependent universal property of suspensions
    33. 28.33. The descent property of the circle
    34. 28.34. Descent data for constant type families over the circle
    35. 28.35. Descent data for families of dependent pair types over the circle
    36. 28.36. Descent data for families of equivalence types over the circle
    37. 28.37. Descent data for families of function types over the circle
    38. 28.38. Subtypes of descent data for the circle
    39. 28.39. Descent data for pushouts
    40. 28.40. Descent data for sequential colimits
    41. 28.41. Descent property of pushouts
    42. 28.42. Descent property of sequential colimits
    43. 28.43. Double loop spaces
    44. 28.44. The Eckmann-Hilton argument
    45. 28.45. Equifibered sequential diagrams
    46. 28.46. Equivalences of cocones under sequential diagrams
    47. 28.47. Equivalences of coforks
    48. 28.48. Equivalances of dependent sequential diagrams
    49. 28.49. Equivalences of descent data for pushouts
    50. 28.50. Equivalences of sequential diagrams
    51. 28.51. Families with descent data for pushouts
    52. 28.52. Families with descent data for sequential colimits
    53. 28.53. The flattening lemma for coequalizers
    54. 28.54. The flattening lemma for pushouts
    55. 28.55. The flattening lemma for sequential colimits
    56. 28.56. Free loops
    57. 28.57. Functoriality of the loop space operation
    58. 28.58. Functoriality of sequential colimits
    59. 28.59. Functoriality of suspensions
    60. 28.60. Groups of loops in 1-types
    61. 28.61. Hatcher's acyclic type
    62. 28.62. The induction principle of pushouts
    63. 28.63. The infinite complex projective space
    64. 28.64. Infinite cyclic types
    65. 28.65. The interval
    66. 28.66. Iterated loop spaces
    67. 28.67. Iterated suspensions of pointed types
    68. 28.68. Join powers of types
    69. 28.69. Joins of maps
    70. 28.70. Joins of types
    71. 28.71. Loop spaces
    72. 28.72. Maps of prespectra
    73. 28.73. Mere spheres
    74. 28.74. Morphisms of cocones under morphisms of sequential diagrams
    75. 28.75. Morphisms of coforks
    76. 28.76. Morphisms of dependent sequential diagrams
    77. 28.77. Morphisms of descent data of the circle
    78. 28.78. Morphisms of descent data for pushouts
    79. 28.79. Morphisms of sequential diagrams
    80. 28.80. The multiplication operation on the circle
    81. 28.81. Null cocones under pointed span diagrams
    82. 28.82. The plus-principle
    83. 28.83. Powers of loops
    84. 28.84. Premanifolds
    85. 28.85. Prespectra
    86. 28.86. The pullback property of pushouts
    87. 28.87. Pushout-products
    88. 28.88. Pushouts
    89. 28.89. Pushouts of pointed types
    90. 28.90. The recursion principle of pushouts
    91. 28.91. Retracts of sequential diagrams
    92. 28.92. Rewriting rules for pushouts
    93. 28.93. Sections of families over the circle
    94. 28.94. Sequential colimits
    95. 28.95. Sequential diagrams
    96. 28.96. Sequentially compact types
    97. 28.97. Shifts of sequential diagrams
    98. 28.98. Smash products of pointed types
    99. 28.99. Spectra
    100. 28.100. The sphere prespectrum
    101. 28.101. Spheres
    102. 28.102. Suspension prespectra
    103. 28.103. Suspension Structures
    104. 28.104. Suspensions of pointed types
    105. 28.105. Suspensions of types
    106. 28.106. Tangent spheres
    107. 28.107. Total cocones of type families over cocones under sequential diagrams
    108. 28.108. Total sequential diagrams of dependent sequential diagrams
    109. 28.109. Triple loop spaces
    110. 28.110. k-acyclic maps
    111. 28.111. k-acyclic types
    112. 28.112. The universal cover of the circle
    113. 28.113. The universal property of the circle
    114. 28.114. The universal property of coequalizers
    115. 28.115. The universal property of pushouts
    116. 28.116. The universal property of sequential colimits
    117. 28.117. Universal property of suspensions
    118. 28.118. Universal Property of suspensions of pointed types
    119. 28.119. Wedges of pointed types
    120. 28.120. Zigzags between sequential diagrams
  31. 29. Trees
    ❱
    1. 29.1. Algebras for polynomial endofunctors
    2. 29.2. Bases of directed trees
    3. 29.3. Bases of enriched directed trees
    4. 29.4. Binary W-types
    5. 29.5. Bounded multisets
    6. 29.6. The coalgebra of directed trees
    7. 29.7. The coalgebra of enriched directed trees
    8. 29.8. Coalgebras of polynomial endofunctors
    9. 29.9. The combinator of directed trees
    10. 29.10. Combinators of enriched directed trees
    11. 29.11. Directed trees
    12. 29.12. The elementhood relation on coalgebras of polynomial endofunctors
    13. 29.13. The elementhood relation on W-types
    14. 29.14. Empty multisets
    15. 29.15. Enriched directed trees
    16. 29.16. Equivalences of directed trees
    17. 29.17. Equivalences of enriched directed trees
    18. 29.18. Extensional W-types
    19. 29.19. Fibers of directed trees
    20. 29.20. Fibers of enriched directed trees
    21. 29.21. Full binary trees
    22. 29.22. Functoriality of the combinator of directed trees
    23. 29.23. Functoriality of the fiber operation on directed trees
    24. 29.24. Functoriality of W-types
    25. 29.25. Hereditary W-types
    26. 29.26. Indexed W-types
    27. 29.27. Induction principles on W-types
    28. 29.28. Inequality on W-types
    29. 29.29. Lower types of elements in W-types
    30. 29.30. Morphisms of algebras of polynomial endofunctors
    31. 29.31. Morphisms of coalgebras of polynomial endofunctors
    32. 29.32. Morphisms of directed trees
    33. 29.33. Morphisms of enriched directed trees
    34. 29.34. Multiset-indexed dependent products of types
    35. 29.35. Multisets
    36. 29.36. Planar binary trees
    37. 29.37. Plane trees
    38. 29.38. Polynomial endofunctors
    39. 29.39. Raising universe levels of directed trees
    40. 29.40. Ranks of elements in W-types
    41. 29.41. Rooted morphisms of directed trees
    42. 29.42. Rooted morphisms of enriched directed trees
    43. 29.43. Rooted quasitrees
    44. 29.44. Rooted undirected trees
    45. 29.45. Small multisets
    46. 29.46. Submultisets
    47. 29.47. Transitive multisets
    48. 29.48. The underlying trees of elements of coalgebras of polynomial endofunctors
    49. 29.49. The underlying trees of elements of W-types
    50. 29.50. Undirected trees
    51. 29.51. The universal multiset
    52. 29.52. The universal tree
    53. 29.53. The W-type of natural numbers
    54. 29.54. The W-type of the type of propositions
    55. 29.55. W-types
  32. 30. Type theories
    ❱
    1. 30.1. Comprehension of fibered type theories
    2. 30.2. Dependent type theories
    3. 30.3. Fibered dependent type theories
    4. 30.4. Π-types in precategories with attributes
    5. 30.5. Π-types in precategories with families
    6. 30.6. Precategories with attributes
    7. 30.7. Precategories with families
    8. 30.8. Sections of dependent type theories
    9. 30.9. Simple type theories
    10. 30.10. Unityped type theories
  33. 31. Univalent combinatorics
    ❱
    1. 31.1. 2-element decidable subtypes
    2. 31.2. 2-element subtypes
    3. 31.3. 2-element types
    4. 31.4. The binomial types
    5. 31.5. Bracelets
    6. 31.6. Cartesian products of finite types
    7. 31.7. The classical definition of the standard finite types
    8. 31.8. Complements of isolated elements of finite types
    9. 31.9. Coproducts of finite types
    10. 31.10. Counting in type theory
    11. 31.11. Counting the elements of decidable subtypes
    12. 31.12. Counting the elements of dependent pair types
    13. 31.13. Counting the elements of the fiber of a map
    14. 31.14. Counting the elements in Maybe
    15. 31.15. Cubes
    16. 31.16. Cycle partitions of finite types
    17. 31.17. Cycle prime decompositions of natural numbers
    18. 31.18. Cyclic finite types
    19. 31.19. Decidable dependent function types
    20. 31.20. Decidability of dependent pair types
    21. 31.21. Decidable equivalence relations on finite types
    22. 31.22. Decidable propositions
    23. 31.23. Decidable subtypes of finite types
    24. 31.24. Dedekind finite sets
    25. 31.25. Counting the elements of dependent function types
    26. 31.26. Dependent pair types of finite types
    27. 31.27. Finite discrete Σ-decompositions
    28. 31.28. Distributivity of set truncation over finite products
    29. 31.29. Double counting
    30. 31.30. Injective maps
    31. 31.31. Embeddings between standard finite types
    32. 31.32. Equality in finite types
    33. 31.33. Equality in the standard finite types
    34. 31.34. Equivalences between finite types
    35. 31.35. Equivalences of cubes
    36. 31.36. Equivalences between standard finite types
    37. 31.37. Ferrers diagrams (unlabeled partitions)
    38. 31.38. Fibers of maps between finite types
    39. 31.39. Finite choice
    40. 31.40. Finiteness of the type of connected components
    41. 31.41. Finite presentations of types
    42. 31.42. Finite types
    43. 31.43. Finitely presented types
    44. 31.44. Finite function types
    45. 31.45. The image of a map
    46. 31.46. Inequality on types equipped with a counting
    47. 31.47. Inhabited finite types
    48. 31.48. Injective maps between finite types
    49. 31.49. An involution on the standard finite types
    50. 31.50. Isotopies of Latin squares
    51. 31.51. Kuratowsky finite sets
    52. 31.52. Latin squares
    53. 31.53. The groupoid of main classes of Latin hypercubes
    54. 31.54. The groupoid of main classes of Latin squares
    55. 31.55. The maybe modality on finite types
    56. 31.56. Necklaces
    57. 31.57. Orientations of the complete undirected graph
    58. 31.58. Orientations of cubes
    59. 31.59. Partitions of finite types
    60. 31.60. Petri-nets
    61. 31.61. π-finite types
    62. 31.62. The pigeonhole principle
    63. 31.63. Finitely π-presented types
    64. 31.64. Quotients of finite types
    65. 31.65. Ramsey theory
    66. 31.66. Repetitions of values
    67. 31.67. Repetitions of values in sequences
    68. 31.68. Retracts of finite types
    69. 31.69. Sequences of elements in finite types
    70. 31.70. Set quotients of index 2
    71. 31.71. Finite Σ-decompositions of finite types
    72. 31.72. Skipping elements in standard finite types
    73. 31.73. Small types
    74. 31.74. Standard finite pruned trees
    75. 31.75. Standard finite trees
    76. 31.76. The standard finite types
    77. 31.77. Steiner systems
    78. 31.78. Steiner triple systems
    79. 31.79. Subfinite types
    80. 31.80. Combinatorial identities of sums of natural numbers
    81. 31.81. Surjective maps between finite types
    82. 31.82. Symmetric difference of finite subtypes
    83. 31.83. Finite trivial Σ-decompositions
    84. 31.84. Type duality of finite types
    85. 31.85. Unions of finite subtypes
    86. 31.86. The universal property of the standard finite types
    87. 31.87. Unlabeled partitions
    88. 31.88. Unlabeled rooted trees
    89. 31.89. Unlabeled trees
  34. 32. Universal Algebra
    ❱
    1. 32.1. Abstract equations over signatures
    2. 32.2. Algebraic theories
    3. 32.3. Algebraic theory of groups
    4. 32.4. Algebras
    5. 32.5. Congruences
    6. 32.6. Homomorphisms of algebras
    7. 32.7. Kernels of homomorphisms of algebras
    8. 32.8. Models of signatures
    9. 32.9. Quotient algebras
    10. 32.10. Signatures
    11. 32.11. Terms over signatures

agda-unimath

The half-integers

Content created by Fredrik Bakke, Jonathan Prieto-Cubides and Egbert Rijke.

Created on 2022-07-28.
Last modified on 2023-09-10.

module elementary-number-theory.half-integers where
Imports
open import elementary-number-theory.addition-integers
open import elementary-number-theory.integers

open import foundation.coproduct-types
open import foundation.universe-levels

Idea

The half-integers are the numbers of the form x + ½, where x : ℤ.

Definition

The half-integers

ℤ+½ : UU lzero
ℤ+½ = ℤ

The disjoint union of the half-integers with the integers

½ℤ : UU lzero
½ℤ = ℤ+½ + ℤ

The zero element of ½ℤ

zero-½ℤ : ½ℤ
zero-½ℤ = inr zero-ℤ

Addition on ½ℤ

add-½ℤ : ½ℤ → ½ℤ → ½ℤ
add-½ℤ (inl x) (inl y) = inr (succ-ℤ (x +ℤ y))
add-½ℤ (inl x) (inr y) = inl (x +ℤ y)
add-½ℤ (inr x) (inl y) = inl (x +ℤ y)
add-½ℤ (inr x) (inr y) = inr (x +ℤ y)

infixl 35 _+½ℤ_
_+½ℤ_ = add-½ℤ

Recent changes

  • 2023-09-10. Fredrik Bakke. Define precedence levels and associativities for all binary operators (#712).
  • 2023-05-13. Fredrik Bakke. Refactor to use infix binary operators for arithmetic (#620).
  • 2023-03-10. Fredrik Bakke. Additions to fix-import (#497).
  • 2023-03-07. Fredrik Bakke. Add blank lines between <details> tags and markdown syntax (#490).
  • 2023-03-07. Jonathan Prieto-Cubides. Show module declarations (#488).