nLab
presentation axiom

Contents

Idea

In the foundations of mathematics, it's interesting to consider the axiom that the Category Of Sets Has Enough Projectives; in short: COSHEP (pronounced /ko:-shep/). This is more commonly known as the presentation axiom: PAx. It is a weak form of the axiom of choice.

Statement

In elementary terms, COSHEP states

Axiom (COSHEP). For every set A, there exists a set P and a surjection PA, such that every surjection XP has a section.

Remark

The full axiom of choice states that every surjection XA has a section; hence that in the above P may be chosen to be A itself.

This should be read in view of the definition of projective objects:

Definition

An object P in a category C is (externally) projective iff the hom-functor C(P,):CSet takes epis to epis. This is the same as saying: given an epi p:BA and a map f:PA, there exists a lift g:PB in the sense that f=pg.

Accordingly, in a topos the COSHEP axiom says equivalently

Axiom (COSHEP) Every object has a projective presentation. Hence: There are enough projectives.

Borrowing from the philosophy of constructivism, we may also call this a complete presentation.

Remark

The dual axiom, that Set has enough injectives (that is, every set admits an injection into an injective set) is true in every topos, every topos has enough injectives: every power object is an injective object and every object X embeds in its power object PX via the “singleton” map {}:XPX.

Justification

Although perhaps not well known in the literature of constructive mathematics, the COSHEP axiom may be justified by the sort of reasoning usually accepted (except in the school of Fred Richman) to justify the axioms of countable choice and dependent choice (which it implies, by prop. 1 below).

To be explicit, every set A should have a ‘completely presented’ set of ‘canonical’ elements, that is elements given directly as they are constructed without regard for the equality relation imposed upon them. For canonical elements, equality is identity, so the BHK interpretation of logic justifies the axiom of choice for a completely presented set. This set is P, and A is obtained from it as a quotient by the relation of equality on A. This argument can be made precise in many forms of type theory (including those of Martin-Löf and Thierry Coquand), which thus justify COSHEP, much as they are widely known to justify dependent choice.

Consequences

Remark

The existence of sufficiently many projective presentations plays a central role in homological algebra as a means to construct projective resolutions of objects. Tradtionally one often uses the axiom of choice to prove that categories of modules have enough projectives, on the grounds that the free modules are projective.

But the weaker assumption of COSHEP is already sufficient for this purpose: while not every free module will be projective, one can still use COSHEP to find a projective presentation for every free module (and thus for every module). This is discussed in more detail here.

Proposition

The following three conditions on a W-pretopos with enough projectives are equivalent:

  1. The axiom of dependent choice (DC),

  2. The axiom of countable choice (CC),

  3. Projectivity of the singleton (the terminal object) 1.

Note that we normally assume (3) for the category of sets, which is always true internally in any pretopos, so one normally says that DC and CC simply follow from the existence of enough projectives (COSHEP). Equivalently, internal DC and internal CC follow from internal COSHEP.

Proof

Condition 1 easily implies 2. Condition 2 says precisely that the natural numbers object is externally projective, and since 1 is a retract of , it is projective under condition 2, so 2 implies 3. It remains to show 3 implies 1.

Let X be inhabited, so there exists an entire relation given by a jointly monic span

1epiUfX,1 \stackrel{epi}{\leftarrow} U \stackrel{f}{\to} X,

and similarly let

Xepiπ 1Rπ 2XX \stackrel{epi \pi_1}{\leftarrow} R \stackrel{\pi_2}{\to} X

be an entire binary relation. Let p:PX be a projective cover. Since 1 is assumed projective, the cover U1 admits a section σ:1U, and the element fσ:1X lifts through p to an element x 0:1P. Next, in the diagram below, p lifts through the epi π 1 to a map q:PR, and then π 2q lifts through p to a map ϕ (since P is projective):

P ϕ P p q p X π 1 R π 2 X\array{ & & P & \stackrel{\phi}{\to} & P \\ & \swarrow p & \downarrow q & & \downarrow p \\ X & \underset{\pi_1}{\leftarrow} & R & \underset{\pi_2}{\to} & X }

By the universal property of (see recursion), there exists a unique map h:P rendering commutative the diagram

1 0 s id h h 1 x 0 P ϕ P p q p X π 1 R π 2 X\array{ 1 & \stackrel{0}{\to} & \mathbb{N} & \stackrel{s}{\to} & \mathbb{N} \\ id \downarrow & & \downarrow h & & \downarrow h \\ 1 & \underset{x_0}{\to} & P & \underset{\phi}{\to} & P \\ & \swarrow p & \downarrow q & & \downarrow p \\ X & \underset{\pi_1}{\leftarrow} & R & \underset{\pi_2}{\to} & X }

