ArticleslgStudy

mathematics

Projective hierarchy

Projective hierarchy is a mathematics 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 Projective hierarchy rather than just read about it. In short: In the mathematical field of descriptive set theory, a subset A {\displaystyle A} of a Polish space X {\displaystyle X} is projective if it is Σ n 1 {\displaystyle {\boldsymbol {\Sigma }}_{n}^{1}} for some positive integer n {\displaystyle n} . Here A {\displaystyle A} is Σ 1 1 {\displaystyle {\boldsymbol {\Sigma }}_{1}^{1}} if A {\displaystyle A} is analytic Π n 1 {\displaystyle {\boldsymbol {\Pi }}_{n}^{1}} if the…

Key takeaways

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

Reference excerpt

In the mathematical field of descriptive set theory, a subset A {\displaystyle A} of a Polish space X {\displaystyle X} is projective if it is Σ n 1 {\displaystyle {\boldsymbol {\Sigma }}_{n}^{1}} for some positive integer n {\displaystyle n} . Here A {\displaystyle A} is

Σ 1 1 {\displaystyle {\boldsymbol {\Sigma }}_{1}^{1}} if A {\displaystyle A} is analytic

Π n 1 {\displaystyle {\boldsymbol {\Pi }}_{n}^{1}} if the complement of A {\displaystyle A} is Σ n 1 {\displaystyle {\boldsymbol {\Sigma }}_{n}^{1}}

Σ n + 1 1 {\displaystyle {\boldsymbol {\Sigma }}_{n+1}^{1}} if there is a Polish space Y {\displaystyle Y} and a Π n 1 {\displaystyle {\boldsymbol {\Pi }}_{n}^{1}} subset C ⊆ X × Y {\displaystyle C\subseteq X\times Y} such that A {\displaystyle A} is the projection of C {\displaystyle C} onto X {\displaystyle X} ; that is, A = { x ∈ X ∣ ∃ y ∈ Y : ( x , y ) ∈ C } . {\displaystyle A=\{x\in X\mid \exists y\in Y:(x,y)\in C\}.}

The choice of the Polish space Y {\displaystyle Y} in the third clause above is not very important; it could be replaced in the definition by a fixed uncountable Polish space, say Baire space or Cantor space or the real line.

Relationship to the analytical hierarchy There is a close relationship between the relativized analytical hierarchy on subsets of Baire space (denoted by lightface letters Σ {\displaystyle \Sigma } and Π {\displaystyle \Pi } ) and the projective hierarchy on subsets of Baire space (denoted by boldface letters Σ {\displaystyle {\boldsymbol {\Sigma }}} and Π {\displaystyle {\boldsymbol {\Pi }}} ). Not every Σ n 1 {\displaystyle {\boldsymbol {\Sigma }}_{n}^{1}} subset of Baire space is Σ n 1 {\displaystyle \Sigma _{n}^{1}} . It is true, however, that if a subset X of Baire space is Σ n 1 {\displaystyle {\boldsymbol {\Sigma }}_{n}^{1}} then there is a set of natural numbers A such that X is Σ n 1 , A {\displaystyle \Sigma _{n}^{1,A}} . A similar statement holds for Π n 1 {\displaystyle {\boldsymbol {\Pi }}_{n}^{1}} sets. Thus the sets classified by the projective hierarchy are exactly the sets classified by the relativized version of the analytical hierarchy. This relationship is important in effective descriptive set theory. Stated in terms of definability, a set of reals is projective iff it is definable in the language of second-order arithmetic from some real parameter. A similar relationship between the projective hierarchy and the relativized analytical hierarchy holds for subsets of Cantor space and, more generally, subsets of any effective Polish space.

Table

See also Borel hierarchy

References

Kechris, A. S. (1995), Classical Descriptive Set Theory, Berlin, New York: Springer-Verlag, ISBN 978-0-387-94374-9 Rogers, Hartley (1987) [1967], The Theory of Recursive Functions and Effective Computability, First MIT press paperback edition, ISBN 978-0-262-68052-3

Worked examples

Example 1 — a first encounter with Projective hierarchy

Start with the simplest possible case. Write down what Projective hierarchy claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In mathematics, 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 Projective hierarchy 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 Projective hierarchy 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 Projective hierarchy

In research
Projective hierarchy appears in mathematics 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 Projective hierarchy 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
Projective hierarchy is common in secondary-school and first-year university syllabi. It links to neighbouring topics Descriptive set theory, Mathematical logic hierarchies, so understanding it makes those chapters shorter.
In everyday life
Look for Projective hierarchy 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 Projective hierarchy in 20 minutes

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

Frequently asked questions

What is Projective hierarchy in simple terms?

In the mathematical field of descriptive set theory, a subset A {\displaystyle A} of a Polish space X {\displaystyle X} is projective if it is Σ n 1 {\displaystyle {\boldsymbol {\Sigma }}_{n}^{1}} for some positive integer n {\displaystyle n} . Here A {\displaystyle A} is Σ 1 1 {\displaystyle {\bol…

Why does Projective hierarchy matter?

Because it connects several mathematics 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 Projective hierarchy?

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 Projective hierarchy.

Tags

  • Descriptive set theory
  • Mathematical logic hierarchies

Keep exploring