Formation precedes assertion. A strict inscription enters the object language through a positive formation event: a witness, trace, relation, transformation, nonempty roster, pairing, certificate, or explicit sponsorship. The formation event supplies the inscription and its provenance together.

The thesis is stated positively. The strict language records what a scene presents and how the presentation forms. Evaluation judgments and search control remain in the metalanguage, and implementation control codes remain in the implementation stratum. They do not acquire object status merely because a software datatype or explanatory sentence needs to discuss them, and the language of record carries no counterpart to any of them.

Whenever a formed symbol is assigned the semantic office of representing non-existence, the notation embeds a category conflict: the mark's formation certifies presentation while its assigned role asks it to stand for a failed presentation. Presence-only formation resolves the conflict by retaining the formed mark, when one exists, as implementation or diagnostic control rather than promoting it to a strict semantic object.

This is a claim about type and formation, not a Boolean verdict declaring one mathematical tradition permitted and another forbidden. Classical mathematics and the presence calculus are distinct formal regimes. Their relation is established theorem by theorem through named interfaces.

Unity may be positively presented. A natural scene may exhibit a stable singular organization; a counting procedure individuates that presentation and carries it into tally grammar as one. The phrase imposed unity names this individuation operation. It does not mean that nature is incapable of presenting singular form.

The Descent interpretation gives a second realization. In the sweeping geometry, unity forms through the balance between an infinitesimal length carried through an infinite angle and an infinite length carried through an infinitesimal angle. Written schematically in the metalanguage,

The balance is not a discovery of a context-free numeral floating outside formation. It is a positive relation whose sweep, scene, and trace form a unit carrier.

Counting therefore requires:

The numeral one records the first formed unity of that procedure. Genealogical numeration retains the sweep history by which the unity formed.

A positive contrary is not the shadow of a missing affirmation. Rejection, exclusion, failure, incompatibility, and fault are lawful object-language contents when independently witnessed. An instrument fault report is a positive event. A completed search certificate is a positive event. A witnessed clash between two formed inscriptions is a positive event. What is barred is the conversion of silence into any of them without a sponsor.

The notation distinguishes:

Status (iii) is not a third truth value. It is not an object that propagates through connectives, a null member of a result type, or an “unknown” value. It is the metalanguage observation that neither of the first two inscriptions formed. A three-valued logic reifies the third status as a participant in operations. TPN does not.

The foundational thesis does not declare classical mathematics meaningless or useless. It denies automatic transfer.

A positively interpreted fragment of a classical structure may be used when the interpretation presents its elements, domains, and operations. A theorem then transfers only after a separate argument shows that its statement and proof remain inside that fragment. Every use of an empty auxiliary structure, choice over an unpresented family, excluded middle over unformed sentences, or a null element requires a named interface. The price may be worth paying; it may not be hidden.

No theorem in this volume establishes that all classical mathematics has such a transfer. Conversely, no failure of automatic transfer is represented as a refutation of the classical theorem in its own register.

TPN is the program's trace-bearing decision language. Its primitive sorts are:

A witness forms an inscription only with a scene and trace:

A roster requires one or more entries and positive individuation:

A tally forms only from a roster:

Thus counting begins at one as a consequence of the adopted roster formation rule.

A certificate records positive completion rather than an absence:

Direct clash recording and hypothesis-discharging rejection are different acts.

A direct clash requires two formed inscriptions and an independent witness of incompatibility:

A rejection under a hypothesis requires derivations on both sides of a witnessed clash:

A term's failure to form is a metalanguage judgment and is not itself a clash. Indirect reasoning remains available, but it must terminate in two positively formed conclusions together with a positive incompatibility witness.

Foundational laws are not described as unsponsored truths. They enter the adopted theory through a positive adoption event:

The event does not prove \varphi from weaker laws. It records which theory has been selected and who or what performed the selection.

This rule governs both Native Admission and the omega completion used later. It is the principal device by which the volume separates adopted law from theorem.

Scenes compose only through presented pairings. If witnesses in scenes \sigma and \tau are identified by a trace-bearing pairing, the pairing licenses transport between those scenes. No universal ambient scene is given for free.

The frequently used idea that local scenes assemble into a scene-colimit is an interpretation. A formal colimit model is not supplied by the current calculus. Accordingly, this volume does not cite scene-colimit language as a theorem of TPN.

The formation rule has direct engineering consequences.

The base formation rules require a positive witness or precipitation event. Every composite rule preserves at least the witnesses and traces of its premises. Roster formation requires at least one entry. An induction over derivations therefore shows that every formed tally has a nonempty sponsoring roster. A null tally has no derivation under these rules.

Juxtaposition of genealogies and nesting of one genealogy through another supply candidate readings of addition and multiplication. This volume uses those readings only where a corresponding evaluation identity is displayed or proved. It does not assert a general arithmetic representation theorem for all genealogical numerals.

The n-wave reading—that a degree-n residue family is realized by n-fold interference—is likewise an interpretation. No complete formal n-wave model is included in the current artifact set.

Let S be a semigroup without an identity. Its free identity adjunction is

with multiplication or addition extended so that e is an identity and with no further relations imposed.

For the positive additive tally semigroup,

Classical zero is recovered here by an explicit adjunction. A genealogy-forgetting map that sends a formation history to its positive magnitude does not by itself create an identity element. Consequently, any classical passage requiring zero must name the completion or adjunction; it cannot be attributed to projection alone.

Achiral glyphs (self-converse denotations): +\;\cdot\;=\; \leftrightarrow\;\forall\;\pi, the vertical stroke, and the provisional digit family. Chiral pairs, each mirroring to its converse:

Additional achiral operators of that layer: \curlywedge (minimum), a vertical-symmetric existential, three-dot digit-three (freeing \Delta for the differential). Retirement: the pairs violate the strict axiom individually; the layer is retained solely as a typeable linearization of Layer-2 terms, and its two glyph classes are recovered in the final theory as the trivial and sign isotypes of the flat reading group.

All coordinates are in units of the atom half-size s (engine value s=11 pt at scale 1), origin at the atom's center, x rightward, y upward. Every construction is symmetric under x\mapsto -x by inspection. “Pip” = filled dot of radius 0.35s; “dot” (operator) = filled dot of radius 0.16s; “rank dot” = filled dot of radius 0.3s.

Universal metrics: gap G=8 pt\timesscale; adhesion marks render at 0.55\times host scale; box padding 1.4G; Up/Dn connector 2.6s; Lk connector 1.8s.

