nLab marked extensional well-founded order

Contents

Idea

Marked extensional well-founded orders are important in constructing the sets of the cumulative hierarchy VV in a model of set theory, in the same way that well-orders or sets with transitive extensional well-founded relations are important in constructing the ordinals of VV. These become important in constructive mathematics where one cannot in general show that the set of cardinals in VV and the set of ordinals in VV are in bijection with each other.

Definition

A marked extensional well-founded order or mewo is a set SS with an extensional well-founded relation a≺ba \prec b on a set SS and a predicate m(a)m(a) on SS.

Properties

Marked elements

An element x∈Sx \in S is marked if m(x)m(x) is true. By the axiom schema of bounded separation, one can construct the subset of marked elements in SS:

M S≔{x∈S|m(x)}M_S \coloneqq \{x \in S \vert m(x)\}

Marked extensional well-founded order homomorphisms

A marked extensional well-founded order homomorphism between two marked extensional well-founded order SS and TT is a function f:S→Tf:S \to T such that

  • ff preserves the marking predicate: for all x∈Sx \in S, m(x)m(x) implies that m(f(x))m(f(x))

  • ff preserves the well-founded relation: for all x∈Sx \in S and y∈Sy \in S, x≺yx \prec y implies that f(x)≺f(y)f(x) \prec f(y)

A marked extensional well-founded order isomorphism is a marked extensional well-founded order homomorphism f:S→Tf:S \to T with a marked extensional well-founded order homomorphism g:T→Sg:T \to S such that for all elements s∈Ss \in S, g(f(s))=sg(f(s)) = s and for all elements t∈Tt \in T f(g(t))=tf(g(t)) = t.

The category of marked extensional well-founded order homomorphisms is the concrete category MEWO\mathrm{MEWO} whose objects are marked extensional well-founded orders and whose morphisms are marked extensional well-founded order homomorphisms.

Trivialization

There is a forgetful functor U:MEWO→EWOU:\mathrm{MEWO} \to \mathrm{EWO} which takes a marked extensional well-founded order (S,≺,m)(S, \prec, m) to its underlying extensional well-founded order (S,≺)(S, \prec). There is also a functor F:EWO→MEWOF:\mathrm{EWO} \to \mathrm{MEWO} which takes an extensional well-founded order (S,≺)(S, \prec) to the marked extensional well-founded order (S,≺,⊤ S)(S, \prec, \top_S), where ⊤ S\top_S is the always true predicate on SS. The trivialization of a marked extensional well-founded order is defined as the composite of the two functors above S¯≔F(U(S))\overline{S} \coloneqq F(U(S)).

Simulations

A simulation between marked extensional well-founded orders SS and TT is a marked extensional well-founded order homomorphism f:S→Tf:S \to T such that its image is downwards closed: for all x∈Sx \in S and y∈Ty \in T, if y≺f(x)y \prec f(x), then there exists z∈Sz \in S such that z≺xz \prec x and f(z)≺yf(z) \prec y.

We denote the set of simulations between marked extensional well-founded orders SS and TT by S⊑TS \sqsubseteq T.

The category MEWO Sim\mathrm{MEWO}_\mathrm{Sim} is the subcategory of MEWO\mathrm{MEWO} whose objects are marked extensional well-founded orders and whose morphisms are simulations. We show that the above category is a poset:

Since the relation ≺\prec is extensional and well-founded, the following is true of simulations:

  • Every simulation f:S→Tf:S \to T is an injection.

  • Given marked extensional well-founded orders SS and TT, the set of simulations S⊑TS \sqsubseteq T has at most one element.

As a result, one could define the relation S≤TS \leq T on marked extensional well-founded orders by ∃x.x∈S⊑T\exists x.x \in S \sqsubseteq T. The relation S≤TS \leq T between marked extensional well-founded orders is a partial order

  • for all marked extensional well-founded orders SS, S≤SS \leq S
  • for all marked extensional well-founded orders SS, TT, and UU, S≤T∧T≤U⇒S≤US \leq T \wedge T \leq U \implies S \leq U
  • for all marked extensional well-founded orders SS and TT, S≤T∧T≤S⇒S=TS \leq T \wedge T \leq S \implies S = T

Covered elements and initial segments

An element x∈Sx \in S is covered if there exists a marked element y∈Sy \in S such that x≺yx \prec y is true. Given a marked extensional well-founded order SS and an element x∈Sx \in S, the initial segment of SS is the set of all elements covered by x∈Sx \in S

S↓ +x≔{t∈S|t≺x}S \downarrow^+ x \coloneqq \{t \in S \vert t \prec x\}

The initial segment S↓ +xS \downarrow^+ x is a marked extensional well-founded order, with the well-founded relation defined as y≺zy \prec z for elements y∈S↓ +xy \in S \downarrow^+ x and z∈S↓ +xz \in S \downarrow^+ x, and the marking relation defined as m x(y)≔y≺xm_x(y) \coloneqq y \prec x for elements y∈S↓ +xy \in S \downarrow^+ x.

A marked extensional well-founded order is covered if every element x∈Sx \in S is covered; i.e.

∀x∈S.∃y∈S.m(y)∧(x≺y)\forall x \in S.\exists y \in S.m(y) \wedge (x \prec y)

It follows by well-founded induction that S↓ +xS \downarrow^+ x is a covered marked extensional well-founded order.

Theorem

Given a marked extensional well-founded order SS, the function f:S↓ +x→S¯f:S \downarrow^+ x \to \overline{S}, defined by the composite of the canonical subset injection i:S↓ +x→Si:S \downarrow^+ x \to S and the canonical function j:S→S¯j:S \to \overline{S} given by the identity function on the carrier set, is a simulation.

Theorem

Given a marked extensional well-founded order SS and elements x∈Sx \in S and y∈Sy \in S, S↓ +x=S↓ +yS \downarrow^+ x = S \downarrow^+ y implies that x=yx = y.

Theorem

Given marked extensional well-founded orders SS and TT and a function f:S→Tf:S \to T which preserves the marking predicate; i.e. m(x)m(x) implies that m(f(x))m(f(x)) for all x∈Sx \in S, then ff is a simulation if and only if S↓ +x=T↓ +f(x)S \downarrow^+ x = T \downarrow^+ f(x).

Bounded simulations

A bounded simulation between marked extensional well-founded orders SS and TT consists of a marked element y∈M Ty \in M_T and a simulation f:S→Tf:S \to T such that the image of ff is equal to the initial segment at yy, im(f)=T↓ +y\mathrm{im}(f) = T \downarrow^+ y. We denote the set of bounded simulations between marked extensional well-founded orders SS and TT by S⊏TS \sqsubset T.

Theorem

Given marked extensional well-founded orders SS and TT, the set of bounded simulations S⊏TS \sqsubset T has at most one element.

As a result, one could define the relation S<TS \lt T on marked extensional well-founded orders by ∃x.x∈S⊏T\exists x.x \in S \sqsubset T. The relation satisfies the following properties

  • for all marked extensional well-founded orders SS and TT, S<TS \lt T implies that S≤T¯S \leq \overline{T}

  • for all marked extensional well-founded orders SS and TT and UU, S<TS \lt T and T<UT \lt U implies that S≤U¯S \leq \overline{U}

  • for all marked extensional well-founded orders SS and TT and UU, S<TS \lt T and T≤UT \leq U implies that S<US \lt U

References

Last revised on January 26, 2023 at 16:24:55. See the history of this page for a list of all contributions to it.