How statement and proof provenance work
The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.
- Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
- AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
- AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.
These labels describe origin, not correctness: citations and verification chips remain separate evidence.
Skolem's construction gives a Steiner triple system of order
Statement
For every integer , the following explicit construction gives a Steiner triple system of order . Let , interpreting its addition modulo , and let . Define a permutation by and for , and define . On the point set , take the following three families of blocks, with layer arithmetic in :
- for ;
- for and ;
- for each two-element subset and .
Facts & Assumptions
Given: An integer , the point set and block families in the Statement.
Standard representatives give and ; translation modulo is a bijection (For , every class in has one representative with , so ; while is in bijection with , For every natural , is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold).
A collection of three-element blocks on points, in which every pair of distinct points occurs in exactly one block, is a Steiner triple system (A - design, Steiner triple systems).
Proof technique: direct.
Proof
The even and odd representatives are mapped bijectively by to and respectively. Thus is a permutation. By [F1], for each the map is a bijection. The operation is commutative, and its diagonal is and for , since the corresponding sums modulo are both . Denote these diagonal values by .
Each listed block has three distinct points. For the third family, makes the two layer- points distinct, while the last point has layer . The first and second families plainly have three distinct points. Blocks of the three families cannot coincide: infinity distinguishes the second, and a first-family block uses three layers, while a third-family block uses exactly two. In the third family the layer containing two points uniquely determines and then , so its indexing produces no duplicate blocks.
A pair containing occurs only in a second-family block. If its other point is , its unique block is ; if its other point is with , its unique block is . The two cases partition all finite points and their indices are unique.
A pair of distinct finite points in the same layer, , has and occurs in the unique third-family block indexed by . Neither of the other families has two finite points in the same layer, and the repeated layer in a third-family block is uniquely determined.
For a finite pair in different layers, there is a unique orientation , because the layer set has three elements. A third-family block containing this pair must have repeated layer : a block repeated at uses layers , and one repeated at uses layers . Such a block therefore has the form , where and . Step 1.1 gives a unique solution . It satisfies exactly when , so the pair occurs in exactly one third-family block when , and in none when .
If and , then and the pair lies in the unique first-family block for . If and , then and the pair lies in the unique second-family block indexed by . Conversely, the different-layer finite pairs of every first-family block have the oriented form , and the unique finite pair in every second-family block has the oriented form ; these are precisely the two diagonal cases just described. Thus neither family duplicates the third-family pairs from step 2.1, and the diagonal pairs each occur once.
Steps 1.3, 1.4, 2.1 and 3.1 exhaust every pair of distinct points and prove unique block coverage. The point set has points by [F1], and . Step 1.2 and [F2] now establish the claimed Steiner triple system.
Depends on
- Steiner triple systems
- A $2$-$(v,k,\lambda)$ design
- The congruence class $[a]_n$ and the quotient set $\mathbb{Z}/n$
- For every natural $n$, $(\mathbb{Z}/n,+)$ is an abelian group, multiplication is a commutative monoid operation, and both distributive laws hold
- For $n\ge 1$, every class in $\mathbb{Z}/n$ has one representative $r$ with $0\le r<n$, so $\lvert\mathbb{Z}/n\rvert=n$; while $\mathbb{Z}/0$ is in bijection with $\mathbb{Z}$
Used by
Dependency tree · two levels
17 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.
Sources
- Jonathan Davidson, Steiner Triple Systems, Skolem Construction (standard reference, not scraped)