请输入您要查询的字词:

 

单词 10SetTheory
释义

10. Set theory


Our conception of sets as types with particularly simple homotopical character, cf. \\autorefsec:basics-sets, is quite different from the sets of Zermelo–Fraenkel set theoryMathworldPlanetmath, which form acumulative hierarchy with an intricate nested membership structureMathworldPlanetmath.For many mathematical purposes, the homotopy-theoretic sets are just as good asthe Zermelo–Fraenkel ones, but there are important differencesPlanetmathPlanetmath.

We begin this chapter in \\autorefsec:piw-pretopos by showing that the categoryMathworldPlanetmath 𝒮et has (most of) the usual properties of the category of sets.In constructive, predicative, univalent foundations, it is a “Π𝖶-pretopos”; whereas if we assume propositional resizing(\\autorefsubsec:prop-subsets) it is an elementary topos, and if we assume 𝖫𝖤𝖬 and 𝖠𝖢 then it is a model of Lawvere’s Elementary Theory of the Category of Sets.This is sufficient to ensure that the sets in homotopy type theory behave like sets as used by most mathematicians outside of set theory.

In the rest of the chapter, we investigate some subjects that traditionally belong to “set theory”.In \\autorefsec:cardinals,sec:ordinalsMathworldPlanetmathPlanetmath,sec:wellorderings we study cardinal and ordinal numbers.These are traditionally defined in set theory using the global membership relationMathworldPlanetmathPlanetmathPlanetmath, but we will see that the univalence axiom enables an equally convenient, more “structural” approach.

Finally, in \\autorefsec:cumulative-hierarchy we consider the possibility of constructing inside of homotopy type theory a cumulative hierarchy of sets, equipped with a binary membership relation akin to that of Zermelo–Fraenkel set theory.This combines higher inductive types with ideas from the field of algebraic set theory.

In this chapter we will often use the traditional logical notation described in \\autorefsubsec:prop-trunc.In additionPlanetmathPlanetmath to the basic theory of \\autorefcha:basics,\\autorefcha:logic, we use higher inductive types for colimitsMathworldPlanetmath and quotientsPlanetmathPlanetmath as in \\autorefsec:colimits,\\autorefsec:set-quotients, as well as some of the theory of truncation from \\autorefcha:hlevels, particularly the factorization system of \\autorefsec:image-factorization in the case n=-1.In \\autorefsec:ordinals we use an inductive family (\\autorefsec:generalizationsPlanetmathPlanetmath) to describe well-foundedness, and in \\autorefsec:cumulative-hierarchy we use a more complicated higher inductive type to present the cumulative hierarchy.

随便看

 

数学辞典收录了18232条数学词条,基本涵盖了常用数学知识及数学英语单词词组的翻译及用法,是数学学习的有利工具。

 

Copyright © 2000-2023 Newdu.com.com All Rights Reserved
更新时间:2025/5/4 20:20:36