To install click the Add extension button. That's it.

The source code for the WIKI 2 extension is being checked by specialists of the Mozilla Foundation, Google, and Apple. You could also do it yourself at any point in time.

4,5
Kelly Slayton
Congratulations on this excellent venture… what a great idea!
Alexander Grigorievskiy
I use WIKI 2 every day and almost forgot how the original Wikipedia looks like.
Live Statistics
English Articles
Improved in 24 Hours
Added in 24 Hours
What we do. Every page goes through several hundred of perfecting techniques; in live mode. Quite the same Wikipedia. Just better.
.
Leo
Newton
Brights
Milds

Additively indecomposable ordinal

From Wikipedia, the free encyclopedia

In set theory, a branch of mathematics, an additively indecomposable ordinal α is any ordinal number that is not 0 such that for any , we have Additively indecomposable ordinals were named the gamma numbers by Cantor,[1]p.20 and are also called additive principal numbers. The class of additively indecomposable ordinals may be denoted , from the German "Hauptzahl".[2] The additively indecomposable ordinals are precisely those ordinals of the form for some ordinal .

From the continuity of addition in its right argument, we get that if and α is additively indecomposable, then

Obviously 1 is additively indecomposable, since No finite ordinal other than is additively indecomposable. Also, is additively indecomposable, since the sum of two finite ordinals is still finite. More generally, every infinite initial ordinal (an ordinal corresponding to a cardinal number) is additively indecomposable.

The class of additively indecomposable numbers is closed and unbounded. Its enumerating function is normal, given by .

The derivative of (which enumerates its fixed points) is written Ordinals of this form (that is, fixed points of ) are called epsilon numbers. The number is therefore the first fixed point of the sequence

YouTube Encyclopedic

  • 1/3
    Views:
    1 879
    516
    1 059
  • Measuring Inequality I
  • Representations of (acyclic) quivers, Auslander-Reiten... (Lecture 1) by Laurent Demonet
  • ROADEF 2018 - Michel Grabisch, Décision multicritère en présence d’interaction entre critères

Transcription

Multiplicatively indecomposable

A similar notion can be defined for multiplication. If α is greater than the multiplicative identity, 1, and β < α and γ < α imply β·γ < α, then α is multiplicatively indecomposable. The finite ordinal 2 is multiplicatively indecomposable since 1·1 = 1 < 2. Besides 2, the multiplicatively indecomposable ordinals (named the delta numbers by Cantor[1]p.20) are those of the form for any ordinal α. Every epsilon number is multiplicatively indecomposable; and every multiplicatively indecomposable ordinal (other than 2) is additively indecomposable. The delta numbers (other than 2) are the same as the prime ordinals that are limits.

Higher indecomposables

Exponentially indecomposable ordinals are equal to the epsilon numbers, tetrationally indecomposable ordinals are equal to the zeta numbers (fixed points of ), and so on. Therefore, is the first ordinal which is -indecomposable for all , where denotes Knuth's up-arrow notation.[citation needed]

See also

References

  1. ^ a b A. Rhea, "The Ordinals as a Consummate Abstraction of Number Systems" (2017), preprint.
  2. ^ W. Pohlers, "A short course in ordinal analysis", pp. 27–78. Appearing in Aczel, Simmons, Proof Theory: A selection of papers from the Leeds Proof Theory Programme 1990 (1992). Cambridge University Press, ISBN 978-0-521-41413-5

This article incorporates material from Additively indecomposable on PlanetMath, which is licensed under the Creative Commons Attribution/Share-Alike License.

This page was last edited on 17 April 2024, at 18:23
Basis of this page is in Wikipedia. Text is available under the CC BY-SA 3.0 Unported License. Non-text media are available under their specified licenses. Wikipedia® is a registered trademark of the Wikimedia Foundation, Inc. WIKI 2 is an independent company and has no affiliation with Wikimedia Foundation.