ArticleslgStudy

science

Open coloring axiom

Open coloring axiom is a 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 Open coloring axiom rather than just read about it. In short: The open coloring axiom (abbreviated OCA) is an axiom about coloring edges of a graph whose vertices are a subset of the real numbers: two different versions were introduced by Abraham, Rubin & Shelah (1985) and by Todorčević (1989). Statement Suppose that X is a subset of the reals, and each pair of elements of X is colored either black or white, with the set of white pairs being open in the complete graph on X.

Key takeaways

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

Reference excerpt

The open coloring axiom (abbreviated OCA) is an axiom about coloring edges of a graph whose vertices are a subset of the real numbers: two different versions were introduced by Abraham, Rubin & Shelah (1985) and by Todorčević (1989).

Statement Suppose that X is a subset of the reals, and each pair of elements of X is colored either black or white, with the set of white pairs being open in the complete graph on X. The open coloring axiom states that either:

X has an uncountable subset such that any pair from this subset is white; or X can be partitioned into a countable number of subsets such that any pair from the same subset is black. A weaker version, OCAP, replaces the uncountability condition in the first case with being a compact perfect set in X. Both OCA and OCAP can be stated equivalently for arbitrary separable spaces.

Relation to other axioms OCAP can be proved in ZFC for analytic subsets of a Polish space, and from the axiom of determinacy. The full OCA is consistent with (but independent of) ZFC, and follows from the proper forcing axiom. OCA implies that the smallest unbounded set of Baire space has cardinality ℵ 2 {\displaystyle \aleph _{2}} . Moreover, assuming OCA, Baire space contains few "gaps" between sets of sequences — more specifically, that the only possible gaps are (ω1,ω1)-gaps and (κ,ω)-gaps where κ is an initial ordinal not less than ω2.

References

Abraham, Uri; Rubin, Matatyahu; Shelah, Saharon (1985), "On the consistency of some partition theorems for continuous colorings, and the structure of ℵ1-dense real order types", Ann. Pure Appl. Logic, 29 (2): 123–206, doi:10.1016/0168-0072(84)90024-1, Zbl 0585.03019 Carotenuto, Gemma (2013), An introduction to OCA (PDF), notes on lectures by Matteo Viale Kunen, Kenneth (2011), Set theory, Studies in Logic, vol. 34, London: College Publications, ISBN 978-1-84890-050-9, Zbl 1262.03001 Moore, Justin Tatch (2011), "Logic and foundations the proper forcing axiom", in Bhatia, Rajendra (ed.), Proceedings of the international congress of mathematicians (ICM 2010), Hyderabad, India, August 19–27, 2010. Vol. II: Invited lectures (PDF), Hackensack, NJ: World Scientific, pp. 3–29, ISBN 978-981-4324-30-4, Zbl 1258.03075 Todorčević, Stevo (1989), Partition problems in topology, Contemporary Mathematics, vol. 84, Providence, RI: American Mathematical Society, ISBN 0-8218-5091-1, MR 0980949, Zbl 0659.54001

Worked examples

Example 1 — a first encounter with Open coloring axiom

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

In research
Open coloring axiom appears in 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 Open coloring axiom 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
Open coloring axiom is common in secondary-school and first-year university syllabi. It links to neighbouring topics Axioms of set theory, Determinacy, Graph coloring, so understanding it makes those chapters shorter.
In everyday life
Look for Open coloring axiom 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.
Ask Teacher Smith questions about this articleOpens your AI tutor with a question about “Open coloring axiom” →

Affiliate

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

How to study Open coloring axiom in 20 minutes

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

Frequently asked questions

What is Open coloring axiom in simple terms?

The open coloring axiom (abbreviated OCA) is an axiom about coloring edges of a graph whose vertices are a subset of the real numbers: two different versions were introduced by Abraham, Rubin & Shelah (1985) and by Todorčević (1989). Statement Suppose that X is a subset of the reals, and each pair…

Why does Open coloring axiom matter?

Because it connects several 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 Open coloring axiom?

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 Open coloring axiom.

Tags

  • Axioms of set theory
  • Determinacy
  • Graph coloring
  • Independence results
  • Infinite graphs
  • Real analysis

Keep exploring