Hyper-operations By Unconventional Means
Abstract
The author makes use of infinite compositions and a limiting function to construct a C∞ tetration function F(t) = e t. As a tetration function, F satisfies eF(t) = F(t+1). Of it, F takes (-2,∞) R bijectively with strictly monotone growth, and is continuously differentiable here. We then iterate this construction to derive arbitrary hyper-operations ek t. These hyper-operations are C∞ strictly monotone bijections of (αk,∞) R for k even (1-k > αk -k), and C∞ strictly monotone bijections of R (αk, ∞) for k odd. These hyper-operations satisfy the functional equation e k-1 (e k t) = e k (t+1) with the initial conditions e 1 t = et and e k 0 = 1.
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.