WF1: all layout axes vertical. Mirror theorem (structural induction): every well-formed term denotes the same proposition as its mirror; the only argument-permuting constructors are Row/Jux, tamed by commutativity. Machine check: render term and reflected term to primitive multisets (lines, circles, discs, arcs, rects); the term passes iff the coordinate-reflection of the first matches the second under bipartite pairing with tolerance 0.05 pt (arcs compared with \theta\mapsto 180^\circ-(\theta+\mathrm{extent})).

The strict object grammar has exactly twelve constructors over the strict atom set \Sigma:

Blank is outside this count because Blank is not an object constructor.

Atoms are generators, not constructors in the twelve-constructor count.

Only \mathsf{Bal}, \mathsf{Row}, and \mathsf{Jux} reverse their arguments. Every strict atom is fixed. The remaining constructors are carried pointwise under horizontal reflection.

Arithmetic, membership, parity, magnitude, orientation, duration, index, and genealogy attach to formed terms, and the operand, mark, host, numerator, denominator, roster, and enclosure positions are each occupied by formed terms — the occupancy exhausts the positions. Where a classical renderer prints a placeholder, this one performs the judgment instead, and the judgment is the whole of the record.

In bijective base ten, a canonical numeral has a finite rank roster

with every rank 0,\ldots,k represented exactly once, and value

The roster is displayed through \mathsf{Jux}; reflection may reverse the display order, but rank marks retain the value. For example, thirty-two is the cluster consisting of a rank-one digit three and a rank-zero digit two. One hundred is represented by rank-one digit nine and rank-zero digit ten. No placeholder is required.

Existence and uniqueness are the usual division-with-remainder proof for bijective numeration, using remainders in \{1,\ldots,10\}. If an ordinary remainder is zero, the preceding quotient is reduced by one and digit ten is used. WF5 records each resulting rank exactly once and excludes all alternative carriers with repeated, omitted, or unit-denominator ranks.

Structural induction on t. Atoms are fixed. In the \mathsf{Bal}, \mathsf{Row}, and \mathsf{Jux} cases, two applications of reflection reverse the arguments twice and the inductive hypotheses restore the children. Every remaining constructor is preserved pointwise, so the inductive hypotheses close those cases.

Proceed by structural induction. WF1 is preserved because strict atoms are fixed and horizontal reflection preserves vertical axes. WF2 is preserved because host and mark sorts are preserved recursively and the vertical adhesion position is unchanged. WF3 is preserved because the three argument-reversing constructors are restricted to swap-invariant content. WF4 is preserved because horizontal reflection does not change whether a formed enclosure is open or semantically indeterminate. WF5 is preserved because the rank-labelled numeral roster is unchanged as a roster. WF6 is preserved vacuously on strict terms because no control preterm occurs in either t or \refl t.

Let L(t) denote the ideal renderer emission as a finite structured family of primitives with exact coordinates, and let \mu denote coordinate reflection x\mapsto-x on those primitives.

The proof is structural. The atom case follows from the stroke registry. For \mathsf{Bal},\mathsf{Row},\mathsf{Jux}, horizontal reflection exchanges the child placement boxes, exactly matching the recursive argument reversal. For \mathsf{Stk},\mathsf{Up},\mathsf{Dn},\mathsf{Lk}, \mathsf{Adh},\mathsf{Frac}, reflection preserves vertical order and acts on each child. Overlay reflects each superposed primitive. Closed and open enclosure frames are themselves symmetric and carry the reflected child. These are all twelve constructor cases.

Structural induction using the displayed interpretation hypotheses. The result is conditional on the semantic dictionary; renderer equivariance alone is not a proof of an arbitrary denotational interpretation.

The reflection metatheorems proved in this chapter apply to the full twelve-constructor grammar \mathsf G_{\mathrm P}. The accompanying Lean development formalizes the implementation fragment \mathsf G_{\mathrm K}, whose constructors are

For this fragment the development proves reflection involutivity, preservation of its implemented well-formedness predicate, and equivariance of its emission algebra.

The implementation constructor blank is an artifact of the implementation grammar \mathsf G_{\mathrm K} alone; the strict discipline of record carries no counterpart to it at any layer, and it is not interpreted as a term of the strict object language. The full grammar theorem is therefore the structural theorem proved above, while the kernel certificate applies to the explicitly represented fragment \mathsf G_{\mathrm K}. Toolchain information and source checksums are supplied with the accompanying artifacts.

Historical caption-only plate. The page, tent, corner, cone, and space were assigned the groups

The current fixed-algebra theorem replaces the former claim that every orbit span is irreducible.

Blank stratification

Historical reductio text: the implementation rejected a Blank control as an adhesion host and as an oriented operand. Those rejections do not reject a presented off-axis parameter with a metalinguistic nonemission judgment.

Historical Proof I: alternation as orientation reversal.

Historical Proof II: singularity as equality of parity fusions.

Historical Proof III: the half-turn annihilation display.

Historical Proof IV: modification on a null event.

Historical Proof V: Borel–Cantelli in the proposed descent display.

Historical Proof VI: the Burnside right-folding criterion.

Historical Lemma B: Selection Jump display.

Historical Lemma C: no occupied Blank control.

Historical notation execution of Euclid's theorem.

The historical source announced that the external assessment had been adjudicated, the first MJA stratum corrected, Blank discipline tightened, the fixed-algebra theorem adopted, and machine claims rescoped. The claim of completed analytic budgets does not hold at the stratum of record, and Option B Blank is superseded by the strict renderer-control classification.

The glyph corpus — the figures, stripped of every caption, label, and word — was delivered to an independent reader in a fresh context, with staged probes designed to leak neither vocabulary nor target. The reader was caption-blind, not mathematics-blind: the correct condition, since the reference clauses of Section concern informed interpreters. Three rounds; findings at exact strength.

Round one: arithmetic. The bijective numerals, the rank-dot place system, the carry law, commutativity, and the machine edition's quadratic ladder were recovered, and every operator was correctly typed. The language's arithmetic stratum self-decodes.

Round one's conviction. Offered a vacant slot in an additive frame — three plate emissions then carried a blank fused as an addend — the reader introduced a null object, performing exactly the category collapse the typing charge indicts. The layout, not the reader, was convicted: the emissions were repaired, and the stricter Blank control of the current stratum is the enactment. The experiment thereby served as the register's first external audit instrument.

Round two: the primes. The membership rule of the index family was recovered exactly — membership above one admitting only the unit factorization, with the square-root stopping rule derived from the reflected pairing of divisors: the mirror law's arithmetic shadow, surfacing unprompted. The reader generated correct unattested members from the decoded rule: the grammar is generative in foreign hands.

