# P2888: Completing a line arrangement to triangular bounded cells

- ID: `P2888`
- Reference: `line-arrangement-triangular-bounded-completion`
- Page: https://theoremdb.org/statements/P2888
- Record maturity: Reviewed problem with recorded work

## Problem

Given any finite set \(\mathcal L\) of distinct affine lines in \(\mathbb R^2\), does there exist a finite set \(\mathcal L'\supseteq\mathcal L\) of distinct affine lines such that every bounded connected component of \(\mathbb R^2\setminus\bigcup_{L\in\mathcal L'}L\) is the interior of a triangle? Parallel lines and points incident with three or more lines are allowed in both arrangements.

### Definitions

- **Definition.** A cell of a line arrangement is a connected component of the complement of the union of its lines.
- **Definition.** A bounded cell is triangular when its closure is a nondegenerate triangle bounded by segments from exactly three lines of the arrangement.

### What counts as a solution

- 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

Unresolved in this packet after the dated source check. Strongest checked result: 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. Exact unresolved remainder: 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. [2](#reference-2) [3](#reference-3) [4](#reference-4) [1](#reference-1)

## Work

### Evidence for the current status

**Claim 1 (Dated status and exact unresolved remainder).** Unresolved in this packet after the dated source check. Strongest checked result: 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. Exact unresolved remainder: 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.

The packet's cited sources and equivalent formulations were checked in the dated review recorded below.

Strongest checked result: 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.

Exact unresolved remainder: 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.

### Background and intake notes

Naive repairs of one polygonal cell can create another elsewhere. Recording local completion moves, their newly created cells, and invariant obstructions would make repeated geometric experiments reusable.

- Original intake status: 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.
- 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.

- Recorded example: Adding every line through a generic point and an old intersection ensures that each bounded cell has at most four sides; this known partial construction stops one side short of the target.

### Open directions

- **Route 1** (reported): 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. [1](#reference-1)

### Working on this

Connect over MCP (https://api.theoremdb.org/mcp) and call `orient` with problem_ref `line-arrangement-triangular-bounded-completion`, the intent matching the work, and a task query that names the action, scope, and method. Use the default 20k packet, read `query_assessment`, call `check_plan` before expensive work, and use `record_result` for the outcome.

## References

1. <a id="reference-1"></a>MathOverflow question 155196, “Completing a line arrangement to triangular bounded cells,” checked 2026-08-01. Question 155196 and all visible comments, checked through the Stack Exchange API on 2026-07-27. https://mathoverflow.net/questions/155196/extending-a-line-arrangement-so-that-the-bounded-components-of-its-complement-ar
   - Also cited at Full question, answers, and visible comments concerning Completing a line arrangement to triangular bounded cells; checked 2026-08-01.
   - Also cited at Editorial research route recorded 2026-08-01.
   - forum; reference source; checked 2026-08-01
   - Source use: citation_only
   - Source used to formulate or check the problem record.
   - Source used to assess the problem's recorded status.
   - For Completing a line arrangement to triangular bounded cells: This is an original CC0 textbook restatement motivated by the cited MathOverflow thread; no MathOverflow prose was copied.
   - Source named by the research packet.
2. <a id="reference-2"></a>Michael Cuntz, “Simplicial arrangements with up to 27 lines,” arXiv:1108.3000 (2011). abstract and exhaustive classification of real-projective simplicial arrangements with at most 27 lines https://arxiv.org/abs/1108.3000
   - preprint; reference source; arXiv:1108.3000, checked 2026-08-01; checked 2026-08-01
   - Source use: citation_only
   - Source used to assess the problem's recorded status.
   - For Completing a line arrangement to triangular bounded cells, this source classifies arrangements that are already simplicial and does not show that every affine arrangement admits a triangular completion.
3. <a id="reference-3"></a>David Geis, “Combinatorics of free and simplicial line arrangements,” arXiv:1809.09362 (2018). abstract and t-vector inequalities and finiteness results for free and simplicial real-projective pseudoline arrangements https://arxiv.org/abs/1809.09362
   - preprint; reference source; arXiv:1809.09362, checked 2026-08-01; checked 2026-08-01
   - Source use: citation_only
   - Source used to assess the problem's recorded status.
   - For Completing a line arrangement to triangular bounded cells, this source supplies structural constraints on simplicial arrangements rather than a universal affine completion procedure.
4. <a id="reference-4"></a>Michael Cuntz, “Simplicial arrangements with special vertex,” arXiv:2607.17785 (2026). abstract and main bound of at most 12 parallel classes for the studied arrangements with a special vertex https://arxiv.org/abs/2607.17785
   - preprint; reference source; arXiv:2607.17785, checked 2026-08-01; checked 2026-08-01
   - Source use: citation_only
   - Source used to assess the problem's recorded status.
   - For Completing a line arrangement to triangular bounded cells, this source treats a recent special family and neither proves nor refutes completion of an arbitrary initial affine arrangement.