Source. Section 4.8, physical pp. 16–17 of the
selected author version.
Work in the deleted class 5(mod12), which lies on its 1(mod4) branch.
Begin with the ten ordered packages
F1,…,F10=(4,8↑,3⋅1,3⋅2,3⋅4,3⋅8↑,9↑(1,2),9↑(4,8↑),5↑(1,2,4,8↑),5↑(3⋅1,3⋅2,3⋅4,3⋅8↑)).(1)
Put
(B1,…,B12)=(1,2,F1,F2,…,F10).(2)
Use the first and last blocks of six, in that order, to define
F11=7↑(B1,…,B6),F12=7↑(B7,…,B12).(3)
Thus F1,…,F12, rather than the temporary atomic inputs 1,2, are
the first twelve inputs of the outer 19-arrow.
The prime-11 stage already partially covers this branch. Define
F13=11↑(x,x,1,2,3⋅1,5↑(x,x,1,x),5↑(x,2,3⋅1,3⋅2),3⋅2,7↑(x,x,1,2,x,x),9↑(1,2)).(4)
Let F14 be the same package after replacing every atomic 1 by 4 and
every atomic 2 by 8↑. These two substitutions fill the two
complementary remaining prime-11 profiles.
The source allows the earlier packages to be selected in any compatible
order. Fix the reproducible choices
F15F16=13↑(1,2,F1,…,F8,F11,F12),=17↑(1,2,F1,…,F14).(5)
The first list has twelve entries and excludes F9,F10, which begin
with 5↑, and F13,F14, which begin with
11↑, exactly as the source requires. The second list has sixteen
entries. Neither list contains its new outer prime, and each is drawn without
repetition from a signature-disjoint ordered pool.
It is the union of four packages. Put
G1=5↑(_,9↑(1,2),9↑(4,8↑),_),(6)
G2=7↑(_,_,_,5↑(9↑(1,2),x,x,9↑(4,8↑)),_,_),(7)
and
G3=11↑(x,x,5↑(9↑(1,2),x,x,9↑(4,8↑)),7↑(3⋅1,3⋅2,3⋅4,x,3⋅8↑,9↑(1,2)),7↑(9↑(4,8↑),5↑(1,x,x,2),5↑(4,x,x,8↑),x,5↑(3⋅1,x,x,3⋅2),5↑(3⋅4,x,x,3⋅8↑)),x,_,_,7↑(x,x,5↑(9↑(1,2),x,x,9↑(4,8↑)),x,x,x),_).(8)
The source abbreviates several 11↑ packages below to three
displayed entries. Precisely, write
J(u,v,w)=11↑(x,x,x,x,x,x,5↑(x,x,x,u),v,x,w).(9)
The earlier prime-11 package together with G1,G2,G3 covers
prime-11 inputs 1,…,6,9. In input 7, the first three
regular inputs of the displayed 5↑ are covered, so u occupies
its fourth input; v,w occupy prime-11 inputs 8,10.
Every compressed expression
11↑(5↑⋅u,v,w) below means this full J(u,v,w).
With that exact expansion, the fourth package is
G4=13↑(5↑(1,x,x,2),5↑(4,x,x,8↑),5↑(3⋅1,x,x,3⋅2),5↑(3⋅4,x,x,3⋅8↑),5↑(9↑(1,2),x,x,9↑(4,8↑)),J(1,1,2),J(2,4,8↑),J(4,3⋅1,3⋅2),J(8↑,3⋅4,3⋅8↑),J(3⋅1,9↑(1,2),9↑(4,8↑)),J(3⋅2,5↑(3⋅4,x,x,3⋅8↑),7↑(1,2,4,x,8↑,3⋅1)),J(9↑(1,2),7↑(3⋅2,3⋅4,3⋅8↑,x,9↑(1,2),9↑(4,8↑)),7↑(5↑(1,x,x,2),5↑(4,x,x,8↑),5↑(3⋅1,x,x,3⋅2),x,5↑(3⋅4,x,x,3⋅8↑),5↑(9↑(1,2),x,x,9↑(4,8↑))))).(10)
Set
F17=G1+G2+G3+G4.(11)
The construction leaves the eighteenth regular input of the outer
19↑ empty at its first level. This is the hole completed at prime
47. Its copies at all higher prime-19 levels are covered by the
contextually selected input tail
(192)↑⋅1.(12)
For (1), every package is complete on the target branch by the initial
prime-3 and prime-5 coverage. The two six-package blocks therefore fill
the two 7 arrows. In (4), the black and gray children supplied by the earlier
11 template are exactly the x positions; the remaining displayed inputs
fill every white child. The substitution defining F14 switches to the
other unused 2-profiles. The source's exclusions in F15 prevent reuse
of a 5- or 11-signature.
For (6)–(11), G1 supplies the sixth child of the partially filled
11↑, and G2 supplies the fourth child of the needed
7↑. Together with prior coverage, G3 leaves exactly
prime-11 positions 7,8,10 unresolved. Each full J(u,v,w) in G4
fills those three positions with the stated fourth prime-5 input and the
two complete packages v,w. The twelve resulting J-based and direct
packages fill the children of the outer 13↑. Reading the displayed
inputs in order leaves no blank except an explicitly precovered x. Hence
F17 is complete. Formula (12)
covers the eighteenth input's copies at levels k≥2; it does not fill that
input at level k=1, and it is not the outer arrow's marked spine.
The exact exponent-region calculation on the
signature-certificate page
proves that the seventeen inner signature sets are disjoint. It also checks
the selected-input tail against their full unbounded 19-exponent ranges.
None contains 19 before being placed in the outer arrow. Thus
19↑(F1,…,F17,_)+(192)↑⋅1(13)
is a regular-pattern-injective partial package for the modulus-12 hole.
It retains all repeated copies of F1,…,F17 and the outer marked
spine. After (12), exactly the first-level eighteenth child remains
unresolved among the regular input targets. Prime 47 fills that class and
thereby completes the hole; the outer marked spine is later terminated by the
general finite-arrow lemma.
Used by.
The prime-23 template, later Nielsen stages, and
Owens's construction.
Bears on. Problem 2.