2023-05-14

276: Transitive Closure of Subset Is Transitive Set That Contains Subset

<The previous article in this series | The table of contents of this series | The next article in this series>

A description/proof of that transitive closure of subset is transitive set that contains subset

Topics


About: set

The table of contents of this article


Starting Context



Target Context


  • The reader will have a description and a proof of the proposition that the transitive closure of any subset is a transitive set that contains the subset.

Orientation


There is a list of definitions discussed so far in this site.

There is a list of propositions discussed so far in this site.


Main Body


1: Description


For any subset, S, the natural numbers set, N, the formula for the transitive closure, ϕ(x,y), the transitive closure of S, S, is a transitive set that contains S.


2: Proof


N is a well-ordered set. The formula, y=Sima x, is a legitimate formula, as y is uniquely determined for any x that is any function from any subset of N. So, the transfinite recursion theorem can be applied to them, and the constructed function, f, satisfies f(n)=Sima f|seg n.

f(n+)=Sima f|seg n+. f(n)ima f|seg n+, because nseg n+ and f(n)=f|seg n+(n). For any pf(n), pima f|seg n+, and for any pp, pima f|seg n+. So, pf(n+), so, pf(n+).

For any pS=ima f, pf(n) for an n. So, by the previous paragraph, pf(n+). So, for any pp, pf(n+)ima f=S.

SS, because S=ima f while f(n)=Sima f|seg n.


References


<The previous article in this series | The table of contents of this series | The next article in this series>