Apeirology Wiki

Bashicu matrix system: Difference between revisions

Page Discussion

Bashicu matrix system (edit)

Revision as of 21:01, 30 August 2023

601 bytes added ,  10 months ago
no edit summary
VisualWikitext
(added a bit of intuition)
No edit summary
Line 3:
<h2>Original definition</h2>
 
BMS is 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 \) (an entry is 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 \).
 
-# If \( A \) is empty, then \( A[n]=A \) for all natural numbers \( n \). Otherwise let \( C \) be the last column of \( A \), and let \( m_0 \) be maximal such that the \( m_0 \)-th element of \( C \) has a parent if such an \( m_0 \) exists, otherwise \( m_0 \) is undefined. Let \( G \) and \( B_0 \) be arrays such that \( A=G+B_0+(C) \), where \( + \) is concatenation, and the first column in \( B_0 \) contains the parent of the \( m_0 \)-th element of \( C \) if \( m_0 \) is defined, otherwise \( B_0 \) is empty.
 
-# Say that an entry in \( B_0 \) "ascends" if it is in the first column of \( B_0 \) or has an ancestor in the first column of \( B_0 \). Define \( B_1,B_2,...,B_n \) as copies of \( B_0 \), but in each \( B_i \), each ascending entry \( x \) is increased by \( i \) times the difference between the entry in \( C \) in the same row as \( x \) and the entry in the first column of \( B_0 \) in the same row as \( x \).
 
-# \( A[n]=G+B_0+B_1+...+B_n \), where \( + \) is again concatenation.
 
<h2>Interpretation</h2>
Line 29:
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 name=":0">[https://arxiv.org/abs/2307.04606 Proof 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>
 
<h2>Conversion algorithms</h2>
Note that the correctness of algorithms further than \((0,0,0)(1,1,1)\) is not proven. Let \(\varepsilon\) denote the empty array, and \(o(A)\) denote the converting-to-ordinals function.
<h3>Up to \(\varepsilon_0\)</h3>
# \(o(\varepsilon) = 0\).
# If we have an array \(A\), Then, we must have \(A = (0)A_0(0)A_1(0)A_2...(0)A_n\) for positive \(n\), where each of the \(A_i\) do not contain \((0)\) columns. Then, \(o(A) = \omega^{o(A_0^*)}+\omega^{o(A_1^*)}+...+\omega^{o(A_n^*)}\), where \(A^*\) denotes \(A\) with the first entries of each of its columns reduced by one.
 
<h2>References</h2>
Retrieved from "https://apeirology.com/wiki/Special:MobileDiff/314"