Finite canonization
Abstract
The canonization theorem says that for given m,n for some m* (the first one is called ER(n;m)) we have: for every function f with domain [1, ...,m*]n, for some A in [1, ...,m*]m, the question of when the equality f(i1, ...,in)=f(j1, ...,jn) (where i1< ... <in and j1 < ... < jn are from A) holds has the simplest answer: for some v subseteq 1, ...,n the equality holds iff (for all l in v)(il = jl). In this paper we improve the bound on ER(n,m) so that fixing n the number of exponentiation needed to calculate ER(n,m) is best possible.
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.