Mu operator

Key takeaways

Mu operator belongs to computer science; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Mu operator to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Mu operator from memory before moving on to harder problems.

Reference excerpt

In computability theory, the μ-operator, minimization operator, or unbounded search operator searches for the least natural number with a given property. Adding the μ-operator to the primitive recursive functions makes it possible to define all computable functions.

Definition Suppose that R(y, x1, ..., xk) is a fixed (k+1)-ary relation on the natural numbers. The μ-operator "μy", in either the unbounded or bounded form, is a "number theoretic function" defined from the natural numbers to the natural numbers. However, the definition of "μy" contains a predicate over the natural numbers, which can be thought of as a condition that evaluates to true when the predicate is satisfied and false when it is not. The bounded μ-operator appears earlier in Kleene (1952) Chapter IX Primitive Recursive Functions, §45 Predicates, prime factor representation as:

" μ y y < z R ( y ) . The least y < z such that R ( y ) , if ( ∃ y ) y < z R ( y ) ; otherwise , z . {\displaystyle \mu y_{y<z}R(y).\ \ {\mbox{The least}}\ y<z\ {\mbox{such that}}\ R(y),\ {\mbox{if}}\ (\exists y)_{y<z}R(y);\ {\mbox{otherwise}},\ z.} " (p. 225) Stephen Kleene notes that any of the six inequality restrictions on the range of the variable y is permitted, i.e. y < z, y ≤ z, w < y < z, w < y ≤ z, w ≤ y < z and w ≤ y ≤ z. "When the indicated range contains no y such that R(y) [is "true"], the value of the "μy" expression is the cardinal number of the range" (p. 226); this is why the default "z" appears in the definition above. As shown below, the bounded μ-operator "μyy<z" is defined in terms of two primitive recursive functions called the finite sum Σ and finite product Π, a predicate function that "does the test" and a representing function that converts {t, f} to {0, 1}. In Chapter XI §57 General Recursive Functions, Kleene defines the unbounded μ-operator over the variable y in the following manner,

" ( ∃ y ) μ y R ( y ) = { the least (natural number) y such that R ( y ) } {\displaystyle (\exists y)\mu yR(y)=\{{\mbox{the least (natural number)}}\ y\ {\mbox{such that}}\ R(y)\}} " (p. 279, where " ( ∃ y ) {\displaystyle (\exists y)} " means "there exists a y such that...") In this instance R itself, or its representing function, delivers 0 when it is satisfied (i.e. delivers true); the function then delivers the number y. No upper bound exists on y, hence no inequality expressions appear in its definition. For a given R(y) the unbounded μ-operator μyR(y) (note no requirement for " ( ∃ y ) {\displaystyle (\exists y)} " ) is a partial function. Kleene makes it as a total function instead (cf. p. 317):

ε y R ( x , y ) = { the least y such that R ( x , y ) , if ( ∃ y ) R ( x , y ) 0 , otherwise . {\displaystyle \varepsilon yR(x,y)={\begin{cases}{\text{the least }}y{\text{ such that }}R(x,y),&{\text{if }}(\exists y)R(x,y)\\0,&{\text{otherwise}}.\end{cases}}}

The total version of the unbounded μ-operator is studied in higher-order reverse mathematics in the following form:

( ∃ μ 2 ) ( ∀ f 1 ) ( ( ∃ n 0 ) ( f ( n ) = 0 ) → f ( μ ( f ) ) = 0 ) , {\displaystyle (\exists \mu ^{2})(\forall f^{1}){\big (}(\exists n^{0})(f(n)=0)\rightarrow f(\mu (f))=0{\big )},}

where the superscripts mean that n is zeroth-order, f is first-order, and μ is second-order. This axiom gives rise to the Big Five system ACA0 when combined with the usual base theory of higher-order reverse mathematics.

Properties (i) In the context of the primitive recursive functions, where the search variable y of the μ-operator is bounded, e.g. y < z in the formula below, if the predicate R is primitive recursive (Kleene Proof #E p. 228), then

… excerpt ends here. Continue reading the full article.

Worked examples

Example 1 — a first encounter with Mu operator

Start with the simplest possible case. Write down what Mu operator claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In computer science, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Mu operator before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Mu operator ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Mu operator

In research: Mu operator appears in computer science research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Mu operator in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Mu operator is common in secondary-school and first-year university syllabi. It links to neighbouring topics Computability theory, so understanding it makes those chapters shorter.
In everyday life: Look for Mu operator outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

How to study Mu operator in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Mu operator means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Mu operator out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Mu operator in simple terms?

In computability theory, the μ-operator, minimization operator, or unbounded search operator searches for the least natural number with a given property. Adding the μ-operator to the primitive recursive functions makes it possible to define all computable functions.

Why does Mu operator matter?

Because it connects several computer science ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Mu operator?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Mu operator.