Round two: the retraction. Tested distributionally, the null-object hypothesis was formally retracted: the empty enclosure is never added, multiplied, exponentiated, indexed, or oriented; it stands only as a balance side or within an enclosure. The reader concluded that it marks a well-typed place whose content is absent — the blank-as-judgment doctrine, reached from evidence alone by a classically trained mind, with the distinction between an unfinished syntax and an inscribed absence drawn without prompting. The sponsored seals were read as meta-level provenance marks, as designed.

Round three: the mirror and the naming. The reader corrected its own earlier census, reformulated the reflection as an involutive order-reversing operation under which the notation is closed — legality preserved, statements carried to equivalent or dual statements — and identified this closure as the structural law, with pointwise symmetry its fixed-point case: the mirror theorem, recovered blind at language level. Then, holding the prime index, the reciprocal ladders, the privileged half with its fixed-point property, and the reflection law jointly, the reader named the object: the Riemann zeta function and its Euler product, at a self-reported confidence of ninety percent; the completed descent with its reflection about one half, seventy; an approach to the critical line and the hypothesis, sixty. The figures the reader specified as settling the remainder are, item for item, the categoricity ingredients of Section and the axis statement of the Riemann architecture: the reader requested exactly the plates the volume contains.

The exhibition claim — that the notation carries arithmetic, generative grammar, and structural law to an independent mind without one word of any human language — gains empirical support. The reference clauses gain their trial: the categoricity ingredients, jointly held, moved a blind reader to the intended object by name. And the register gained an instrument: the one violation surviving fourteen internal audits was found by external eyes in one round.

Status, recorded exactly. The trial had sample size one; the reader was a single language model; confidence figures are self-reported; the protocol was not a blinded human-subject experiment. The record is an exploratory audit observation and supports the exhibition and reference claims at evidence grade; it is not a theorem of semantic legibility or of reference, and no clause of this volume's assertion of record rests on it. Within those limits the finding stands as stated: reference travels in the strokes; the keeping, as ever, is the cell.

(\Leftarrow) In the transverse case the residue is (A\fuse B)\meet\pproj with A,B the separate traces (Axioma); by Axiom the genealogy of a fused pair is the product of genealogies, and in the transverse case the two factors have independent constraint paths, so the factorization of \trace(A\fuse B) into its two coprime paths is unique and each factor, together with its cost, determines its sweep. (\Rightarrow) In the tangential case the merged trace of Axiomb identifies the overlapping constraint once; the surcharge \defect is exactly the inscription of what the merge forgot, and distinct pairs sharing the same overlap and the same complements precipitate identical residues, so no inverse exists. Formally, in the blade model of § the tangential fiber of the junction map over a fixed residue has positive dimension equal to \dim of the overlap, while the transverse fiber is a single point; the model computation is Theorem(iv).

(i)–(iii) are elementary linear geometry: intersection of subspaces is commutative; codimensions add under transverse intersection and exceed additivity by the overlap dimension otherwise, which is exactly Axiom with \defect = excess; the cone conditioning is an idempotent operation commuting with direct sum on independent supports, giving Axiom. (iv): in the transverse case two planes in general position through a common line are determined by their traces on that line together with their codimension data, so the junction map is injective on transverse pairs with fixed costs; in the tangential case one may rotate each plane within the overlap without changing either the intersection or the costs, producing the positive-dimensional fiber.

The surcharge law, the distributivity axiom, and Recoverability fail in the blade model; the counterexamples of the preceding chapter close that route. The algebra of record is the typed system defined here.

The assertion is the smaller typed algebra \mathsf{MJA}_{2}.

The partial operations are:

and

Fusion is defined only when the fused sweep remains proper. Junction is defined only when the intersection residue is proper and nontrivial. Undefinedness is a metalanguage fact about the partial operation; no null residue is returned.

Distribution of \meetJ over \fuse, Recoverability of inputs from a residue, and conditioning as a residue endomorphism are not axioms of \mathsf{MJA}_{2}.

Let E be an ambient classical carrier and C_{+}\subset E a fixed positive cone. In the metalanguage define

The operator P_{+} is monotone and idempotent on its set-valued domain:

The observation sort contains the presented nonempty cone sections of residues. The map

is a partial corestriction, defined only when the section is observation-typed. The classical metalanguage may state that another section is empty; the strict object language receives no empty observation.

Idempotence belongs to P_{+}. The expression c_{+}\circ c_{+} is not used when its codomain and domain do not match.

Commutativity and associativity follow from subspace sum on the declared domain. The dimension formula

is equivalent to

which gives the modular cost law whenever both partial outputs belong to their native carriers. Genealogy holds by the definition of the presented generator record under fusion. The absorber for subspace sum would be the ambient space, which is excluded as improper.

For page reflection x\mapsto-x, an invariant polynomial contains only even powers of x, giving \mathbb R[x^{2},y]. The real reflection group C_{3v}, acting as the dihedral group of order six, has polynomial invariants generated by r^{2}=x^{2}+y^{2} and \operatorname{Re}(z^{3})=x^{3}-3xy^{2}. The O(2)-invariant polynomials are radial and therefore polynomials in r^{2}. These are standard fixed-ring computations; see.

An orbit span decomposes into isotypic components and need not be irreducible. In particular, the span of a two-element chiral orbit under \mathbb Z/2 decomposes as trivial plus sign. The older claim that every orbit span is itself an irreducible chirality is superseded.

The tent, corner, and cone are geometric realizations of the relevant actions. They are not asserted to be literal models of every quotient space carrying the same group.

The page carries the reflection group \mathbb Z/2. A tent adds a second commuting reflection and realizes C_{2v}. A three-face corner realizes C_{3v}. A rotational cone carries an O(2) reading action.

These geometric carriers are interpretations of the strict syntax. The structural Mirror theorem itself is the recursive statement of Chapter; it does not depend on physically folding paper.

If n right face angles meet, strict convexity requires

Hence n<4, so n\le3.

At four right angles the angular defect is zero, so no strictly convex positive-curvature vertex forms. This does not imply that every defect-free fold is physically identical to an unfolded page; nontrivial flat-fold configurations may remain. Any dimensional interpretation of the bound is therefore an interpretation, not part of the convexity theorem.

Lawful scalar carriers on a reading surface \Sigma with reading group G are the G-fixed functions — equivalently, functions on \Sigma/G — and the fixed algebra (classically, the fixed algebra — the import named once here) is computed per action: for the page reflection, \mathbb R[x,y]^{\mathbb Z/2}=\mathbb R[x^{2},y] (height and squared offset); for the planar C_{3v} action, generators r^{2} and \operatorname{Re}(z^{3}); for O(2), \mathbb R[r^{2}]. The linear span of a G-orbit of marks decomposes isotypically and is in general reducible: the chiral pair's span is trivial \oplus sign. The narrative realization that follows (tent, corner, cone) is a family of geometric models of these actions, and its claims are read through this section.

