Appendix B Computation Scripts, Computations 204 to 216
Computation 204 · §19.2.1 · [PROOF]
The cancellation of Computation 203 proved, and the sawtooth in closed form.
Both shifts move the degree by , so the degree-dependent Bergman factors cancel and with , a finite product. Writing , , with a function of , the logarithm’s expansion in is a finite Taylor expansion: the terms cancel at first order (), the first-order sums are above and below, and the second-order term is , equation (277). Verified symbolically (exact series, symbolic) for to , the general- first-order identity checked as a closed sum, and the coefficient verified in exact rational arithmetic at every residue of for , the residual falling as . The coefficient is times : negative when the lattice point sits at the continuum maximiser, at the ends of ’s range, so the deficit changes sign along the sawtooth. Why it cancels: first-order stationarity at an interior maximum; an displacement of leaves the term zero, a displacement proportional to moves the limit itself below , and at the maximiser is the corner , where stationarity fails and keeps its .
Computation 205 · §15.10 · [EMPIRICAL]
The confrontation: three readings of the modal cutoff against the LHC, two excluded by enormous margins, the third consistent and predicting.
The computation the book said had not been performed. Scope, v32.153: the first measurement in the bin R3 names, ATLAS’s boosted on Run 2 plus partial Run 3 [234], gives above GeV a Run 2 deficit and a combined upper limit of times the Standard Model at confidence, a limit and not the measurement that would exclude R3; the exposure stands untested. The readings: R1, a momentum cutoff above which no field mode exists; R2, the projection’s Gaussian kernel on every vertex; R3, the kernel on the Higgs doublet alone, every vertex with a doublet leg carrying it in the momenta of its legs, gauge and fermion vertices carrying none. The data, all ATLAS at TeV: inclusive jets to TeV and dijets to TeV with NNLO QCD [217]; dileptons above TeV, observed against expected, highest at TeV, contact-interaction limits of to TeV (constructive) and to TeV (destructive) [218]; , [219]; [220]; boosted limits of fb above GeV and fb above TeV against and fb [221]; same-sign at fb [222]. (1) R1 predicts zero events above TeV: excluded at probability zero to every decimal. (2) R2 multiplies the Drell–Yan yield at TeV by , so expected dielectron events become against observed (); linearised, it is a contact interaction with to TeV by chirality against limits of to TeV, short by a factor to in ; the data require a universal kernel at or above. (3) R3: coupling modifiers shift by percent ( and from the measurements); Higgs production suppressed by , , , above , , GeV, invisible at present precision; ; with the whole doublet carrying the kernel the longitudinal cancellation is preserved, whereas a kernel on the physical alone breaks at TeV; every loop of the Higgs self-energy has a doublet vertex, so the naturalness result stands, and what is given up is finiteness of loops that never touch the condensate. (4) Predictions: a percent deficit above GeV and percent above TeV in the Higgs spectrum, percent in Higgs pairs, modifiers within half a percent of one. (5) Computation 10 revisited: its TeV predates the correction and its Wilsonian reading is R2; its structural argument is R3. Tampers: a universal kernel at passes the dilepton limits, so the exclusion is about the scale; under R3 a kernel at would put the GeV bin at of the Standard Model, which the measurement disfavours, so R3 is falsifiable.
Computation 206 · §19.2.1 · [NUMERICAL]
The two-monomial deficit to : no plateau, so the per- constant of Computations 157 and 203 is a value, not a limit.
Before an analytic route to the bridge’s constant is attempted, this file asks whether the number is a limit. Computation 157’s chain reduction with the weights vectorised, every chain scanned at and a refined window around the extrapolated extremal chain above it. (1) The deficit times rises monotonically through : , , , , , at and , , , , , at for to , increments per doubling of and that shrink only slowly; run offline to the values are and . The data do not decide between a limit approached logarithmically and a term of order . (2) The commutator’s extremal chain moves, its start at to () and to (), towards but not at the single-shift maximiser’s position; the tamper evaluating the norm on that maximiser’s chain falls short by a growing margin. (3) The symbol’s deficit moves the other way, to at from to , crossing the exact value, so the symbol route to a closed form is closed. (4) Every value computed lies below the certified at ; the uniform bound holds on every point, and whether it holds as for fixed is exactly what is left open, so the closure rate of Lemma 7 is established up to a possible logarithm. Settled by Computation 213: the value is a limit approached from below as , and the limit is in closed form.
Computation 207 · §20.6 · [SURROGATE]
The spectral dimension of the projected geometry: it rises between the grain and the coherence length, sits at four above , and never reaches two.
The configuration-space walk of the Boolean Dirichlet form, one flip per unit of Mosco time, pushed to by the A4 displacement covariance, has an exact return probability at resolution : a Binomial mixture over the number of odd-flipped bits of chi-square tails. Carlip’s is read off it for up to , with the cubic lattice at the same rate as the fixed-valency control. (1) The Mosco plateau is there: on a window of whose top end grows with ( to for to , the ratio per quadrupling tending to four). (2) At , the resolution at which distinguishes points, the curve rises from zero to a maximum of and settles at four, an overshoot below the lattice’s own : no rise. (3) At the grain it rises through four at to at , a few coherence lengths, and settles at four by ; the height is a logarithm of the resolution, per -fold, unbounded for exact return, where the bare hypercube’s is recovered. The mechanism is the causal set one: a first step in any of directions makes the return probability fall exponentially until the diffusion has spread past the resolution. (4) The lattice’s overshoot is bounded and resolution-independent, so the rise is the unbounded-valency signature; reduction to two appears in neither model. Tamper: a deterministic number of flipped bits removes the not-moved term and the rise with it. Stands in for: the emergence-determined realisation, by Gaussian i.i.d. displacements with the A4 covariance; and , by a flat Euclidean bulk.
Computation 208 · §18.1 · [SURROGATE]
The realised cloud as a sprinkling: PST’s discreteness passes the Lorentz-invariance theorem exactly when the realised positions are independent, which A3 must supply beyond the density.
Bombelli, Henson and Sorkin [225] prove that a Poisson sprinkling selects no frame and carries no finite-valency Lorentz-invariant graph. The theorem’s hypothesis is a Poisson process with the invariant volume as intensity; PST’s cloud has the invariant volume as density by A2 and A3, and is unchanged by the Wick rotation, so the Riemannian and Lorentzian processes coincide. What A2’s weak equidistribution does not fix is independence, and the file shows the gap on the i.i.d. surrogate in a diamond against a lattice of the same size. (1) Both pass A2 at the same rate. (2) The index of dispersion of cell counts separates them, against . (3) The cloud’s counts in boosted blocks of equal volume keep their mean and dispersion at rapidities to ; the lattice’s dispersion moves from to with the boost. The cloud’s causal links fill rapidity flatly over on a range that widens with ; the lattice’s pile up along its own null directions. (4) The cloud’s links per element grow like ( to for to ), the finite-valency clause and the mechanism of Computation 207. (5) agrees in both signatures. Tamper: a lattice jittered by of its spacing passes A2 and still fails. So the theorem applies to PST exactly when the realised positions are independent: true by construction for the surrogate, and for the emergence-determined cloud one more thing P3’s typicality must deliver (Computation 132: no -channel forces the placement). Scope, from Computation 211: the independence is what the maximum-entropy clause means once read as a law on the realised cloud, and the rate leaves it intact at the grain. Stands in for: the emergence-determined realisation, by the i.i.d. uniform cloud of Computation 70.
Computation 209 · §18.1 · [NUMERICAL]
The classical-scaling placement of the signed-tension metric has no Euclidean geometry, so the independence of realised positions cannot be tested on it.
The natural test of Computation 208’s condition is the one explicit placement the book has: classical scaling of eq. (30) on -typical directions i.i.d. on , , a low quantile. With the Gram form is, at leading order, times the centred Gram matrix of the directions: negative of rank seven. (1) At to the seven most negative eigenvalues of grow in proportion to and match that multiple of the direction Gram eigenvalues, the eighth an order of magnitude smaller. (2) The largest positive eigenvalue grows like : the Euclidean side is noise and no cloud emerges. (3) The index of dispersion read on the positive-side coordinates is and for i.i.d. directions and and for a design evened on the sphere until its nearest-neighbour spread is instead of : the test cannot tell them apart. (4) Control: with the sign of flipped the seven eigenvalues turn positive, the positions become a function of each site’s own direction, and the evened design reads against . Tamper: a cut above the bulk of the tensions reverses the signal, so the sign is set by which side of the cut the bulk sits on; eq. (30) puts it on the spacelike side, the negative case. The placement is the quantitative form of the remark in §4.12 that the Gram construction cannot supply the signature: it supplies seven negative directions, not one. The condition of Computation 208 stays P3’s, with this placement ruled out as its instrument.
Computation 210 · §20.6 · [NUMERICAL]
The spectral dimension on the book’s own bridged model: three between the truncation and the compact scale, zero below the truncation, no rise.
Computation 207 was computed on the surrogate. This file computes the same quantity on Computation 9’s bridge: Walsh weight mapped to degree on , eigenvalue , the binomial multiplicity absorbed into the measure so that degree carries , truncated at where the mode counts match. (1) between about and the compact scale for to ( to ), the lower end falling as ; the maximum is to . (2) Below the truncation falls to zero: reduction, no rise, no two. (3) With the binomial multiplicity kept instead of reweighted, rises above three to , , , for to : the rise of Computation 207 is carried by the Walsh modes the bridge absorbs into the measure. Tamper: without the truncation the curve is the exact one. So on the book’s model the projected geometry’s spectral dimension is the Mosco value above and reduction below it; the rise between the grain and is seen by a probe of the substrate’s walk, not of the emergent geometry.
Computation 211 · §18.1 · [NUMERICAL]
Maximum entropy supplies the independence: the realised cloud is a sprinkling at the grain, and A3’s rate touches only the scales above the constraint.
Computation 208 named independence of the realised positions as one more thing P3’s typicality must deliver; Computation 209 showed the explicit placement cannot test it. This file tests the clause itself, read as a law on the realised cloud. (1) The theorem: among laws of labelled positions with the same one-point marginals the product law has the largest entropy, with equality iff the positions are independent, so maximum entropy given the density is independence; verified exactly on cells and points over : the labelled-cloud entropy is at and strictly below it on both sides, and the dispersion there is the binomial . (2) The constrained cloud: the maximum-entropy law under A3’s rate is the product law conditioned on the constraint set; sampled in the diamond (, the eight lowest Fourier modes held to with half and a tenth of the i.i.d. scale , thirty clouds each, greedy descent then Metropolis within the set), the index of dispersion is one to within at every cell size up to and to in boosted small cells at rapidities to , and falls only towards the constraint’s half-wavelength (cell : , , ; the first is the binomial ). The constraint makes the cloud hyperuniform at the Mosco scale and leaves it Poisson at the grain. (3) The causal links of a constrained cloud carry the sprinkling’s signature: links per element, rapidities flat to within a factor over . Tampers: a jittered lattice passes the same constraint six times inside the tight with dispersion at the grain and boost-dependent counts (, , ), so the rate alone gives neither independence nor the absence of a frame; and the tight conditioning moves of points and still leaves the grain at one. What this changes: B.7 closes on P3’s footing; the fibres of (B.6) are a thinning of this cloud, which preserves the Poisson property.
Computation 212 · §19.9.2 · [NUMERICAL]
What a point carries and what a device is, on the theory’s own measure: fibres hold at most seven properties and are singletons almost surely, and no device of four or more properties is a substrate accident.
Two remarks shared a cause: B.6 left the fibres of unsaid, and the device accident rates of Computation 156 were computed against a uniform null because PST fixed no measure over configurations. Since Computation 141 and Computation 211 it does: directions i.i.d. under the -invariant law. (1) A fibre is a clique of pairwise-null properties ( means exactly), and any -invariant pair tension is a function of the angle alone, so when it is injective a fibre is a set of unit vectors in with one pairwise inner product ; its Gram matrix has rank for and does not embed in beyond . So a fibre holds at most seven properties when and at most when the null angle is more obtuse (two at the quantile of the pair tensions, three at , seven at the median); constructed at for nine values of (residual ) and failing at ; in eight, so the seven is . At the Rankin bound the clique’s net tension vanishes exactly: a maximal fibre is a balanced sub-configuration. (2) Under a continuous law on directions an exact coincidence has probability zero: no pair lands on it in replicas up to , and the nearest approach falls like , so fibres are singletons almost surely and A1 reads as the point count. (3) Computation 156’s device criterion on this measure, at two placements of , replicas of and of : every nearest-neighbour pair qualifies, a triple in at most a few percent of replicas, nothing of four or more at either placement, where the uniform null gave , , at sizes three to five. Tampers: a planted compact device of four is found in of replicas (the two misses have a background point inside the planted separation), so the zeros are the measure’s and not the detector’s. What this changes: B.6 closes, fibres being singletons -almost surely and at most seven in every case; the caveat on the accident rates closes the other way, the theory’s own measure being sharper than the null; what stays is Computation 156’s: why has clusters at all is -contingent, and the bound state’s dynamics is inherited.
Computation 213 · §19.2.1 · [NUMERICAL]
The two-monomial bridge constant is a limit after all: in closed form, approached from below as through the Airy edge of the bridge’s own chain.
Computation 206 followed the deficit times to and saw no plateau. This file finds the constant and why it was invisible. The deficit times is the sum of three terms, (an identity holding to at every point computed): is the weights’ term, the two chains’ symbol maxima against , and , are the zero-point energies of the commutator’s and the bridge’s extremal chains below their symbols. (1) converges to a closed form from the expansion of the Bergman weight, along a chain of degree and slope , plus a drift term for the commutator because the hopping couples neighbouring lattice points: at , measured from on; without the drift term . (2) The commutator’s symbol has an interior maximum in at (), so its extremal chain is the one through the corner , starting at , the position Computation 206’s chain was drifting towards; along it the potential is quadratic, the eigenvector a harmonic ground state of width , and , confirmed to by moving the truncation to so the chain has no wall. With the wall the eigenvector keeps a distance from it and the excess decays like (ratios per doubling , against the law’s , ). (3) The bridge’s diagonal chain has fixed and a potential rising monotonically to the truncation, so its eigenvector is an Airy function pressed against the hard edge: with in closed form from the first zero of , at against the measured to , falling towards it. This is the Airy edge, and it sits on the bridge’s own norm rather than on the commutator’s. So the deficit times is with : at , at , at , approached from below, which is why no plateau was visible: at the value is still short, and Computation 206’s increments are the Airy term’s decay minus the wall term’s, at . Over : every to closes with Computation 59’s ; for and below the certified for every ; its envelope grows like , crossing at , where the asymptotic regime needs beyond . Tampers: the drift term dropped, the Neumann Airy zero in place of the Dirichlet one (a coefficient times too small) and a half-well zero point (three times too large) are each rejected.
Computation 214 · §19.2.1 · [NUMERICAL]
The sharp value in closed form: an algebraic number at the operative corner , and why that corner is the maximum.
The one quantitative thread Computation 213 left: the sharp value sits in the small-headroom regime close to that the asymptotic laws do not cover. Write ; the lower shift acts on and the upper on , so every chain has at most points and is an algebraic function of . At the operative corner the headroom grows with ; the only with are () and (). (1) At both extremal chains are the diagonal (the commutator’s drift towards is a large- effect), the weights are exact rationals, and the two matrices have the characteristic polynomials of (275); is the root in of a degree- integer polynomial obtained by eliminating and from Lemma 5(c)’s closure , so is an explicit algebraic number, inside Computation 203’s enclosure and equal to the float evaluator to . (2) At fixed the map is single-humped with the hump where the two monomials are comparable and its top rising with (, , , , at for to ); the integer lattice samples those curves at few points, and is the only one with and on a hump ( percent below the top), sharing that headroom with far down the tail (). Larger gives higher humps but larger means larger and larger headroom. (3) Rescanned over every chain for and (offline; the script rescans , ): the maximum of is at , then at , at ; with Computation 213’s limits (below for ) the supremum over the operative regime at is derived at its maximiser and scanned elsewhere. Tampers: the commutator on the chain through gives ; the other real closure root gives ; moved by moves by . No analytic mechanism sets the value: it is the one point where a headroom of four meets a balanced bridge.
Computation 215 · §19.9.2 · [NUMERICAL]
The native sector cannot build an apparatus: Derrick’s scaling on P3’s functional, and the regulated lattice at PST’s own discreteness, three orders below pinning.
The apparatus question’s sharper half: could the theory’s own field, the order parameter of P3 with the functional (1), hold a localised object at all? (1) Derrick’s scaling: for a static localised configuration in three dimensions with , has energy , strictly decreasing in , so every localised configuration lowers its energy by shrinking and the only static finite-energy solution is the vacuum; evaluated on a dip, a bubble of the other vacuum and a ring. (2) On the regulated lattice (Computation 200) the shrinking stops at the spacing, so a localised object could survive only by pinning, which needs the discreteness large: PST’s is with the grain and exactly with the coherence length . Gradient flow of the lattice energy at from four localised initial data (bubbles of radius and , a Gaussian dip, a single flipped site) relaxes every one to the vacuum; by bisection a flipped site persists only for and a four-grain bubble only for , which PST undercuts by three orders with the grain and by factors and with . (3) The loophole named: the theory has oscillons, localised oscillations keeping half their core energy for to periods (a radial simulation to ); in PST’s units a period is s and the core a few , a breather of the order parameter lasting s, not an apparatus. Tampers: at twice the threshold the flipped site persists; with the potential’s sign flipped Derrick’s acquires a stationary point; a one-dimensional kink survives the same flow, so the theorem is dimensional. What this changes: “inherited” is forced, not chosen: an apparatus is a bound state of the inherited matter sector, realised in as a cluster that (30) reads as a device (Computation 156); which clusters has stays the configuration’s content.
Computation 216 · §19.9.3 · [NUMERICAL]
The black-hole interior on the theory’s current lengths, and the central singularity dissolved by the fibre bound.
(A) Computation 154 evaluated the validity condition on Schwarzschild with nm, the Casimir bound of its day, and the chapter printed those values after moved to am (Computation 201). Re-evaluated: at a solar-mass horizon, pm , enclosing of the interior volume, a mass floor of kg; on the grain : , pm, kg, the floor the chapter already had. Every conclusion of Computation 154 survives by wider margins; nm reproduces every printed number (tamper), so the discrepancy was the length alone. The uncovered region holds about grains. (B) The initial-singularity argument the book declined to transfer is made in a different form. A point is a fibre of , a clique of pairwise-null properties holding at most seven (Computation 212), so the realised content of a collapsing body, properties, cannot occupy one point: some pair fails to be null, and its proper distance is the region’s diameter. How far from null that pair must be is a packing bound: Rankin (some pair has ) and Welch (among unit vectors in some pair has ), evaluated with Computation 212’s exemplar tension at its two placements of beside the best configurations a descent on the sphere finds. At the median placement seven properties can be exactly null (an orthonormal frame) and eight cannot (Welch’s , attained by the simplex), the deviation growing with (, , , , at , , , , ); at the obtuse placement only two can, Rankin attained at and . In the proper distance a region holding properties has diameter at least () to () at the median and to at the obtuse placement, in the exemplar’s units, and the single-pair distance saturates at , the local character of (30). What this changes: the chapter’s numbers move to the current lengths; the singularity as a point carrying the collapsed content is excluded on the substrate side with the strength of the fibre result and no more; what replaces it, a region whose minimal diameter the bounds give in local units and whose dynamics the projected equations do not reach, the theory does not describe. The statistical entropy, the information question and the horizon’s status are untouched.