OpenFrontiers
← Back to the index
OP-6722Status unassessedLogic and foundations

The 3-uniform partition relation at the first uncountable ordinal

TheoremDB P9992 · Candidate awaiting source review

Inferred from the community field; finer classification has not been reviewed.

Source candidate · not reviewedAs of 2026-09-08Source & evidence ↓

Problem statement

Let c\mathfrak{c} denote the cardinality of the continuum, and let ω1=ℵ1\omega_1 = \aleph_1 denote the first uncountable ordinal. For each integer n≥2n \geq 2, consider the 3-uniform ordinal Ramsey property c→(ω1,n)23\mathfrak{c} \to (\omega_1, n)^3_2, defined as follows. For any 2-coloring of all 3-element subsets of the ordinal type of c\mathfrak{c} (where the coloring is given as a predicate on ordered triples of distinct elements that is invariant under permutation of its arguments), either there exists a red-monochromatic subset of order type ω1\omega_1 (every 3-element subset of which is colored red), or there exists a blue-monochromatic subset of cardinality nn (every 3-element subset of which is colored blue). Determine whether c→(ω1,n)23\mathfrak{c} \to (\omega_1, n)^3_2 holds for all integers n≥2n \geq 2.

Lean 4

No Lean submitted

Formal statement

Lean 4
theorem omega_one :
    answer(sorry) ↔
    ∀ᵉ (n : ℕ) (_ : 2 ≤ n),
      OrdinalCardinalRamsey3 (𝔠).ord (Cardinal.aleph 1).ord n

On-site verification needs an executable Lean target. None is attached yet.

A source attachment or link is not a verified proof. The statement’s correspondence with the original question needs human review.

Proofs & verification

No Lean has been submitted for this problem yet. A Lean file can be attached to a submission for review, though with no target here it cannot be machine-checked.

Progress & source assessment

Source-reported assessment, retrieved 8 September 2026. Frontier Science has not independently reviewed this status.

Open. No signed Lean verification is attached to this problem or its selected resolution.

This record is in the source backlog; its novelty and unresolved status have not passed source review.

References
  1. [1]TheoremDB P9992 link
  2. [2]Source formal statement (not locally verified) link

Recorded progress

Add yours →

Nothing recorded yet. A pointer to a paper the entry is missing counts.

Machine attempts

0 recorded

Attempts run against the statement below and are recorded in full, including the failures. The point is to stop the next model — and the next person — from re-walking a road that is already known to end. Each attempt costs 25 credits.

No machine attempts recorded.

Sign in to run an attempt. New accounts start with enough credits for ten.

Discussion

0 notes

Notes are for clarifying the statement, flagging a missing reference, or recording why an approach fails. Claimed solutions belong in a submission, where they can be reviewed.

No notes yet.

Sign in to add a note.