For a real depressed quadratic

with D nonnegative, the two real roots may be read as one magnitude with two vertical orientations. If D is negative, the roots require the rotational complex carrier; the real page reading does not apply.

The generic cubic has Galois group S_{3}\cong C_{3v}. The corner therefore supplies a geometric realization of its permutation action. This is a classical group-theoretic fact together with a geometric interpretation; it is not a derivation of the cubic formula from the shape of a corner.

The separate subgroup picture S_{4}\supset S_{3} describes the stabilizer of one root. It is not the construction of the resolvent cubic.

The classical fixed-ring theorem gives

where e_1,\ldots,e_n are the elementary symmetric functions. Coefficients are therefore invariant functions of the roots. The present program reads solving as passage from the fixed coefficient data to a genealogy carrying individual roots. That reading is an interpretation of the classical theorem, not an additional representation theorem.

The discriminant detects collision of roots. At a repeated root the classical discriminant equals zero; under a presence interpretation, the positively presented data are the parameter and the collision certificate, while the failed distinction is a metalinguistic nonseparation judgment. No Blank term is substituted for the discriminant value inside the strict language.

If the group has such a composition series, the product of the orders of its factors is 2^{a}3^{b}. Conversely, Burnside's p^{\alpha}q^{\beta} theorem implies that every finite group of order 2^{a}3^{b} is solvable. Every composition factor of a finite solvable group is cyclic of prime order. Since only the primes 2 and 3 divide the group order, all factors are C_2 or C_3.

The generic quintic has Galois group S_{5}, whose composition series contains the nonabelian simple factor A_{5}. That factor is the decisive obstruction to solvability by radicals. The obstruction is not the prime five by itself: cyclic C_{5}-extensions are solvable by radicals.

Right-folding and radical solvability are therefore compared only as an explicitly defined structural analogy. Theorem classifies the right-folding family; classical Galois theory supplies the distinct A_{5} obstruction. No general equivalence between physical folding constructions and all radical towers is asserted.

This is the residue theorem under the displayed hypotheses. The presence interpretation concerns the roster of poles and their multiplicity records; it does not alter the classical theorem.

The contour-free-of-poles hypothesis and the residue-equals- multiplicity hypothesis are both essential. A merely meromorphic function is not automatically an admissible counting kernel.

Let \zeta_m=e^{2\pi i/m}. The degree-m factorization is

For presented l and away from the poles, the corresponding partial fraction identity in the n-variable is

At the pole n=\zeta_m^{\,j}l, the derivative of n^{m}-l^{m} is

The residue is therefore \zeta_m^{\,j}/(m l^{m-1}), which gives the displayed decomposition.

If one sheet is presented and labelled n_1, the deck orbit is generated genealogically:

This orbit supplies a local labelled roster only after a sheet label has been presented.

The digamma function \psi(w)=\Gamma'(w)/\Gamma(w) has simple poles at w=0,-1,-2,\ldots, each with residue -1. Consequently

has poles at

with positive unit residues in the z-variable.

Indeed, near z_0=\rho+k,

and hence

The sign depends on the variable. Statements that assign negative unit residues to this comb in the z-variable are superseded.

A covering map may have globally constant fiber cardinality while admitting no global labelled trivialization. Monodromy obstructs the latter, not the former.

For example,

has fiber cardinality two over every point. The classical degree is globally defined. Traversing the base circle exchanges the two local labels, so there is no global continuous enumeration preserving the chosen sheet identities.

The program calls a roster retaining witness identity a genealogical roster. Nontrivial monodromy may prevent such a global labelled roster even though the unlabeled cardinality remains constant. Two lawful responses are available: forget the labels and retain the degree, or pull back to a cover on which a trivialization is presented. Neither response licenses the claim that monodromy destroys global fiber cardinality.

This is a classical heat-kernel result under the stated smooth, bounded, planar, Euclidean, and Dirichlet hypotheses. Other dimensions, boundary conditions, corners, singular metrics, or non-Euclidean geometries require their own formulas.

Status by column. The geometric column is Theorem: lawful carriers on a reading surface are the fixed functions of the reading group, computed per action. The analytic column is the reflection metatheory of the strict grammar: involutivity (Theorem), preservation of well-formedness (Theorem), and renderer equivariance (Theorem). The arithmetic column is classical Galois theory, imported: the fixed field of the Galois group is the base field, and the fixed ring of the symmetric action on roots is the ring of coefficients. The identification of the three factorizations as one schema is the reading declared above; it is exact on every instance tabulated in this volume and is asserted at no greater strength.

The classical fixed-ring theorem of Chapter,

acquires its reading here. Coefficients are the mirror-coherent content of roots: a balance-form equation, which inscribes coefficients, is an achiral inscription, and solving it is a controlled descent into chirality. The moment an orientation glyph appears is the moment the notation reaches past the fixed component; a single root is never inscribable without exhibited orientation, only the achiral pair or an oriented member carried by \mathsf{Up}/\mathsf{Dn}. Solving is breaking mirror-coherence in a licensed way. Status: this is the fixed-ring theorem re-read as a statement about the language; the mathematics is classical, and the reading is the dagger reading applied to one instance.

The reading is a factorization schema, not a solvability equivalence. Theorem classifies the right-folding family, and classical Galois theory supplies the distinct A_{5} obstruction for the generic quintic; no general equivalence between physical folding constructions and radical solvability is asserted, exactly as the roots chapter records. The dagger reading survives that boundary because it never crossed it: what is identified is the pattern of keeping, not any transfer of solvability between columns.

In the classical register define

It is entire and satisfies

and

The standard analytic background is given in.

Let

For real t, \Xi(t) is real.

The symbol \uparrow is a judgment about the partial evaluation. It is not an element of \Ctimes, a third truth value, or an object-language term.

The certificate is positive data. The parameter is positive data. The withheld value is not converted into an object.

For all m,n\in T,

Thus no n\in T satisfies m\oplus n=m for every m.

Inspect the atom registry and the twelve constructors of Definition. No zero atom occurs, and no constructor introduces one. The result follows by closure of the term grammar.

This is a theorem about \GP. It is not a claim that \xi(s)=0 is ill formed in classical complex analysis.

Every term quantified over in this sentence is positive: the record, parameter, certificate, completed descent, and involution. Nonemission remains a metalanguage condition attached to the definition of the record.

