computer science

Martin measure

Martin measure is a computer science topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Martin measure rather than just read about it. In short: In descriptive set theory, the Martin measure is a filter on the set of Turing degrees of sets of natural numbers, named after Donald A. Martin.

Key takeaways

Martin measure 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 Martin measure to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Martin measure from memory before moving on to harder problems.

Reference excerpt

In descriptive set theory, the Martin measure is a filter on the set of Turing degrees of sets of natural numbers, named after Donald A. Martin. Under the axiom of determinacy it can be shown to be an ultrafilter.

Definition Let D {\displaystyle D} be the set of Turing degrees of sets of natural numbers. Given some equivalence class [ X ] ∈ D {\displaystyle [X]\in D} , we may define the cone (or upward cone) of [ X ] {\displaystyle [X]} as the set of all Turing degrees [ Y ] {\displaystyle [Y]} such that X ≤ T Y {\displaystyle X\leq _{T}Y} ; that is, the set of Turing degrees that are "at least as complex" as X {\displaystyle X} under Turing reduction. In order-theoretic terms, the cone of [ X ] {\displaystyle [X]} is the upper set of [ X ] {\displaystyle [X]} . Assuming the axiom of determinacy, the cone lemma states that if A is a set of Turing degrees, either A includes a cone or the complement of A contains a cone. It is similar to Wadge's lemma for Wadge degrees, and is important for the following result. We say that a set A {\displaystyle A} of Turing degrees has measure 1 under the Martin measure exactly when A {\displaystyle A} contains some cone. Since it is possible, for any A {\displaystyle A} , to construct a game in which player I has a winning strategy exactly when A {\displaystyle A} contains a cone and in which player II has a winning strategy exactly when the complement of A {\displaystyle A} contains a cone, the axiom of determinacy implies that the measure-1 sets of Turing degrees form an ultrafilter.

Consequences It is easy to show that a countable intersection of cones is itself a cone; the Martin measure is therefore a countably complete filter. This fact, combined with the fact that the Martin measure may be transferred to ω 1 {\displaystyle \omega _{1}} by a simple mapping, tells us that ω 1 {\displaystyle \omega _{1}} is measurable under the axiom of determinacy. This result shows part of the important connection between determinacy and large cardinals.

References

Moschovakis, Yiannis N. (2009). Descriptive Set Theory. Mathematical surveys and monographs. Vol. 155 (2nd ed.). American Mathematical Society. p. 338. ISBN 9780821848135.

Worked examples

Example 1 — a first encounter with Martin measure

Start with the simplest possible case. Write down what Martin measure 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 Martin measure 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 Martin measure 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 Martin measure

In research: Martin measure 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 Martin measure 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: Martin measure is common in secondary-school and first-year university syllabi. It links to neighbouring topics Computability theory, Descriptive set theory, Determinacy, so understanding it makes those chapters shorter.
In everyday life: Look for Martin measure 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.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Martin measure in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Martin measure 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 Martin measure out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Martin measure in simple terms?

In descriptive set theory, the Martin measure is a filter on the set of Turing degrees of sets of natural numbers, named after Donald A. Martin.

Why does Martin measure 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 Martin measure?

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 Martin measure.