The Law of Two: Why a Relational Ontology Entails Exactly Two — a Theorem of the Hodos Hypothesis, and the One Case That Could Refute It

Abstract

If nothing is what it is in isolation, how many things does it take to be one thing? The Hodos Hypothesis holds that a thing is the pattern of its connections and not its substrate, and that the regress does not halt. This paper argues that the branching factor of that regress is not a further assumption but is entailed: a relation cannot hold with fewer than two, so if a thing exists only through relation then a thing is two things, and each of those is two things, without end and without a floor. The Law of Two is therefore a theorem of the premise rather than an axiom standing beside it. The clause constrains the relational unit, not the number of things. For n things in complete relation there are n(n−1)/2 relations, and every one of them holds between exactly two, whether n is odd, even or unbounded. Seven things cannot be sorted into complete pairs, and that is irrelevant: a seventh thing does not arrive unpaired, it arrives standing in six new relations. Complexity does not replace two; it is produced by repetitions of it. This is a derivation, and it is filed as one. What a reader checks is whether the step from relation to two holds, not whether an instrument returned a number. A survey of twos would not confirm it and none is offered; what the paper does instead is state the three things that would end it, because a claim that rules nothing out is not worth deriving. The claim is worked through twice. In geometry, because n things in complete relation are exactly the edge structure of an (n−1)-simplex — a figure generated entirely by its edges, every one a pair, with no isolated vertex, no privileged vertex and no centre. In arithmetic, because every number is what two others made, odd numbers included. It then faces the strongest case against it — the three-quark baryon and the three-valued colour charge of the strong interaction — and names the standing formal challenge, Peirce's reduction thesis, without claiming to have answered it. The answer turns on a distinction the paper argues is where most assessments of a claim like this go wrong: a count of three is a count of objects, while the constitution is the three relations that hold between them, and a relation has two ends. The particles are what a detector resolves; the relations are what the thing is made of. One measured fact appears, and it is about a figure rather than about the clause. The six-vertex diagram this programme draws carries fifteen measured values on its edges, and those values are not distances — they break the triangle inequality — so there is no simplex for them to be the edge lengths of. That settles a reading: the correspondence is connectivity, not geometry. It bears on the Law of Two in neither direction. Preprint, not peer reviewed. It is filed separately from its parent premise so that one step which can be wrong is argued with in its own right. The idea is not claimed as original — the recursive doubling is stated in the Xici commentary to the I Ching, and the no-floor position is established in contemporary philosophy as gunk. What is claimed is the derivation, the formulation, and a falsifiable commitment stated before any attempt on it was designed.