The sentence quantifies over formed exit-locus records and uses only presented parameters, certificates, the mirror involution, and the symmetric balance relation. It requires no Blank control and no zero term.

Let

Then \sigma and \tau commute and generate

The fixed locus of \tau is the real axis, and the fixed locus of \sigma\tau is the critical line.

A generic orbit has four points:

An orbit on either fixed axis has at most two points. The orbit has one point only at s=1/2.

R1 says exactly that every classical zero of \xi has the form 1/2+it with real t, which is the critical-line statement. A point is fixed by s\mapsto1-\bar s exactly when its real part is 1/2, giving R2. A generic non-real off-axis point has a four-element Klein orbit. A non-real point has an orbit of size at most two precisely when it lies on the critical line. Real points also have orbits of size at most two, which is why R3 includes the separate classical fact that \xi has no real zeros.

Write

with u(t_0)\ne0. The factor (t-t_0)^m changes sign exactly when m is odd.

Sign-change detection is therefore not a fourth unconditional equivalence.

For every positive integer n, the pole of \Gamma(s/2) at s=-2n is cancelled by the classical zero of \zeta(s) there. The completed function is regular and

Thus the negative even zeros belong to the uncompleted zeta factorization and are not exit loci of the completed \xi. This is ordinary classical cancellation under the displayed normalization.

The foundational interpretation may describe the completion factor as an interface cost. The cancellation theorem itself remains a classical analytic fact.

The two sentences are not interchangeable.

Let \alpha_\zeta name the recorded adoption event

Let \mathsf{Exit}_{\xi}(s;c) be an arbitrary native exit-locus record for the completed descent fixed by the zeta reference interface. Instantiating \AdmZeta at that record yields

Since the record was arbitrary, universal introduction gives \RHMirror.

The theorem is intentionally transparent. Its content is that the native axis sentence follows from the explicitly adopted zeta-specific Admission law. It is not a derivation of that law from the unextended base theory, and it is not advertised as an unpriced classical proof.

The zeta-specific instance is fixed through three interpretive conditions:

This is the relevant application of Hamburger's converse theorem under its named hypotheses. The reference result is conditional on those analytic hypotheses; the glyph grammar alone does not establish them.

By Definition, the exit-locus records of the zeta-specific descent correspond to the classical zeros of \xi, and the native mirror axis corresponds to \operatorname{Re}s=1/2. Therefore the interpreted Admission law says exactly that every nontrivial classical zero lies on the critical line.

A second expression of the same classical price is Weil positivity. For the admissible test class in Weil's criterion, with the involution

the criterion has the form

Under the standard analytic hypotheses and normalization, Weil's criterion is equivalent to \RHClass. The criterion is a classical theorem used at the interface, not a consequence of reflection symmetry or the renderer.

The substitution s\mapsto1-s sends s-\tfrac12 to its negative, so it fixes (s-\tfrac12)^2 and hence F.

The root set is

which is closed under complex conjugation; consequently the coefficients are real and F(\bar s)=\overline{F(s)}.

One root is

whose real part is 4/5, not 1/2. The roots form a complete off-axis Klein-four orbit while satisfying both displayed symmetries.

The theorem identifies the precise limit of symmetry arguments. A zeta-specific proof obligation must use arithmetic or analytic information not shared by F, such as the prime genealogy, completed growth structure, or an equivalent Admission law.

An earlier development attempted to derive axis occupation from the junction algebra and the reflection symmetry alone: the spend-covering argument ran the algebra axiom by axiom against the completed function's reading group and concluded occupation from symmetry bookkeeping. The route fails, and the failure is exact: the polynomial witness of the controlling architecture, F(s)=((s-\tfrac12)^2-a^2)((s-\tfrac12)^2-\bar a^{\,2}) with a=\tfrac3{10}+7i, satisfies every symmetry the argument uses while carrying an off-axis quartet. The Symmetry No-Go above is the theorem this witness proves, and the repaired route is the one this part follows: class-wide relative independence, explicit adoption of \AdmZeta, and the native axis theorem in \Pdag. The development record of the attempted route is preserved in the project archive.

The theorem in this chapter concerns the native base theory \Pbase, not PA, ZFC, or another external proof theory.

The relevant descent fragment of \Pbase has:

The grammar and \mathsf{MJA}_2 modules receive one common interpretation in both models. The models differ only in the descent carrier. The independence theorem is relative to this exact many-sorted base.

Let the descents of Model A be the nonempty finite multisets of roots on the seam

closed under the required conjugation and fusion operations.

For

one has

Every term in \Phi_D(s) is therefore positive.

Sum the strictly positive displayed contribution over the nonempty finite root multiset.

Let Model B be generated under nonempty fusion by the Klein-symmetric quadruple

Evaluate at the presented rational point

The four real contributions are:

Using

their sum is

The descent D_B and the presented point s_0 witness the existential sentence, by the exact calculation above.

Model A is a model of the base theory in which \AdmClass holds. Model B is a model of the same base theory in which \CounterAdmClass holds. By soundness of the declared proof calculus for these interpretations, a sentence derivable from \Pbase must hold in every model of \Pbase. Model B therefore refutes derivability of \AdmClass, and Model A refutes derivability of \CounterAdmClass.

The displayed fraction can be checked directly in rational arithmetic. An accompanying script may reproduce it, but the script does not by itself verify:

No script execution is asserted by this TeX source.

Fix a decidable address sort and a decidable negative verifier. Write

when r is a positively presented rejecting trace for address w.

The metalanguage natural numbers in this definition index stages. They are not strict object-language numerals and do not install a zero term in \GP.

The premise of the rule is a presented completed object. It is stronger than separately stated stagewise availability. The formation-rule study behind this chapter is the corpus manuscript The Selection Jump.

The formation rules contain constructors for the three listed events. They contain no rule whose premise is merely \forall n\,\exists k_n\,\mathsf{Keep}(n,k_n) and whose conclusion is a selector or coherent family. Closure under the declared rules therefore leaves the stagewise statement without a family-forming derivation. The result is a theorem about this formation system, not a theorem that no external classical choice principle can be adopted.

Let K_\zeta be a name introduced at the metalanguage level for the completed family required by the witnessed omega semantics. The assertion includes the explicit adoption event

This is a completion postulate. It does not provide:

The sponsorship records occupation in the witnessed semantics, at exactly that strength.

Assume the named negative-channel interface: if an off-axis exit-locus record exists, then some finite address is accepted by the negative verifier; and a kept stage covering that address carries a rejecting trace incompatible with acceptance.

