Source. Section 4.7, physical pp. 15–16 of the
selected author version.
Available partial covers
This stage works simultaneously on the deleted classes 8(mod16)
and 16(mod32). On each branch, the prime-5 stage already covers the fifth child
and reduces the third child to one input of a 9↑. The last
prime-7 branch needs only three inputs of a 49↑; its third child
needs one class modulo 3, and its fourth needs the class 4(mod5) and two
inputs of a 25↑ inside 1(mod5).
Put
P=3↑(16,32↑)+64↑.(1)
Here the first summand fills the modulus-16 branch and the second fills the
modulus-32 branch. This contextual meaning is fixed throughout this page.
The sixteen ordered packages
The first eleven packages are
E1=E5=E8=E9=E10=E11=1,16+32,P,5(1,2,9↑⋅1,4,x),5(8,16+32,9↑⋅2,P,x),5(5↑(1,2,4,8),3(1,2,4),9↑⋅4,3↑(8,_)+5↑(3↑⋅1,3↑⋅2,3↑⋅4,3↑⋅8),x).E2=E6=2,3(4,2,1),E3=E7=4,3(8,3↑(8,4),3↑(2,1)),E4=8,(2)
Keep in reserve the partial package
R=5(5↑(_,_,16+32,P),_,_,_,x).(3)
The first ten packages in (2) fill a complete
11↑; call the resulting twelfth package E12=11↑(∗).
The twelve complete packages now available fill a complete
13↑; call it E13=13↑(∗). The star always refers to
these exact ordered inputs, not an arbitrary complete package.
The next two packages are
E14=E15=7(1,2,3⋅1,5⋅1+25↑(x,x,1,2),4,8,7↑(x,1,x,x,2,4)),7(16+32,P,3⋅2,5⋅2+25↑(x,x,4,8),3↑(4,8),11↑(∗),7↑(x,8,x,x,16+32,P)).(4)
In the last arrow of E15, the old 49-input list has positions
1,3,4 already covered on both restricted targets. The six displayed inputs
therefore record the exact mask 7↑(x,8,x,x,16+32,P). Finally, define
F=7(E16=13↑(∗),5(_,4,9↑⋅1,8,x),9↑(1,2),5⋅3(1,2,4)+25↑(x,x,x,x),5(5↑(16+32,P,x,x),16+32,9↑⋅2,P,x),5(5↑(3↑(1,2),3↑(4,8),x,x),3↑(8,_),9↑⋅4,_,x)+7↑(5(x,3↑(x,1),x,1,x),5(x,3↑(x,2),x,2,x),5(x,3↑(x,4),x,4,x),5(x,3↑(x,8),x,8,x),5(x,16+32,x,P,x),3↑(1,2)),7↑(x,3↑(4,8),x,x,11↑(∗),13↑(∗))),R+F.(5)
Complete template verification
Packages E1 through E8 supply the atomic 2- and 3-profiles needed on
both target branches. In E9,E10,E11, the fifth 5-child was already
covered and the displayed 9↑ entries fill the sole surviving third
child. Thus these eleven packages are complete. Their first ten have no prime
11 and are pairwise signature-disjoint, so they fill 11↑(∗);
adding that new package gives twelve disjoint inputs for 13↑(∗).
For E14 and E15, the earlier nested 25-package covers the
first two positions in the fourth 7-child, so the exact remaining masks are
25↑(x,x,1,2) and 25↑(x,x,4,8). Their final arrow
entries fill the still-open 7-children. In E16, the reserve R also
supplies positions three and four, so 25↑(x,x,x,x) records four
contextually precovered inputs and contributes no new regular class. Reading (5) from left to right,
the remaining seven children are supplied respectively by the completed
13 package, the 5-package with its sole 9 input, the direct 9 package,
the 3 plus 25 package, the combined two-branch 5 package, the displayed
5+7↑ package, and the last 7↑. Every x is a child already
covered by the initial prime-5 or prime-7 package. The source records one
small child still open in F's second outer prime-7 input, namely the
first input of the 5-node displayed there. This is deliberately retained
for prime 103.
At this point E3,…,E15 are thirteen complete inputs and E16
is the stated partial input. The first-level classes represented by E1=1
and E2=2 would have moduli 17 and 34, so delete them. The shifted
packages (172)↑⋅1 and
(172)↑⋅2 retain their copies at all prime-17 levels
k≥2. Thus only the first-level regular classes are empty; these are
selected-input tails, not the marked continuation of the surrounding
17↑. Primes 41 and 43 handle those two first-level holes. The
partial last branch is handled by prime 103.
No package in (2)–(5) has a regular factor 17 before it is placed here.
Their inner signature sets are disjoint by the construction order and the
explicit x deletions. Hence attaching the prime-17 level preserves regular
injectivity. Arrow terminal classes are made finite separately by the
finite realization lemma.
Used by. Later Nielsen templates.
Bears on. Problem 2.