Bashicu matrix system: Difference between revisions

m
fixing stuff and mentioning values
m (added source)
m (fixing stuff and mentioning values)
Line 1:
'''Bashicu matrix system''' ('''BMS''') is an [[ordinal notation system]] invented by [[BashicuHyudora]]. It is a typical [[sequence system]], with the sequences in question being two-dimensional arrays of natural numbers (i.e. sequences of columns, where columns are sequences of natural numbers and have the same length). It is also an [[expansion system]] with the base of the standard form being \( \{((\underbrace{0,0,...,0,0}_n),(\underbrace{1,1,...,1,1}_n)) : n\in\mathbb{N}\} \) and the expansion A[n] of an array A at a natural number n being defined in the following way:
 
- The parent of an entry x (a natural number in the array) is the last entry y before it in the same row, such that the entry directly above y (if it exists) is an ancestor of the entry above x, and y<x. The ancestors of an entry x are defined recursively as the parent of x and the ancestors of the parent of x.
Line 9:
- A[n]=G+B<sub>0</sub>+B<sub>1</sub>+...+B<sub>n</sub>, where + is again concatenation.
 
For a long time, the problem of finding a proof of its well-orderedness was a famous problem in apeirology, but now there is at least a claimed proof.<ref>[https://arxiv.org/abs/2307.04606 WellProof of well-foundedness of BMS]</ref> The proof utilizes [[stability]], so the problem of finding a self-contained proof that BMS is well-ordered remains open for now. A related open problem is the well-orderedness of Y sequence, which is similar enough to BMS (below the limit of BMS) that it can be considered an extension.
 
BMS is expected to reach ordinals as high as a good [[ordinal collapsing function]] for ordinals that are \( \alpha-\Sigma_n- \)stable for some \( \alpha\in Ord \) and \( n\in\mathbb{N} \). However, because no such function has been defined yet, this is currently unprovable, considering the informal use of "good". The largest array for which an explicit value was proven is \( ((0,0,0),(1,1,1)) \), and that value is \( \psi(\Omega_\omega) \) using [[Buchholz's ordinal collapsing function | Buchholz's OCF]].<ref>[https://googology.fandom.com/ja/wiki/ユーザーブログ:P進大好きbot/ペア数列の停止性 Analysis of Pair sequence system]</ref>
27

edits