Suppose an off-axis exit-locus record were presented. By the negative-channel interface it yields an accepted finite address w. Choose a stage index exceeding w. The corresponding component of the sponsored coherent family contains a rejecting trace for w. Determinism of the verifier supplies a positive clash between the accepted and rejected traces. Hypothesis-discharging rejection therefore rejects the off-axis record. Since the record was arbitrary, the native axis sentence follows in the omega register.

This is not an analytic proof because the completed-family premise is an explicitly adopted completion postulate.

The two-model theorem concerns \AdmClass, not \AdmZeta. Its direct consequence is that the unextended native base does not select a side of the class-wide fork.

A separate arithmetic interpretation may assign a standard \Pi_1 sentence \varphi_{\mathrm{RH}} to the classical arithmetic shadow of the Riemann question.

If \varphi_{\mathrm{RH}} were false in the standard arithmetic interpretation, then \neg\varphi_{\mathrm{RH}} would be a true \Sigma_1 sentence with a finite standard witness. The declared \Sigma_1-completeness clause would give

contrary to the assumed independence. Therefore the arithmetic shadow is true.

The theorem establishes the standard arithmetic shadow only. A further coverage theorem is required before that truth is transferred to every formation admitted by the full presence foundation.

Under C_{\mathrm{cov}}, every relevant exit formation is in the image of the standard coding. The arithmetic truth excludes every coded counterexample, so coverage excludes every relevant counterexample.

Without coverage, a formation outside the image is not addressed by the arithmetic quantifier. No transfer follows for that formation.

The Sponsorship Declaration of \AdmZeta is a foundational act, and a foundational act invites the question of what makes it lawful rather than arbitrary. The answer is not an analogy to any historical foundational choice. It is a theorem about routes.

Four steps, each already proved.

Presence-only formation. The verdict language records positive presentations and contains no constructor for absence: no witness-not-found, no counterexample-not-seen, no checker-returned-nothing. Nonpresentation is therefore never converted into a present verdict. This is the no-free-sign theorem, and it is the grammar of this volume applied to sign formation itself.

Nullity of the selected architecture. Consider the enriched exact selected package of the completed zeta descent: exact finite negative channels, exact all-stage positive channels, trace predicates, and a \Pi_1 arithmetic representative. Every sound resolver that is fully invariant under replacement of one exact selected package by another is identically empty. Equivalent criteria are absorbed as fibres of one package, and absorption forms no verdict: availability of an exact criterion is not occupation of a sign. Criterion splitting, replay, arithmetization, realizer indexing, and finite-stage verification raise complexity without raising sign.

The forgetful boundary. A resolver is a-priori selected exactly when it factors through the map that discards package-specific coordinates while retaining exact selected structure. No sound sign selector factors through selected architecture alone. Consequently every sound route that does form a sign must expose the point at which it stops so factoring, and that point is an occupation, a derivation, a coordinate theorem, a stream, or an oracle. Every sound route is exposed.

The declaration is the exposure. The adoption recorded here is that exposed point, named in advance rather than discovered by audit. It constitutes the theory \Pdag=\Pbase+\AdmZeta, it carries a sponsor \alpha_\zeta, it is marked at its stratum, and its classical price is stated exactly by Interface Theorem. Every verdict it sponsors is formed carrying that trace, which is what formation means in this volume: every verdict here names what presented it, and that naming is the whole of what is sought.

The license follows. A route that forms a sign without exposing its non-invariant effect is convicted by the hypothesis-tethering theorem, which admits no untethered premise into a sign derivation. A route whose formation withholds every inscription is already absorbed into the maximal selected closure. There is no third class. The adopted law is therefore not one option among many equally available foundational choices: it is the disclosed form of the only kind of act that can form a sign at all, made visible at the moment of adoption instead of recovered later from a proof that quietly used it.

The declaration answers the independence theorem rather than evading it. That \AdmZeta is underivable from \Pbase is what makes a declaration the required act; a derivation would have made it superfluous, and a refutation would have made it unavailable.

The Riemann architecture has five positive components.

The Symmetry No-Go proves that reflection and functional-equation symmetry do not alone select the axis configuration.

Let g be a real even test function in the declared Weil class and define

with inverse convention

For a nontrivial classical zero \rho, write

On the Riemann hypothesis these parameters are real. Without that hypothesis the spectral side is read in complete Klein-symmetric quartet form.

Under the normalization used by the supplied ledger, the explicit formula is

The formula is classical and depends on its test-class and normalization hypotheses.

Moving the prime term to the other side gives a balance interpretation, but the signs remain those of the displayed classical formula. The phrase “four unsigned blocks” is not used.

The supplied source records numerical evaluations using a finite zero roster, a finite prime-power cutoff, and multiprecision arithmetic. Those evaluations are not analytic tail certificates.

The current assertion is limited to:

The ledger values are computations at their stated truncations, with the independent-precision stability information recorded by the underlying numerical artifact when such a comparison was actually performed.

The following remain:

No theorem in the assertion-of-record stratum uses the former unit-interval zero-count lemma or the former extremely small tail budgets.

For the reported Gaussian family

the supplied source records the following finite computations. The table is retained as numerical data at the stated truncations, not as a proof of global positivity.

The finite parameters reported by the supplied source were a roster of eighty positive ordinates, prime powers through 10^7, and multiprecision arithmetic. This TeX source does not claim that those parameters have been rerun or independently confirmed for the final distribution.

Because a Gaussian has full support, its prime bill is never grammatically absent merely because it is numerically small. The exact empty-bill statement belongs only to a compactly supported test whose support is contained in

For n\ge2,

which lies outside the open support interval.

The absence of a contributing term is stated here in the metalanguage. A renderer may display a withheld prime-bill slot as a diagnostic, but that display is not a strict empty object.

If all relevant spectral parameters are real and ordered by positive ordinate, then for the Gaussian family the finite spectral sum has leading behavior

as s_2 increases, provided the remaining terms are controlled so that their ratio to the first term tends to zero. This is a conditional asymptotic statement under the stated spectral and tail hypotheses. The displayed finite ratios in the table are numerical observations, not a completed proof of the global tail condition.

A one-parameter test family may reveal oscillation caused by a specified off-axis quartet, but absence of observed oscillation over a finite range does not exclude all off-axis configurations. Different contributions may be too small, lie beyond the tested scale, or partially mask one another. The proposed Faithfulness Detector is therefore exploratory and partial. It is not a decision procedure for the Riemann hypothesis.

