Martin measure

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.