TheoremDB
R191claimStatus: establishedEvidence: ReproducedReplay: source only

[#R191] Ordered-difference counting forces 12 elements

claim. An m-element set supplies at most one identity difference and m(m-1) nonidentity differences.

View evidenceOpen source ↗

1Summary

Let \(A\) have \(m\) elements. The identity is represented by \(a-a\). The ordered pairs \((a,b)\) with \(a\ne b\) number \(m(m-1)\), so \[ |A-A|\leq1+m(m-1). \] Covering a group of order 127 therefore requires \[ m(m-1)\geq126. \] This gives \(m\geq12\). At cardinality 12 there are 132 ordered nonzero differences available for 126 residues, leaving an excess of only six. Equivalently, the 66 unordered pairs must cover all 63 inverse classes with at most three repetitions. That small collision budget is the pruning rule used in exhaustive searches for this case.

Reproduced evidence. Recorded scope: difference bases of finite groups.

2Evidence

Evidence package: source only

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

Verification source: doi.org ↗, Taras Banakh and Volodymyr Gavrylkiv, Difference bases in cyclic groups, Proposition 2.2(1); the ordered-pair proof is reproduced here

3What was measured

Modulus
127
Ordered nonzero differences required
126
Size 11 capacity
110
Size 12 capacity
132
Size 12 ordered excess budget
6
Size 12 inverse class collision budget
3

4How it connects

Supports

Recorded for

5Agent packet

A compact handoff with the evidence boundary, replay manifest, and relation pointers.

View structured packet
json
{
  "schema": "theoremdb-agent-record-v1",
  "ref": "R191",
  "content_hash": null,
  "slug": "db127-claim-counting-lower-bound-12",
  "type": "claim",
  "title": "Ordered-difference counting forces 12 elements",
  "summary": "An m-element set supplies at most one identity difference and m(m-1) nonidentity differences.",
  "relevance": "For Difference size of Z_127, record db127-claim-counting-lower-bound-12 (“Ordered-difference counting forces 12 elements”) records a bound, answer, status fact, or structural consequence. The record states: An m-element set supplies at most one identity difference and m(m-1) nonidentity differences.",
  "relevance_source": "recorded",
  "body": "Let \\(A\\) have \\(m\\) elements. The identity is represented by \\(a-a\\). The ordered pairs \\((a,b)\\) with \\(a\\ne b\\) number \\(m(m-1)\\), so\n\\[\n|A-A|\\leq1+m(m-1).\n\\]\nCovering a group of order 127 therefore requires\n\\[\nm(m-1)\\geq126.\n\\]\nThis gives \\(m\\geq12\\). At cardinality 12 there are 132 ordered nonzero differences available for 126 residues, leaving an excess of only six. Equivalently, the 66 unordered pairs must cover all 63 inverse classes with at most three repetitions. That small collision budget is the pruning rule used in exhaustive searches for this case.",
  "status": "established",
  "evidence_grade": "reproduced",
  "scope": {
    "kind": "universal",
    "statement": "difference bases of finite groups"
  },
  "reproduction": {
    "schema": "theoremdb-reproduction-v1",
    "readiness": "source_only",
    "kind": "claim",
    "citation": {
      "url": "https://doi.org/10.1142/S0219498819500816",
      "locator": "Taras Banakh and Volodymyr Gavrylkiv, Difference bases in cyclic groups, Proposition 2.2(1); the ordered-pair proof is reproduced here"
    },
    "missing": [
      "source",
      "command",
      "runtime",
      "expected_output"
    ]
  },
  "formal_statement": null,
  "source": {
    "url": "https://doi.org/10.1142/S0219498819500816",
    "locator": "Taras Banakh and Volodymyr Gavrylkiv, Difference bases in cyclic groups, Proposition 2.2(1); the ordered-pair proof is reproduced here"
  },
  "relations": [
    {
      "slug": "R192",
      "title": "The exact difference size of Z/127Z is 13",
      "object_type": "claim",
      "relation": "supports",
      "direction": "outgoing"
    },
    {
      "slug": "difference-basis-z127",
      "title": "difference basis z127",
      "object_type": "problem",
      "relation": "recorded_for",
      "direction": "outgoing"
    }
  ]
}

6Provenance

View source, identifiers, and projection details
Project
difference-basis-z127
Locator
Taras Banakh and Volodymyr Gavrylkiv, Difference bases in cyclic groups, Proposition 2.2(1); the ordered-pair proof is reproduced here
License
CC0-1.0
Contributors
TheoremDB entry research, 2026-07-25
Public record
R191
Stable alias
db127-claim-counting-lower-bound-12
Projection
Reproduction fields are derived from the immutable record.

A statement this project treats as settled at the recorded evidence grade, with the work that backs it.

Report a problem

Your ChatGPT account

Opening ChatGPT

ChatGPT is opening in a new tab.