TheoremDB

Problem packetResearch packetR1336

R1336Sourced evidence

Current checked status and unresolved remainder

View evidenceOpen source ↗
Link to a section

Authored summary

UNKNOWN as of 2026-07-27. The MathOverflow page has zero answers and records several partial constructions. Current literature searches on simplicial arrangements and arrangement extension did not locate a proof or counterexample for the affine bounded-cell completion problem.

The record cites sources for its explanation.

Recorded status: reported

Recorded scope: No scope is recorded.

Originating problem: Completing a line arrangement to triangular bounded cells

Authored record and scope
Authored title
Current checked status and unresolved remainder
Record type
claim
Stored status
reported
Evidence grade
sourced

2Authored explanation

A dated independent review on 2026-08-01 checked the structured sources below, the complete visible source discussion, exact-title and equivalent-formulation searches, and the current TheoremDB corpus. On 2026-07-27 the Stack Exchange API reported zero answers, no accepted answer, and no closure for question 155196; all comments were checked, including the quadrilateral completion and vertical-line partial results. Cuntz, arXiv:1108.3000, classifies projective simplicial arrangements through 27 lines. That finite classification concerns arrangements already simplicial and does not decide completion of an arbitrary affine subarrangement. Geis, arXiv:1809.09362, gives combinatorial restrictions for simplicial arrangements but no arbitrary completion theorem was found in the dated search. Cuntz, arXiv:2607.17785, studies simplicial arrangements with special vertices. The July 2026 paper does not supply an arbitrary affine completion theorem. A TheoremDB search for triangulating line arrangements, simplicial completion, and triangular bounded cells found no duplicate.

A complete resolution must satisfy: Prove a finite augmentation procedure for every initial arrangement, or give a finite initial arrangement and prove that every finite line extension leaves a bounded cell with at least four sides. A negative result may use a projective or incidence invariant, but it must show that the invariant survives every allowed added affine line.

Continue this work
Replay material: source only

3Evidence

Replay package: source only

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

Verification source: mathoverflow.net ↗, Dataset references and independent 2026-08-01 status search.

4How it connects

Addressed by

Replaced by

Recorded for

Machine-readable record

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

json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R1336",
  "content_hash": null,
  "slug": "line-arrangement-triangular-bounded-completion-status-20260801",
  "type": "claim",
  "title": "Current checked status and unresolved remainder",
  "summary": "UNKNOWN as of 2026-07-27. The MathOverflow page has zero answers and records several partial constructions. Current literature searches on simplicial arrangements and arrangement extension did not locate a proof or counterexample for the affine bounded-cell completion problem.",
  "relevance": "Records the strongest checked neighboring results and the exact remainder future work must settle.",
  "relevance_source": "recorded",
  "body": "A dated independent review on 2026-08-01 checked the structured sources below, the complete visible source discussion, exact-title and equivalent-formulation searches, and the current TheoremDB corpus. On 2026-07-27 the Stack Exchange API reported zero answers, no accepted answer, and no closure for question 155196; all comments were checked, including the quadrilateral completion and vertical-line partial results. Cuntz, arXiv:1108.3000, classifies projective simplicial arrangements through 27 lines. That finite classification concerns arrangements already simplicial and does not decide completion of an arbitrary affine subarrangement. Geis, arXiv:1809.09362, gives combinatorial restrictions for simplicial arrangements but no arbitrary completion theorem was found in the dated search. Cuntz, arXiv:2607.17785, studies simplicial arrangements with special vertices. The July 2026 paper does not supply an arbitrary affine completion theorem. A TheoremDB search for triangulating line arrangements, simplicial completion, and triangular bounded cells found no duplicate.\n\nA complete resolution must satisfy: Prove a finite augmentation procedure for every initial arrangement, or give a finite initial arrangement and prove that every finite line extension leaves a bounded cell with at least four sides. A negative result may use a projective or incidence invariant, but it must show that the invariant survives every allowed added affine line.",
  "status": "reported",
  "evidence_grade": "sourced",
  "scope": null,
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://mathoverflow.net/questions/155196/extending-a-line-arrangement-so-that-the-bounded-components-of-its-complement-ar",
      "locator": "Dataset references and independent 2026-08-01 status search."
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://mathoverflow.net/questions/155196/extending-a-line-arrangement-so-that-the-bounded-components-of-its-complement-ar",
    "locator": "Dataset references and independent 2026-08-01 status search."
  },
  "models": [],
  "continuation": null,
  "relations": [
    {
      "slug": "R1335",
      "title": "Complete the stated acceptance conditions",
      "object_type": "attempt",
      "relation": "addresses",
      "direction": "incoming"
    },
    {
      "slug": "R1630",
      "title": "Dated status and exact unresolved remainder",
      "object_type": "claim",
      "relation": "supersedes",
      "direction": "incoming",
      "metadata": {
        "reason": "Replaces unreadable status prose with the dated review from 2026-08-01."
      }
    },
    {
      "slug": "line-arrangement-triangular-bounded-completion",
      "title": "line arrangement triangular bounded completion",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

6Provenance

View source, identifiers, and projection details

A statement this project treats as settled at the recorded evidence grade, with the work that backs 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.