Rank-into-rank

In set theory, a branch of mathematics, a rank-into-rank embedding is a large cardinal property defined by one of the following four axioms given in order of increasing consistency strength. (A set of rank < λ is one of the elements of the set Vλ of the von Neumann hierarchy.)

  • Axiom I3: There is a nontrivial elementary embedding of Vλ into itself.
  • Axiom I2: There is a nontrivial elementary embedding of V into a transitive class M that includes Vλ where λ is the first fixed point above the critical point.
  • Axiom I1: There is a nontrivial elementary embedding of Vλ+1 into itself.
  • Axiom I0: There is a nontrivial elementary embedding of L(Vλ+1) into itself with critical point below λ.

These are essentially the strongest known large cardinal axioms not known to be inconsistent in ZFC; the axiom for Reinhardt cardinals is stronger, but is not consistent with the axiom of choice.

If j is the elementary embedding mentioned in one of these axioms and κ is its critical point, then λ is the limit of as n goes to ω. More generally, if the axiom of choice holds, it is provable that if there is a nontrivial elementary embedding of Vα into itself then α is either a limit ordinal of cofinality ω or the successor of such an ordinal.

The axioms I0, I1, I2, and I3 were at first suspected to be inconsistent (in ZFC) as it was thought possible that Kunen's inconsistency theorem that Reinhardt cardinals are inconsistent with the axiom of choice could be extended to them, but this has not yet happened and they are now usually believed to be consistent.

Every I0 cardinal κ (speaking here of the critical point of j) is an I1 cardinal.

Every I1 cardinal κ (sometimes called ω-huge cardinals) is an I2 cardinal and has a stationary set of I2 cardinals below it.

Every I2 cardinal κ is an I3 cardinal and has a stationary set of I3 cardinals below it.

Every I3 cardinal κ has another I3 cardinal above it and is an n-huge cardinal for every n<ω.

Axiom I1 implies that Vλ+1 (equivalently, H(λ+)) does not satisfy V=HOD. There is no set S⊂λ definable in Vλ+1 (even from parameters Vλ and ordinals <λ+) with S cofinal in λ and |S|<λ, that is, no such S witnesses that λ is singular. And similarly for Axiom I0 and ordinal definability in L(Vλ+1) (even from parameters in Vλ). However globally, and even in Vλ,[1] V=HOD is relatively consistent with Axiom I1.

Notice that I0 is sometimes strengthened further by adding an "Icarus set", so that it would be

  • Axiom Icarus set: There is a nontrivial elementary embedding of L(Vλ+1, Icarus) into itself with the critical point below λ.

The Icarus set should be in Vλ+2 − L(Vλ+1) but chosen to avoid creating an inconsistency. So for example, it cannot encode a well-ordering of Vλ+1. See section 10 of Dimonte for more details.

Notes
  1. Consistency of V = HOD With the Wholeness Axiom, Paul Corazza, Archive for Mathematical Logic, No. 39, 2000.
gollark: Anyway, you can run it in CCEmuX to try the uninstaller.
gollark: It's better!
gollark: Yes, that is what I have been saying.
gollark: ```Features:- Fortunes/Dwarf Fortress output/Chuck Norris jokes on boot (wait, IS this a feature?)- (other) viruses (how do you get them in the first place? running random files like this?) cannot do anything particularly awful to your computer - uninterceptable (except by crashing the keyboard shortcut daemon, I guess) keyboard shortcuts allow easy wiping of the non-potatOS data so you can get back to whatever nonsense you do fast- Skynet (rednet-ish stuff over websocket to my server) and Lolcrypt (encoding data as lols and punctuation) built in for easy access!- Convenient OS-y APIs - add keyboard shortcuts, spawn background processes & do "multithreading"-ish stuff.- Great features for other idio- OS designers, like passwords and fake loading (set potatOS.stupidity.loading [time], set potatOS.stupidity.password [password]).- Digits of Tau available via a convenient command ("tau")- Potatoplex and Loading built in ("potatoplex"/"loading") (potatoplex has many undocumented options)!- Stack traces (yes, I did steal them from MBS)- Backdoors- er, remote debugging access (it's secured, via ECC signing on disks and websocket-only access requiring a key for the other one)- All this useless random junk can autoupdate (this is probably a backdoor)!- EZCopy allows you to easily install potatOS on another device, just by sticking it in the disk drive of another potatOS device!- fs.load and fs.dump - probably helpful somehow.```
gollark: ```PotatOS OS/Conveniently Self-Propagating System/Sandbox/Compilation of Useless Programs We are not responsible for- headaches- rashes- persistent/non-persistent coughs- virii- backdoors- spinal cord sclerosis- hypertension- cardiac arrest- regular arrest, by police or whatever- angry mobs with or without pitchforks- death- computronic discombobulation- loss of data- gain of data- frogsor any other issue caused directly or indirectly due to use of this product. Best viewed in Internet Explorer 6 running on a Difference Engine emulated under MacOS 7.```

References
  • Dimonte, Vincenzo (2017), "I0 and rank-into-rank axioms", arXiv:1707.02613 [math.LO].
  • Gaifman, Haim (1974), "Elementary embeddings of models of set-theory and certain subtheories", Axiomatic set theory, Proc. Sympos. Pure Math., XIII, Part II, Providence R.I.: Amer. Math. Soc., pp. 33–101, MR 0376347
  • Kanamori, Akihiro (2003), The Higher Infinite : Large Cardinals in Set Theory from Their Beginnings (2nd ed.), Springer, ISBN 3-540-00384-3.
  • Laver, Richard (1997), "Implications between strong large cardinal axioms", Ann. Pure Appl. Logic, 90 (1–3): 79–90, doi:10.1016/S0168-0072(97)00031-6, MR 1489305.
  • Solovay, Robert M.; Reinhardt, William N.; Kanamori, Akihiro (1978), "Strong axioms of infinity and elementary embeddings", Annals of Mathematical Logic, 13 (1): 73–116, doi:10.1016/0003-4843(78)90031-1.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.