Extending Ordinals: Constructions & Inverses

  • Thread starter Thread starter jostpuur
  • Start date Start date
Click For Summary
The discussion centers on the possibility of extending the set of ordinal numbers to include inverses for each non-zero ordinal, specifically whether such an extension could form a group. It highlights that the class of ordinals lacks arithmetic operations, leading to two main interpretations: extending the multiplicative monoid of ordinals to a group or finding a binary product that could achieve this. The consensus is that no extension exists for the former due to the non-right-cancellable nature of the multiplicative monoid. The conversation reflects confusion about the appropriate terminology and structure for such an extension, avoiding the term "field extension" due to the distinct properties of ordinal arithmetic. Overall, the feasibility of creating a group structure from ordinals remains unresolved.
jostpuur
Messages
2,112
Reaction score
19
Is there well studied constructions of some kind of extensions of the set of ordinal numbers, where each non zero number x also has the inverse x^(-1) so that x^(-1) x=1?
 
Physics news on Phys.org
Firstly, there are 'too many' ordinals to fit in a set, so you'd have to talk about the class of ordinals.

Now, the class of ordinals doesn't have any arithmetic operations on it -- which did you mean:
(1) You want to know if the multiplicative monoid of ordinals can be extended to a group.
(2) You want to see if there is any binary product on the class of ordinals (or an extension of them) that turns them into a group. (I assume you want associativity)


If you mean the former, then clearly no extension exists; the multiplicative monoid of ordinals is not right-cancellable.
 
Hurkyl said:
Firstly, there are 'too many' ordinals to fit in a set, so you'd have to talk about the class of ordinals.

I've taken one course on the axiomatic set theory successfully, but I was lost during the entire course, and don't remember this stuff anymore even as badly as I did.

Now, the class of ordinals doesn't have any arithmetic operations on it -- which did you mean:
(1) You want to know if the multiplicative monoid of ordinals can be extended to a group.
(2) You want to see if there is any binary product on the class of ordinals (or an extension of them) that turns them into a group. (I assume you want associativity)


If you mean the former, then clearly no extension exists; the multiplicative monoid of ordinals is not right-cancellable.

I don't know what I want. I succeeded in avoiding calling this extension a "field extension", because I know that the addition and multiplication on ordinals don't work like in fields, but I was still thinking about some other kind of extension that would be similar.
 
The standard _A " operator" maps a Null Hypothesis Ho into a decision set { Do not reject:=1 and reject :=0}. In this sense ( HA)_A , makes no sense. Since H0, HA aren't exhaustive, can we find an alternative operator, _A' , so that ( H_A)_A' makes sense? Isn't Pearson Neyman related to this? Hope I'm making sense. Edit: I was motivated by a superficial similarity of the idea with double transposition of matrices M, with ## (M^{T})^{T}=M##, and just wanted to see if it made sense to talk...

Similar threads

  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 27 ·
Replies
27
Views
4K
  • · Replies 15 ·
Replies
15
Views
2K
  • · Replies 5 ·
Replies
5
Views
4K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 12 ·
Replies
12
Views
2K
  • · Replies 18 ·
Replies
18
Views
4K
  • · Replies 1 ·
Replies
1
Views
1K