The original essay asks a question it cannot answer, and answers a question it did not ask. This is not a failure of character. It is the usual fate of a methodological preface that has already seen the object it is pretending not to interpret. The object is a function. The preface calls the function an unfolding of unity. Two essays in this issue have already pressed on that call. What they have not done is invert the function.
That is the work of a sequel: not to decorate the source, and not to repeat the review, but to let the map show more.
The source, without its frame
The Ontological Question of One is a preface in twelve sections. Its mathematical claims, stripped of diction, are four:
- There is a map A, given for n > 1 by sopfr(n) + 2^Ω(n) − Ω(n), and completed at −1, 0, 1 by 0, 1, 2.
- Iteration from −1 produces a finite sequence that locks at 12.
- 12 is the unique fixed point; there are no cycles; every n ≥ 2 reaches 12.
- The arguments at which A does not decrease are the primes, the powers of two, 6 and 12.
The companion in this issue proved the uniqueness of the fixed point and the classification of the non-decreasing arguments. The remaining dynamical claims — global attraction, absence of cycles — were left as a sketch plus a computation. The review declined to treat the preface as an ontological argument, on the ground that “primitive unity” is a predicate assigned to 1, not a property derived from 1.
Both judgements stand. They will not be re-litigated here. The source's own criterion will be.
Show more of the map, first. If the map then still seems to be about the One, the One can wait.
What the preface gets right
Three things, before the objections.
First: the distinction between a formal starting point and an ontological one is real. Peano arithmetic is entitled to 0 and the successor. It is not, by that entitlement, a theory of why there is a unit. The source is right that these are different questions, and right that they are too often collapsed.
Second: the refusal to let a doctrine choose the formula is a real refusal. One can doubt whether the refusal is complete — the review's point about the predicate is correct — and still notice that the closed form is an arithmetical object that can be studied with the doctrine left in the hall.
Third: unusualness is a reason to keep looking. FN is a short, complete dynamical picture of a kind the recreational literature ought to have tripped over and apparently did not. That is not evidence of meaning. It is evidence of an object.
What the preface does not get to keep
The slide from 1 to unity to the One to, eventually, a question about the Creator is a slide. It is not a derivation. The source says the theological question comes afterward. Procedurally, of the formula, yes. Of the essay, no: section 2 has already told the reader that the question is ontological by consequence of a predicate, and that because ultimate unity is a theological concern, the question is theological as well. Consequence of a predicate is not consequence of a theorem.
The chamber of fourteen integers is counting, not architecture. The omitted 5, 9, 10 are omitted from one orbit. Their images are not. Nothing in A marks them as refused.
These points are the review's. They are repeated here only to mark the ground that a sequel is not allowed to recapture by eloquence.
A reconstruction of the extra term
The source attributes the closed form to a process it names and does not exhibit. Until that derivation is public, 2^Ω − Ω is a term that works. A sequel can still ask why a term that works looks like this, provided it does not pretend the answer is the missing construction.
Here is a counting that fits the symbols, and does not fit anything else.
Let n > 1 factor as a product of k primes, counted with multiplicity. These are k slots. The primes that fill them have a sum, sopfr(n). The set of slots has a power set of size 2^k. The k singletons in that power set are already represented by the primes themselves. What remains, if one insists on counting every way of taking slots and refuses to count the atoms twice, is 2^k − k: the empty selection, and every selection of two or more.
For a prime there is one slot. The power set has two elements; subtract the atom; add the prime. The map sends p to p + 1. Unity, if one still wants the word, contributes a successor and nothing else.
For 12 = 2 × 2 × 3 there are three slots. The rest of the power set has 8 − 3 = 5 elements. The atoms sum to 7. 7 + 5 = 12. The combinations fill the gap exactly.
This is not a derivation from first principles. It is a reading of a formula that already exists. Its virtue is that it explains the shape of the extra term, including the minus, without mentioning twelve. Twelve appears later, as the unique n whose gap equals the remainder of its own power set.
Invert the attractor
The companion asked why twelve is a fixed point, and proved it is the only one. The next question is not why the orbit of −1 looks strange. It is: what maps to twelve?
The proof is the same style of case analysis as the uniqueness argument, run on a different equation. Write k = Ω(n). Then A(n) = 12 if and only if
The right-hand side is 11, 10, 7, 0, −11, … as k runs through 1, 2, 3, 4, 5, …. For k ≥ 4 it is at most 0, while sopfr(n) ≥ 2k ≥ 8. So only k = 1, 2, 3 are possible.
k = 1
n is prime and n = 11.
k = 2
The primes sum to 10. If n = p^2 then 2p = 10, so p = 5 and n = 25. If n = p q with p < q then p + q = 10. The only prime pair is 3 and 7, so n = 21.
k = 3
The primes sum to 7. If n = p^3 then 3p = 7, impossible. If n = p^2 q then 2p + q = 7. The only primes that work are p = 2, q = 3, hence n = 12. If n is a product of three distinct primes the smallest sum is 2 + 3 + 5 = 10, already too large.
That is the whole theorem. No computation beyond the factorisations of 12, 21 and 25 is required, and those are not computations.
A⁻¹(12) = {11, 21, 25, 12}
The doors are not the omissions
The source made a list of absences: 5, 9, 10. Those three numbers are the small composites in [−1, 12] that are not 6 or 12, hence the decreasing points that a climbing orbit from −1 will not visit. They are recovered as preimages of the spine, which the source noted and then over-read.
The numbers that are structurally marked by the attractor are 11, 21 and 25.
- 11 is prime, so A(11) = 12 by the identity A(p) = p + 1. It is the last expanding point on the principal spine.
- 21 = 3 × 7, the only semiprime whose primes sum to 10.
- 25 = 5^2, the only square whose doubled prime is 10.
Five appears, but not as an exile. It appears as the prime whose square is a door. Nine and ten do not appear at all. The architecture the source was looking at was the wrong slice of the graph. The graph, inverted at 12, has a neck of three proper preimages, one of which lies on the spine and two of which do not.
This is the first fact in the subject that one could not have guessed by staring at FN. It is also the first fact that satisfies, in miniature, the generative criterion: invert the attractor, and the map produces a classification that was not used to write the map.
One more layer
The same equation, with 12 replaced by 11, 21 and 25, is still elementary.
The integers that map to 11 are 8 and 14. (k = 3 gives 2^3; k = 2 gives 2 × 7.) The integers that map to 21 are 24, 34, 66 and 98. The integers that map to 25 are 56, 90, 130 and 154.
One layer above the neck. Then the tree ramifies.
Above that the tree ramifies without bound. Every integer that falls to 12 — if they all do — falls through one of these three corridors. The chamber of fourteen positions is a waiting room. The doors are the building.
On not reading the doors
It will be tempting, because it is always tempting, to notice that 11 is the last prime before the attractor, that 21 is 3 × 7, that 25 is the square of the first omitted prime, and to start a museum. The museum should stay closed.
A correspondence is a structure-preserving map constructed without looking at the target's names. 21 is 3 × 7 because 3 and 7 are the unique prime pair summing to 10, and 10 is the value of 12 − 2^2 + 2. That is an account of 21. It does not become a better account by recalling that 21 is also the product of two triangular numbers, or the number of dots on a pair of dice, or anything else that is also twenty-one.
The source's criterion, applied here, says: the inverse theorem is the showing-more. The names of the doors are not.
The basin, with a neck
Global attraction is now a sharper statement. It is not “every n reaches 12.” It is:
The companion's classification still governs the route. Expanding points — primes, powers of two, and 6 — step up; everything else steps down; 6 feeds the spine; 12 is the sink. A cycle other than the fixed point would have to include an expanding point, because a cycle made only of decreasing points cannot close.
The smallest candidate is a 2-cycle p ⇄ p + 1, which would require A(p + 1) = p. For even m = p + 1 that is the gap equation m − sopfr(m) = 2^{Ω(m)} − Ω(m) + 1. The same case analysis that classified the inverse of 12 rules this out for small Ω; a search of all pairs up to 20 000 finds no 2-cycle of any kind.
A complete proof that there are no longer cycles, and that no orbit diverges along a chain of Mersenne primes and powers of two, is still bookkeeping. One needs a bound B past which every expanding step is followed, within two or three iterates, by a drop below the starting value, plus a finite check below B. The laboratory attached to this issue performs the check. Every n from 2 through 50 000 reaches 12, in at most fifteen steps. The slowest examples are large primes that step to a highly composite even number which then takes a long decreasing walk down through the neck. Factorials and primorials, far from wandering, collapse in a handful of iterates: 7! = 5040 maps to 274, then to 141, and is at 12 eleven steps from the start.
This is not yet “every integer.” It is the remaining claim made ordinary.
What the primitive still does not prove
Return to the source's question, now that the inverse is known.
What happens when 1 is iterated under A? A finite climb, three omitted decreasing points, lock at 12. What happens when an arbitrary integer is iterated under A? A longer walk, sometimes up, usually down, always — so far — through one of three doors. What happens when 12 is inverted? Four solutions, three of them proper, all elementary.
None of these sentences requires the word unity. The word can be put back, if one wishes, under the restrictions the theorems impose:
- Unity, so read, does not skip 5 as a principle. It skips 5 as a decreasing point beside a climbing orbit.
- Unity does not choose 12 as a sacred number. It lands on the unique solution of a gap equation, and it admits exactly three other numbers to that landing.
- Unity does not close because closure is beautiful. It closes because A(12) = 12, and because the rest of ℕ appears to be the basin of that point.
Those restrictions were already the companion's gift. The inverse theorem adds one more. If there is architecture, it is the neck, not the chamber. If the neck is not theological, then neither was the chamber, and the source was right to say that unusualness is not a theorem of meaning.
The criterion, cashed once
The original asked its successors not to project meanings onto a curiosity. It asked them to generate, constrain, predict, explain, solve.
This note generates a classification — the inverse of the attractor — that the original did not contain. It constrains Layer II: any reading in terms of unity must now speak of three doors, not of fourteen positions, and must not treat 5, 9 and 10 as the distinguished absences. It predicts that every orbit, not just the orbit of −1, will hit {11, 21, 25} before it hits the lock; the laboratory is the instrument of that prediction. It explains why the principal spine looks like a privileged path: it is the unique route to 12 that uses the prime door and never the two composite ones.
It does not solve a problem in another field. Layer III has still not begun. Layers IV and V remain optional, and further from being earned than the source hoped.
That is a fair harvest for a sequel. It is smaller than a metaphysics and larger than a sequence. The source, at its best, asked for exactly that proportion.
Begin with the primitive. Apply only what the primitive permits. The consequences, this time, are an inverse theorem and a neck. Let them speak before the One is asked to.