← All problems

The majorization characterization conjecture for ordinal spaces embeddable in the line

2 years old · traced to

Let (X,δ)(X,\delta) be an ordinal space with ∣X∣=n∈N+|X|=n\in\mathbb N^+, and let x1,x2,…,xnx_1,x_2,\ldots,x_n be an enumeration of its points satisfying the majorization property. Write X↪R1X\hookrightarrow\mathbb R^1 for embeddability of XX in the real line. Majorization characterization conjecture. If such an enumeration exists, then

X↪R1.X\hookrightarrow\mathbb R^1.

The paper proves that line embeddability implies the existence of an enumeration with the majorization property and states sufficiency for n⩽4n\leqslant4, while explicitly saying that it cannot determine whether sufficiency holds for n>5n>5; the general assertion is therefore open.

References
  1. Karsten Keller and Evgeniy Petrov, “Ordinal spaces”, arXiv:2412.17391 (2024).

Progress summary

Refreshed
Open · progress reported

The conjecture remains open in the published source, while an unverified submission claims a six-point counterexample.

The conjecture asks whether the majorization property for an enumeration of a finite ordinal space forces embeddability in the real line. The paper Ordinal spaces proves the converse implication and formulates this as Conjecture 7.4.

Known results

  • Line embeddability implies the existence of a majorizing enumeration (Proposition 7.3).
  • Sufficiency is proved for n≤4n \leq 4; for n=4n=4, Theorem 7.5 gives equivalent characterizations.
  • For n=3n=3, embeddability is equivalent to having a unique diametrical pair.
  • The authors state that they cannot determine sufficiency for n>5n>5.

Community submission (unverified), November 7, 2026

A submitted argument claims a six-point, tie-free ordinal space whose identity enumeration has the majorization property but which does not embed in the real line, thereby refuting Conjecture 7.4. It describes the result as an AI-assisted preprint and expressly notes that it lacks external peer review; the claim is not independently corroborated here.

Current status (as of November 2026): The implication from embeddability to the majorization property and sufficiency for n≤4n \leq 4 are settled; the general conjecture remains open, with an unverified six-point counterexample claim.

Sources

Solutions 1

A six-point ordinal space with the majorization property that does not embed in the real lineSee full solutionHide full solution

Result and scope. Six-point tie-free ordinal space whose identity enumeration has the Definition 7.1 majorization property for every chain length (repeats, permutations) but which admits no embedding in R; refutes Keller-Petrov Conjecture 7.4 in the range n>5 left open by the source (sufficiency proved only for n<=4).

Complete proof: A six-point ordinal space with the majorization property that does not embed in the real line · PDF.

The paper page contains the supplementary proof-source JSON and extract_sources.py. The linked paper supplies the complete argument and states the precise scope of the Lean certificate, ordinary proofs, supporting computations, and source interpretation. Those qualifications are retained here; a supporting computation is not a proof of a broader statement.

This is an AI-assisted research preprint. Internal review is not external journal peer review. Bounded prior-art searches do not establish worldwide priority. See the paper for formalization and trust limits.