Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It only takes a minute to sign up.
Sign up to join this community
I'm just trying to understand better how to see $\alpha^{\beta}$ for an arbitrary ordinal. I've already know that one can think about $\alpha . \beta$ as $\langle \alpha \times \beta, AntiLex\rangle$ such that $AntiLex$ is the antilexicographical order. I want to know whether there is an analogous way (to the product) to think about the exponentiation.
Thanks in advance.
$\newcommand{\supp}{\operatorname{supp}}$For a function $f:\beta\to\alpha$ define the support of $f$ to be $\supp(f)=\{\xi\in\beta:f(\xi)\ne 0\}$. Let $$F=\left\{f\in{}^\beta\alpha:\supp(f)\text{ is finite}\right\}\;,$$
and let $\preceq$ be the anti-lexicographic order on $F$; then $\langle F,\preceq\rangle$ is order-isomorphic to $\langle\alpha^\beta,\le\rangle$.
Added: I just discovered that essentially this idea is used in this PDF to discuss certain aspects of powers $\Delta^\Gamma$, where $\Delta$ and $\Gamma$ are linear orders.
Yes, there is such a description. Say that a function $f:\beta\to\alpha$ has finite support iff $\{\gamma<\beta\mid f(\gamma)\ne0\}$ is finite. Then $\alpha^\beta$ is the order type of the set of functions $f:\beta\to\alpha$ that have finite support, ordered by $$ f<g $$ iff, letting $\gamma$ be largest such that $f(\gamma)\ne g(\gamma)$, we have that $f(\gamma)<g(\gamma)$. One can check (by induction on $\beta$, or otherwise), that this definition coincides with the one given by transfinite recursion.
