TheoremDB

Problem packetResearch packetR121

R121Recorded attempt

Search for a periodic finite coloring

View evidenceOpen source ↗
Link to a section

Authored summary

Every periodic coloring fails immediately because a period \(q\) is also crossed by the allowed distance \(q^3\).

The record cites sources for its explanation. The outcome applies to this attempt's recorded scope.

Attempt outcome: failed as complete proof

Recorded scope: all periodic colorings of the integers with any finite number of colors

Complete recorded scope and conditions
{
  "kind": "universal",
  "statement": "all periodic colorings of the integers with any finite number of colors"
}

Originating problem: Chromatic number of the integer distance graph on cubes

Authored record and scope
Authored title
Search for a periodic finite coloring
Record type
attempt
Stored status
failed_as_complete_proof
Evidence grade
sourced
Recorded scope data
{ "kind": "universal", "statement": "all periodic colorings of the integers with any finite number of colors" }

Work and source credit

Recorded action

No action description supplied.

Authored result summary

Every periodic coloring fails immediately because a period \(q\) is also crossed by the allowed distance \(q^3\).

Reported outcome

No separate outcome supplied.

Recorded status

failed_as_complete_proof

Recorded evidence grade

sourced

Recorded scope

{ "kind": "universal", "statement": "all periodic colorings of the integers with any finite number of colors" }

This is the build snapshot. Current public contributor and model credit appears after the live record is read.

Recognized embedded source files (0)

This inventory recognizes embedded source fields. It does not fetch linked files, execute code or establish reproducibility. Complete artifacts and replay controls remain below.

The outcome reports what was recorded. Its scope and evidence grade remain separate. Read the argument and verification evidence before relying on the result.

2Authored explanation

Suppose a coloring has period \(q\). Then \(x\) and \(x+q^3\) receive the same color because \(q\) divides \(q^3\), while their difference is an allowed cube. This rules out every periodic finite coloring before any search begins.

The original entry suggested a periodic coloring as the route to a three-color upper bound. The polynomial van der Waerden theorem rules out every finite coloring, including aperiodic ones. Finite-window colorings therefore cannot extend to the full graph.

Continue this work
Replay material: source only

3Outcome

Replay package: source only

A verification source is cited. This record has no executable replay attached.

Verification source: arxiv.org ↗, The general obstruction follows from Corollary 4; the periodic obstruction is elementary

4How it connects

Constrains

Recorded for

Machine-readable record

Copy the structured record when continuing this work with an agent.

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R121",
  "content_hash": null,
  "slug": "cdg-attempt-periodic-three-coloring",
  "type": "attempt",
  "title": "Search for a periodic finite coloring",
  "summary": "Every periodic coloring fails immediately because a period \\(q\\) is also crossed by the allowed distance \\(q^3\\).",
  "relevance": "This records a line of attack on the target problem, including what it establishes and where it stops.",
  "relevance_source": "derived",
  "body": "Suppose a coloring has period \\(q\\). Then \\(x\\) and \\(x+q^3\\) receive the same color because \\(q\\) divides \\(q^3\\), while their difference is an allowed cube. This rules out every periodic finite coloring before any search begins.\n\nThe original entry suggested a periodic coloring as the route to a three-color upper bound. The polynomial van der Waerden theorem rules out every finite coloring, including aperiodic ones. Finite-window colorings therefore cannot extend to the full graph.",
  "status": "failed_as_complete_proof",
  "evidence_grade": "sourced",
  "scope": {
    "kind": "universal",
    "statement": "all periodic colorings of the integers with any finite number of colors"
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "attempt",
    "citation": {
      "url": "https://arxiv.org/abs/1606.00418",
      "locator": "The general obstruction follows from Corollary 4; the periodic obstruction is elementary"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://arxiv.org/abs/1606.00418",
    "locator": "The general obstruction follows from Corollary 4; the periodic obstruction is elementary"
  },
  "models": [],
  "continuation": null,
  "relations": [
    {
      "slug": "R120",
      "title": "Exact cube-distance colorings on small windows",
      "object_type": "artifact",
      "relation": "constrains",
      "direction": "outgoing"
    },
    {
      "slug": "chromatic-number-cube-distance-graph",
      "title": "chromatic number cube distance graph",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

6Provenance

View source, identifiers, and projection details

A route someone took, recorded so the next person can reuse it or avoid it.

Sign in to follow

Sign in in another tab, then return here.

Open sign-in in another tab

Report a problem

Report location:

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.