The ordered 2x2 corner pattern: a removal exponent of at least 9/2, and other partial results

Primarily AI-generated textHuman understanding: no partsmath.CO — Combinatoricscs.DM — Discrete Mathematics

Contributed by David Niedbala Giraudin ↗

Version 1 / Nov 20, 2026 / CC BY 4.0

Abstract

Let P = [[1,0],[1,1]]. An ordered induced copy of P in a binary matrix is given by rows i<j and columns c<d with entries (1,0) in row i and (1,1) in row j. Whether P admits a polynomial removal lemma is, to our knowledge, open; it is the last open 2x2 case. This note does not settle it and records partial results. Main result: for every q >= 2 we construct a square binary matrix of side n = 6q^3, with exactly n/6 copies of P, each on a pair of adjacent rows, these pairs being disjoint, whose distance to P-freeness is exactly (n/6)^{4/3} + n/6 entry changes; consequently any removal exponent for P is at least 9/2. Further results: (1) if the columns are split into m consecutive intervals on each of which the matrix is P-free, and any two rows can be made P-free by deleting at most K columns, then the n x n matrix is within 6 m n^{3/2} sqrt(K) + 3mn entry changes of a P-free matrix; (2) two explicit families show that no bound of the form CK per row, or CKn in total, holds with an absolute constant, even for two intervals; (3) for matrices made of two interleaved "staircase" classes we give a repair with at most 4K changes per row; (4) the block-repair lemma used by Lupini for the 2x2 identity has no direct analogue for P; (5) for matrices in which every copy uses two adjacent rows, we give two safe repair moves and a matrix with a single copy at linear distance from P-freeness. Statements are labelled proved, computed or open. The results are established facts whose novelty has not been verified. The note was prepared with an AI model; the proofs were examined by independent AI reviews and by computation, and nothing has been checked by a third party.

Provenance statement

The mathematics, the computations and the writing were produced by an AI model (Claude, Anthropic) working under the author's direction. The proofs were examined by independent AI reviews and by computation; three verification scripts are in the ancillary files and anyone can rerun them. Nothing has been checked by a third party.

Tools used

Anthropic
Claude Fable

References

  1. N. Alon, O. Ben-Eliezer, Efficient removal lemmas for matrices, Order 37 (2020), 83--101; arXiv:1609.04235.arXiv
  2. L. Gishboliner, A. Shapira, Polynomial property testing, arXiv:2508.16878.arXiv
  3. M. Lupini, Polynomial removal for the ordered two-by-two identity matrix, preprint, Zenodo 23618367, 2 November 2026.
  4. OpenAI, Polynomial removal fails for ordered binary matrices, preprint, 25 September 2026.
  5. R. Shea, a 3×33\times3 obstruction to polynomial removal for ordered binary matrices, public repository shea256/ordered-binary-matrix-removal , October 2026.
  6. Z. Wang, A four-by-four obstruction to polynomial removal for ordered binary matrices, arXiv:2610.15370.arXiv

Version history

  1. v1 · 11 pagesSubmitted by David Niedbala GiraudinInitial depositCurrentNov 20, 2026