Proof of Hartog's Theorem: Axiom of Replacement Applied

  • Thread starter Thread starter mathshelp
  • Start date Start date
  • Tags Tags
    Theorem
AI Thread Summary
Hartog's Theorem proof emphasizes the Axiom of Replacement by demonstrating that the class of all order-types of well-orders on a set X can be shown to be a set. The proof involves using the separation axiom to establish the existence of well-orders and then constructing a first-order formula to express the isomorphism between subsets of X and ordinals. This step is crucial as it allows the proof to avoid reliance on the Axiom of Choice. A clear, step-by-step explanation of how the replacement schema is applied is necessary for understanding this aspect of the theorem. The discussion underscores the importance of familiarity with first-order logic in formal set theory to grasp these concepts.
mathshelp
Messages
11
Reaction score
0
Write out the proof of Hartog's Theorem again carefully highlighting how the Axiom of Replacement is used

How can you highlight the axiom of replacment?
 
Last edited:
Physics news on Phys.org
In the proof of Hartog's theorem, you reach a point where you just proved that the class of all well-orders of the set X (using the separation axiom schema). Now you have to prove that each the class of all order-types (isomorphic ordinals) of each of these well-orders is also a set, and it's here that you use replacement, by constructing a first-order formula that expresses the isomorphism of each (Y,<), where Y is a subset of X and "<" is a well-order in Y, to an ordinal.
This is the key step in Hartog's proof, the one that allows him to sidestep AC, so I think the "highlighting" is a careful, step-by-step explanation of how the replacement schema is used.
 
That makes sense, but how do you construct a first order formula?
 
I assume that, if you're studying formal Set Theory, that you are familiar with first-order logic (otherwise, it's impossible to understand anything of Set Theory).
 
I was reading documentation about the soundness and completeness of logic formal systems. Consider the following $$\vdash_S \phi$$ where ##S## is the proof-system making part the formal system and ##\phi## is a wff (well formed formula) of the formal language. Note the blank on left of the turnstile symbol ##\vdash_S##, as far as I can tell it actually represents the empty set. So what does it mean ? I guess it actually means ##\phi## is a theorem of the formal system, i.e. there is a...
Back
Top