Earlier source strata asserted a unit-interval zero-count lemma, spectral tails hundreds of orders below the displayed margins, and unconditional positivity of selected Gaussian rows. Those claims are not assertions of record. They require a repaired zero-count argument, verified constants, complete truncation accounting, and an outward-rounded interval rerun. Until those tasks are completed, the ledger remains.

Read under \mathsf D_{+}, the volume's principal results appear in the following forms, each a performed act or a presented object.

Formation of the flagship. The formation checker, run on the zero-normalized string, terminates in a fired rejection at the clause where an equation demands a formed term; the rejection certificate, with its trace, is the theorem. Refusals are events, and this one is performed.

Independence as two rejections. The reformed reductio runs twice. Assume a base derivation of class-wide Admission; soundness transports it into Model B, a presented finite object, where it meets the counter-inscription that B witnesses — a clash, exhibited in exact rationals — and the clash rule fires \mathrm{Reject}(\ulcorner \Pbase\vdash\AdmClass\urcorner;\kappa_B). Symmetrically through Model A for the counter-law. Two rejection inscriptions, each finite, each carrying its witness, jointly constitute the independence theorem in kept form.

Consistency as a presented model. Model B presents the base; Model A presents it again. A presented model is a positive consistency certificate, and the semantic route is the one this volume travels.

The record as roster. The emission ledger lists performed emissions, and the roster is the entire record. Sponsorship appears as a totality: every formed verdict names its presenter, and the presenters are exhausted by occupation, derivation, coordinate theorem, completed stream, oracle, and declaration.

A law is an act performed at every stage, not a stasis — the idiom convention says so, and under \mathsf D_{+} that sentence carries the resolution. The native axis law, spoken in kept form:

At every stage of the kept ledger there is a next stage, and the stage is kept: the ascent is performed, the keeping is witnessed, \mathrm{Keep}(n,k_n) with k_n\preceq k_{n+1} presented, stage by stage; the sponsored coherent family seals the ledger under the registered Omega-Seal rule; and the clash channel stands ready — a presented off-axis exit record meets the covering stage in a witnessed clash and fires a rejection.

That is the theorem in presence-only speech. It asserts acts: keeping performed at every stage, a family sponsored, a seal formed, a channel armed. Its verdict carries its sponsors — the stage witnesses, the family's declaration, the interface's price — and the carrying exhausts the verdict. What the classical register compresses into a quantifier over an open domain, the kept register performs, stage by verified stage, in exactly the posture this volume holds toward its one open axiom.

The same posture carries the limitative results. Universal claims over open domains are kept laws under \mathsf D_{+}: held stage by stage, each stage certified. Incompleteness itself appears in kept form as the ascent of the ledger — at every stage there is a next stage — which the omega chapter already formalizes as the refusal of the Selection Jump and the sponsorship of the seal.

Drafting audit, recorded in house style: an early exposition of this chapter summarized the survival roster with an absence idiom (“almost nothing dies”). The eliminability test convicted the phrase; the conviction fired; the repaired form is the roster above, which speaks of what each result becomes and of the machinery it lands on. The specimen is retained because it exhibits the discipline's edge: \mathsf D_{+} is kept the way every law here is kept, act by act, and its audits are among the acts.

the primes

For a cone rolled from a sector of share \rho of the full turn with slant height \ell, the base radius is r=\rho\ell and the height satisfies

For the prime shares \rho=1/p the normalized height x=h/\ell satisfies

with the tent case 4x^{2}=3 and the one-third case 9x^{2}=8. Status: the identities are exact elementary geometry and are asserted. Their reading — the third dimension of the folded page rooted, share by share, in the primes — is a declared reading in the sense of Chapter, and the fixed-function discipline governing what the folded forms may carry is Theorem.

With complementary radii r_{1}+r_{2}=\ell on a common slant, the heights satisfy

and

The di-cone volume stationarity polynomial factorizes exactly as

with the seam factor 2\rho-1 exhibiting the mirror-symmetric critical share and the sextic carrying the paired off-seam critical ratios. Status: the identities and the factorization are exact and asserted. The comparison of seam and off-seam occupations against a computed prime-fused field is a computed observation at its recorded truncations, and the silhouette reading built on it is open.

The reference question is whether the notation, held jointly, determines its intended object. Three categoricity clauses are proposed:

Status: these are proposed identification criteria. Their joint sufficiency is not a theorem of this volume. One external trial is on record — the blind reading of Chapter — in which the clauses' ingredients, jointly held, produced the intended identification by name; a trial supports and does not prove.

The critical strip may be read as a reflection orbifold and a self-convolution test as a mirror fusion. On the critical line a real spectral parameter contributes a nonnegative square-type Gaussian weight; an off-line pair contributes oscillatory terms of indefinite sign. Status: this is a heuristic frame, consistent with the classical Gaussian ledger of Chapter, and no positivity theorem is asserted from it.

The witness channel admits a decidable rejection judgment \mathsf{Rej}(w,r) and finite kept stages \mathsf{Keep}(n,k_{n}), assembled into coherent families K=(k_{n}). Status: the definitions are sound and retained. The historical witness-exhaustion claim is superseded; its corrected descendant is the omega-completion postulate and Selection Jump of the Riemann architecture, where the completed coherent family is explicitly sponsored rather than derived. The generator direction is retained with its recorded distinction: totality of a stage-extending verifier at each input is distinct from uniform production of a completed family, and only the former is claimed.

The stiffness field is

By the functional equation the appropriately completed field is odd about the critical line away from singularities; away from zeros and poles it is harmonic, and the minimum principle applies on compact subdomains with controlled boundary data. Status: these facts are classical, imported and exact. The historical unconditional positivity wedge and the kept-region assembly are open: they require exact lower bounds on the relevant boundary data and a verified zero roster below the cited height, and neither is asserted here.

Status: a scope statement at interface strength, with its classical input cited; it sharpens the target of the Admission law and leaves the law's status to the adoption that decides it.

Under the classical interface, the two admission filters correspond exactly: distinct genealogy to the functional-equation axiom, and prime-fused trace to the Euler-product axiom. The trace typing thus recovers the Selberg axioms from inside the calculus, and Admission over the class reads, classically, as the class-wide Riemann hypothesis. Status: the axiom recovery is a structural comparison at interface strength. The class-wide sentence of the present volume, \AdmClass, is this direction matured: the independence chapter separates it from its counter-inscription by finite models, so the class-wide hypothesis itself is neither asserted nor refuted here — that separation is the content of Theorem. The survey observation that every known off-axis family fails a filter is recorded at survey strength.

