Math 2.0

Mathematical logic and foundations Definition

Eta conversion

Builds on Lambda calculusBeta reduction

Definition

Let Λ\Lambda be the set of terms of the lambda calculus, up to renaming of bound variables. An η\eta-redex is a term λx. M x\lambda x.\, M\, x in which the variable xx has no free occurrence in MM.

One-step η\eta-reduction →η\to_\eta is the least relation on Λ\Lambda with these properties.

  1. λx. M x→ηM\lambda x.\, M\, x \to_\eta M whenever xx is not free in MM.
  2. If M→ηM′M \to_\eta M', then M N→ηM′ NM\, N \to_\eta M'\, N, N M→ηN M′N\, M \to_\eta N\, M' and λy. M→ηλy. M′\lambda y.\, M \to_\eta \lambda y.\, M'.

η\eta-conversion =η=_\eta is the least equivalence relation that contains →η\to_\eta. βη\beta\eta-conversion =βη=_{\beta\eta} is the least equivalence relation that contains both →η\to_\eta and the one-step beta reduction →β\to_\beta.

Remarks

Example: λx. (λy. y) x→ηλy. y\lambda x.\, (\lambda y.\, y)\, x \to_\eta \lambda y.\, y, since xx is not free in λy. y\lambda y.\, y. The same term also β\beta-reduces to λx. x\lambda x.\, x, which is the same term up to renaming.

Non-example: λx. x x\lambda x.\, x\, x is not an η\eta-redex. It has the form λx. M x\lambda x.\, M\, x with M=xM = x, but xx is free in MM.

Adding η\eta to β\beta is equivalent to adding the extensionality rule: if M x=N xM\, x = N\, x for a variable xx free in neither MM nor NN, then M=NM = N. So =βη=_{\beta\eta} is the least equivalence relation that contains =β=_\beta, is compatible with application and abstraction, and is closed under this rule.

Reading path

To understand this page from the ground up, read these 3 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Beta reduction concept
  2. Lambda calculus concept
  3. Eta conversion definition

Further reading

  1. Web https://en.wikipedia.org/wiki/Lambda_calculus, η-reduction
About this page
Tag58TYSMQDA4
URIm2://58TYSMQDA4
Kinddefinition
WritingW0 stub
MSC03B40, 68N18
DefinesEta conversion
UsesLambda calculus, Beta reduction
Changed3 November 2026

Markdown · JSON · Edit on GitHub

What this page needs for W1

  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

No page links to this page yet.