From 0bbf6c78dbe9fedab4e65d99cd717fd3223cb310 Mon Sep 17 00:00:00 2001 From: KokunoYumeto <208192274+KokunoYumeto@users.noreply.github.com> Date: Sun, 15 Nov 2026 13:32:43 +0100 Subject: [PATCH] arithmetical-functions.tex: Exp b 0 is not the numeral 1 (only up to eta) 0 b = (lam f x. x) b reduces to lam x. x, whose normal form differs from num(1) = lam f x. f x. Ledger: SOL6-F103 Co-Authored-By: Claude Opus 5.5 --- .../lambda-definability/arithmetical-functions.tex | 8 +++++--- 1 file changed, 5 insertions(+), 3 deletions(-) diff --git a/content/lambda-calculus/lambda-definability/arithmetical-functions.tex b/content/lambda-calculus/lambda-definability/arithmetical-functions.tex index 38a4b80f..843ffec5 100644 --- a/content/lambda-calculus/lambda-definability/arithmetical-functions.tex +++ b/content/lambda-calculus/lambda-definability/arithmetical-functions.tex @@ -128,9 +128,11 @@ \fn{Exp} \ident \lambd[be][e b]. \] The first argument $b$ is the base and the second~$e$ is the exponent. -Intuitively, $e f$ is $f^e$ by our encoding of numbers. If you find it -hard to understand, we can still define exponentiation also by -iterated multiplication: +Intuitively, $e f$ is $f^e$ by our encoding of numbers. (For $e = 0$, +however, $\fn{Exp}\, b\, \num{0}$ reduces to $\lambd[x][x]$, which is +$\num{1}$ only up to $\eta$-reduction.) If you find it hard to understand, +or want a term that works for $e = 0$ as well, we can still define +exponentiation also by iterated multiplication: \[ \fn{Exp}' \ident \lambd[be][e (\fn{Mult}\, b) \num{1}]. \]