Clearly ph,phs:X×X factors through π 1,π 2:RX×X, i.e., n:(ph(n),ph(n+1))R, thus proving that dependent choice holds under COSHEP.

Example

A topos in which COSHEP holds but 1 is not projective is Set C, where C is the category with three objects and exactly two non-identity arrows abc. For if U:CSet is a functor with U(a)={a 0}, U(b)={b 0,b 1}, and U(c)={c 0}, with U(ab)(a 0)=b 0 and U(cb)(c 0)=b 1, then the map U1 is epi but has no section, so 1 is not projective. On the other hand, as noted below, every presheaf topos satisfies COSHEP, assuming that Set itself does.

Remark

COSHEP also implies several weaker forms of choice, such as the axiom of multiple choice and WISC. In predicative mathematics, it can be combined with the existence of function sets to show the subset collection axiom.

In a topos

When working in the internal logic of a topos, the “internal” meaning of COSHEP is “every object is covered by an internally projective object.” (Compare with the internal axiom of choice: every object is internally projective.) As regards foundational axioms for toposes (in the sort of sense that the axiom of choice is regarded as “foundational”), the internal version of the presentation axiom should be taken as the default version.

Remark

Suppose that 1 is (externally) projective in E. Then E satisfies PAx whenever it satisfies internal PAx.

Remark

Internal PAx does not follows from external PAx; see Example 3. However, if every object is projective (AC), then every object is internally projective (IAC).

A stronger version of PAx may be worth considering. Say that an object is stably projective if its pullback to any slice category is projective. Then stably projective objects are internally projective (proof?). Similarly, if we say that a topos E satisfies stable PAx if every object is covered by a stably projective object, then a topos satisfies internal PAx if it satisfies stable PAx.

Example

Every presheaf topos Set C op has enough projectives, since any coproduct of representables is projective. If in addition C has binary products, then by this result, Set C op validates internal PAx.

Example

However, not every presheaf topos validates internal PAx, even though every presheaf topos validates external PAx. As an example, let C be the category where Ob(C) is the disjoint sum {a,b}, and preordered by taking the reflexive transitive closure of relations nn+1, na, nb. The claim is that neither C(,a), nor any presheaf P that maps epimorphically onto C(,a), can be internally projective. Indeed, consider the presheaf F defined by F(a)=F(b)= and F(n)=(,n], with F(n+1n) the evident inclusion. Let G be the support of F, so that we have an epi e:FG. Then it may be shown that for any P covering C(,a), the set F P(b) is empty and the set G P(b) is nonempty, so that the map e P:F PG P cannot be epic.

Example

Any topos that violates countable choice, of which there are plenty, must also violate internal PAx. (Note that the terminal object of any topos is internally projective, so the proof above that PAx implies CC goes through.)

Example

An interesting example of a topos that has enough projectives and satisfies internal COSHEP (at least, assuming the axiom of choice in Set), although it violates the full (internal) axiom of choice, is the effective topos, and more generally any realizability topos. The reason for this is quite similar to the intuitive justification for COSHEP given above. Technically, it results from the fact that realizability toposes are exact completions; an explanation is given in this remark.

Further properties

Since Set is (essentially regardless of foundations) an exact category, if it has enough projectives then it must be the free exact category PSet ex/lex generated by its subcategory PSet of projective objects. By the construction of the ex/lex completion PSet ex/lex, it follows that every set is the quotient of some “pseudo-equivalence relation” in PSet; i.e., the result of imposing an equality relation on some completely presented set. See SEAR+ε for an application of this idea.

Proposition

COSHEP as a choice principle added to ZF implies a proper class of regular cardinals.

Proof

Since COSHEP implies WISC, and WISC has this implication.

References

When Peter Aczel was developing CZF (a constructive predicative version of ZFC), he considered this axiom, under the name of the presentation axiom, but ultimately rejected it.

  • Peter Aczel. The type theoretic interpretation of constructive set theory. Logic Colloquium ‘77 (Proc. Conf., Wroclaw, 1977), pp. 55–66, Stud. Logic Foundations Math., 96, North-Holland, Amsterdam-New York, 1978. Cited in Palmgren, below.

The presentation axiom was, however, adopted by Erik Palmgren in CETCS (a constructive predicative version of ETCS):

  • Erik Palmgren. Constructivist and Structuralist Foundations: Bishop’s and Lawvere’s Theories of Sets. pdf.

Its relationship to some other weak axioms of choice is studied in

  • Michael Rathjen. Choice principles in constructive and classical set theories.

Revised on January 31, 2013 04:12:27 by Anonymous Coward (155.41.119.214)