Candidate implications over the \mathsf{MJA}_{2} signature are triaged in order: well-formedness; survival in the blade model; survival against the polynomial witness; survival against the Davenport–Heilbronn descent; non-equivalence to Admission, with any candidate implying full-cone positivity set aside at conjecture strength. Survivors are conjecture-grade lemmas ranked by detector sensitivity. Status: the protocol is specified, and its filters now have exact instruments in the current stratum — the polynomial witness is the descent of Model B, and the genealogy filter is the Davenport–Heilbronn exclusion. No run is claimed.

The following problems are stated as mathematics. (1) Prove or refute the coverage theorem: that the standard analytic roster represents every exit-locus formation of the completed descent, i.e. C_{\mathrm{cov}} holds for \zeta. (2) Determine whether the di-cone sextic's paired critical ratios admit a spectral interpretation under the prime-fused field, and prove or refute the silhouette comparison at all truncations. (3) Prove the unconditional stiffness wedge: exhibit exact boundary bounds under which \Phi>0 on a right neighborhood of the line, or show no such bounds exist. (4) Extend the kernel formalization from \mathsf G_{\mathrm K} to the full strict grammar — eliminating the implementation blank variant, which the discipline of record excludes at every layer — and machine-check numeral canonicality. (5) Characterize the class for which the Selberg-axiom recovery of the trace typing is exact, and decide class-wide Admission for a nontrivial finitely axiomatized subclass. (6) Give a formation-faithful interpretation of a zero-based foundation into \Pdag and compute its price on the explicit-formula ledger. (7) Construct an admitting model of the referenced theory \Pbase+\mathrm{RefClauses} — a model of the reference clauses whose referent admits — or prove that the referenced theory does not derive \CounterAdmZeta by other means. Either, together with membership of the referent in the class and internalization of a finite contrary witness, yields \RHClass; with the converse adequacy of the analytic interpretation, the three statements \RHClass, non-derivability of \CounterAdmZeta over the referenced theory, and existence of an admitting model are equivalent. Model B separates the class-wide schema precisely by evading the reference clauses, so the proved class-wide theorem neither supplies nor is supplied by this instance; the two are related by an existential introduction in the easy direction only.

No Admission sentence is built into the base signature.

Both independence models use the same interpretation of the grammar and \mathsf{MJA}_2 modules. Their separation occurs only in the descent carrier.

The current mathematical proof of the separation requires only that the shared modules have at least one common model and that the descent axioms below are satisfied. A checker run or Lean theorem is not substituted for that model-theoretic requirement.

For a nonempty finite root multiset

define

and

Fusion is multiset concatenation. The field is evaluated away from the roots at presented rational points.

The Model A carrier consists of nonempty finite multisets of roots

on the seam, closed under the declared conjugation, mirror, and fusion operations.

For

one has

Hence

for every Model A descent and every presented conditioned point.

Model A satisfies \AdmClass.

The Model B carrier is generated under nonempty multiset fusion by

At

the four contributions are

Since

the exact sum is

The exact field value is machine-checked by the exact-rational script verify_independence.py supplied with the artifacts: the four terms evaluate to -5,\ -\tfrac{5}{2501},\ \tfrac{5}{2},\ \tfrac{5}{1252} and sum to -\tfrac{7821885}{3131252}<0.

Model B satisfies \CounterAdmClass.

Model A satisfies the class-wide Admission sentence. Model B satisfies its class-wide counter-inscription. Both interpret the declared base. Therefore

and

No zeta-specific or higher-cardinality coverage conclusion follows without another interface theorem.

The following listings reproduce the supplied Lean transcriptions. They are retained for inspection. The source of record in a final distribution is the separate .lean file, not this typeset copy.

The implementation datatype contains a variant named blank, for which the strict discipline of record has no counterpart at any layer. It also differs from the exact strict twelve-constructor inventory. Any successful kernel result is therefore scoped to \GK.

No compiler result or checksum is asserted by this transcription.

enumiv77

emmerson-buchanan-witness-fibres P. M. D. Emmerson and R. J. Buchanan, Riemann-Hypothesis Witness Fibres, Quantitative \Theta-Atlas \Xi-Certificates, Criterion Absorption, Nullity Matching, and Universal Selected Logical Nullity, Preprints.org (2026), DOI 10.20944/preprints202601.2410.v2. [Cited at the Sponsorship Declaration, the irresolvability–independence distinction, and the unification.]

emmerson-bellchsh P. Emmerson (Yaohushuason), Bell–CHSH Under Setting-Dependent Selection: Sharp Total-Variation Bounds and an Experimental Audit Protocol, Quantum Reports 8 (2026), no. 1, article 8, DOI 10.3390/quantum8010008.

emmerson-pv-ijqf P. Emmerson, Phenomenological Velocity and Bell–CHSH: Exceptional-Locus Semantics, Selection Simulations of -\cos, and a Microcausal Realization, International Journal of Quantum Foundations 12 (2026), no. 2, 210–247.

emmerson-buchanan-theta P. Emmerson (Yaohushuason) and R. J. Buchanan, Alternating Slices of the A_{2k-1} Theta Series (dataset), Zenodo, version v2, 9 July 2026, DOI 10.5281/zenodo.21265022. Version v1 published as Sigma-Adic Numerations (P. Emmerson), 27 March 2024, DOI 10.5281/zenodo.10888345; all versions: DOI 10.5281/zenodo.10888344.

emmerson-witness-fibres P. Emmerson, Riemann-Hypothesis Witness Fibres: Quantitative \Theta-Atlas \Xi-Certificates, Criterion Absorption, Nullity Matching, and Universal Selected-Logical Nullity (program manuscript). Archival identifier to be affixed at deposit; cited here as a program manuscript of this corpus.

emmerson-selected-irresolvability P. Emmerson, Maximal A-Priori Selected Irresolvability for the Riemann Hypothesis (program manuscript). Archival identifier to be affixed at deposit; cited here as a program manuscript of this corpus.

emmerson-selection-jump P. Emmerson, The Selection Jump (program manuscript; the formation-rule study of the omega chapter). Archival identifier to be affixed at deposit; cited here as a program manuscript of this corpus.

emmerson-badxi P. Emmerson, BadXi and the witness exclusion computations (program manuscript and computational record).

emmerson-witnessed-semantics P. Emmerson, Witnessed semantics for presence-only verdicts (program manuscript).

emmerson-org-mechanics P. Emmerson, Organizational Mechanics of Effective Cardinality Transitions (program manuscript).

emmerson-dicone P. Emmerson, The di-cone geometry papers (program manuscripts; the stationarity and seam analyses of the folded chapters).

emmerson-companion-ix P. Emmerson, Companion IX (program manuscript of the companion series).