The Initial Algebra Theorem by Trnkov\'a et al. states, under mild but inevitable assumptions, that an endofunctor has an initial algebra provided it has a pre-fixed point. The proof crucially depends on transfinitely iterating the functor and in fact shows that, equivalently, the (transfinite) initial-algebra chain stops. We give a constructive proof of the Initial Algebra Theorem that avoids transfinite iteration of the functor. This is made possible by using Pataraia's theorem to obtain the east fixed point of a monotone function on the partial order formed by all subobjects of a given pre-fixed point. Thanks to properties of recursive coalgebras, this least fixed point yields an initial algebra. Finally, using transfinite iteration we equivalently obtain convergence of the initial-algebra chain as an equivalent condition, overall yielding a streamlined version of the original proof.
翻译:Trnkov\'a et al. 的初始代数理论称,根据温和但不可避免的假设,端点有一个初始代数,只要它有一个前固定点。证据关键取决于对配料器的瞬间迭代,而且事实上表明,等量的(纯度)初始代数链站。我们提供了避免给料体的跨式迭代的初始代数理论的建设性证据。通过使用Pataraia 的定理在给料前固定点的所有子对象组成的部分顺序上获得单体函数的东定点,这是可能的。由于循环型煤层的特性,这个最小的固定点产生初始代数。最后,我们使用等量的跨式迭代数获得了初始代数链的趋同性,从而得出了原始证据的简化版本。