Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedverified 2026-10-22 (gpt-6.1-sol)
How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

  • Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
  • AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
  • AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

Epsilon is stable-equivalence invariant but not a homomorphism

Statement

For the knot-level assertions, assume the Axiom of Countable Choice. Let K and J be smooth oriented knots, and use the epsilon sign convention from the preceding definition. If their knot Floer complexes are stably filtered equivalent, meaning that there are totally acyclic bifiltered complexes A and B with CFK∞(K)⊕A filtered-chain-homotopy equivalent to CFK∞(J)⊕B, then ϵ(K)=ϵ(J). The acyclic summands here need not be acyclic after taking either associated-graded filtration.

The invariant satisfies ϵ(−K)=−ϵ(K), ϵ(K)=0⇒τ(K)=0, and the tensor rules ϵ(K)=ϵ(J)⇒ϵ(K#J)=ϵ(K),ϵ(K)=0⇒ϵ(K#J)=ϵ(J). The converse of ϵ(K)=0⇒τ(K)=0 fails: the knot T2,5#−T4,5#T2,3;2,5 has τ=0 and ϵ=1, where Tp,q is the positive (p,q) torus knot and T2,3;2,5 is the (2,5) cable of the right-handed trefoil with longitudinal winding two. Epsilon is not an integer-valued homomorphism on the smooth concordance group: the right-handed trefoil has ϵ=1 and its connected sum with itself also has ϵ=1, not 2.

Facts & Assumptions

Given: The actual normalized finite free Maslov-graded bifiltered complexes of the knots, with the supplied geometric tensor and duality identifications. Every newly used finite operation below is over F2. Countable Choice is assumed for the knot-level constructions and geometric comparisons; finite algebra on the stated supplied complexes and maps requires no further choice.

[F1]

Epsilon from the filtered knot Floer complex defines Fs,Gs and epsilon. Its supplied two-hook argument proves the three cases are exhaustive and the two maps cannot both vanish.

[F2]

Knot Floer duality and exchange of the two filtrations supplies actual reverse-mirror duality, conjugation and normalized horizontal homology. The vertical and horizontal homologies at level zero are each one-dimensional, in Maslov degree zero.

[F3]

The filtered knot Floer complex of a connected sum is a tensor product supplies the actual normalized filtered tensor identification and additive vertical threshold; the finite field-complex Kunneth calculation also follows by splitting boundary pairs.

[F4]

Finite filtered splittings preserve the epsilon maps under total-acyclic stabilization supplies stable-core invariance of the vertical threshold and both hook-map zero patterns, allowing arbitrary totally acyclic stabilizers without assuming their vertical or associated-graded complexes acyclic.

[F5]

Grid homology is independent of the grid and computes knot Floer homology supplies the actual normalized grid comparison. In particular tilde homology is hat knot Floer homology tensored with V⊗(n−1), where V has degrees (0,0),(−1,−1). Its grid, differential, scalar and analytic suppliers are reused as proved interfaces.

[F6]

Valid codes reconstruct the declared link diagram identifies oriented decorated diagrams with the same signed rotation/strand code and selected outer face. Coprime torus knot fixes the positive Clifford-torus convention. The five-grid with O=[4,3,2,1,0] and X=[2,1,0,4,3] is identified with the positively oriented right-handed trefoil in step 1.4 below; its three crossing signs are all positive.

[F7]

The grid coordinate and orientation conventions are Toroidal grid diagrams and gradings for oriented knots; the finite signed visit, crossing-rotation and face-selector data are Planar-diagram, Gauss, and signed Dowker–Thistlethwaite codes.

Proof

1.1givenF1F4algebra

In the finite-rank free Maslov-graded knot Floer category, [F4] proves the stable-equivalence conclusion directly. Its finite endomorphism matrices strictify homotopy idempotents and give a unique non-acyclic indecomposable core up to filtered homotopy. The rank-one vertical homology of each original knot complex forces its internal acyclic complementary summands to have acyclic vertical complexes. Consequently its vertical threshold and the zero/nonzero patterns of Fτ,Gτ are precisely those of that core. Stable equivalence identifies the two cores even if the externally added acyclic summands have nonzero vertical or associated-graded homology. Thus the three-case epsilon values in [F1] agree. This argument does not apply the epsilon definition to the stabilized complexes themselves.

1.2givenF1constructalgebra

First reduce a finite based Laurent complex by explicit filtered contractions. If a differential coefficient preserves both coordinates, homogeneity makes it a single Laurent monomial; translate its target so that it is 1. Write da=b+r with a,b at the same bifiltration and replace b by b′=da. This is a filtered homogeneous basis change with inverse b=b′+r. For every other basis element c, subtract the coefficient of b′ in dc times a from c; this is filtered since the relevant copy of a has the coordinates of the corresponding copy of b′. The new differentials contain no b′, and their a coefficients vanish by d2=0. Thus the pair a→b′ splits off. Inclusion I, projection P and H(b′)=a, zero on all other generators, satisfy PI=1 and IP+1=dH+Hd, with H preserving both filtrations and of Maslov degree +1. Finitely many repetitions give a reduced complex with no equal-bifiltration arrow. Tensoring these identities with another complex preserves them: the extra differential terms cancel over F2. Dualizing likewise preserves them. This supplies all reduction inverse maps and homotopies used below, including their tensor compatibility.

1.3F6givenconstructalgebra

We next admit the actual complexes used for the geometric examples. Use the following marking-cell arrays, rows ordered bottom to top: for positive T2,5 take n=7, O=[6,5,4,3,2,1,0], X=[4,3,2,1,0,6,5]; for positive T4,5 take n=9, O=[8,7,6,5,4,3,2,1,0], X=[4,3,2,1,0,8,7,6,5]. The first has five positive crossings and oriented over/under word A+B−C+D−E+A−B+C−D+E−, where superscripts indicate over/under and all crossing signs are positive. The explicit positive torus curve (re2it,se5it), r=s=1/2, has this identical code in stereographic projection: its planar angle is 2t, radius r/(1−ssin⁡5t), height scos⁡5t/(1−ssin⁡5t), and crossing parameters t/(2π)=0,1/10,…,9/10. Equal projections force parameter difference π and sin⁡5t=0. At the overparameter the radial derivative is positive and at the underpartner negative, so the oriented crossing determinant is positive. The angular derivative is nonzero, and there are no triple points. Thus [F6] admits this grid as the actual positive T2,5.

1.4F6F7algebra

Verify the trefoil grid in [F6] directly. Use row indices 0,1,2,3,4 from bottom to top and column indices from left to right, as in Toroidal grid diagrams and gradings for oriented knots, and draw the standard planar grid realization using the in-square mark-to-mark intervals. Following the grid orientation gives the single cycle O0,4→X0,2→O2,2→X2,0→O4,0→X4,3→O1,3→X1,1→O3,1→X3,4→O0,4. The horizontal and vertical intervals meet away from their endpoints at exactly three crossings: c1=(row 1,column 2), c2=(row 2,column 1), and c3=(row 3,column 3). Traversing the component from O0,4 encounters c1 over, c2 under, c3 over, c1 under, c2 over, and c3 under. At c1 and c2 the oriented projected tangents (vover,vunder) are ((0,1),(−1,0)); at c3 they are ((0,−1),(1,0)). Each determinant is +1 by Planar-diagram, Gauss, and signed Dowker–Thistlethwaite codes. Thus its signed oriented Gauss code is 1O,2U,3O,1U,2O,3U with crossing-sign vector (+1,+1,+1). This code is also obtained by traversing the closure of the positive two-strand braid σ13: its first braid strand encounters the three positive half twists over, under, over, and the returning strand encounters them under, over, under. The signed visit data determine the same crossing rotation and strand code, hence identify the face-permutation cycles. Retain the grid diagram's outer-face cycle and choose the corresponding face of the braid-closure diagram. To make this chosen face outer, compactify the projection plane to the oriented sphere S2 and choose a point q in that face, away from the diagram. An orientation-preserving rotation of S2 sending q to the projection point at infinity makes precisely this face outer. Realize the diagram lift in a product collar of the equatorial S2 in S3; the rotation extends by the same rotation on the first three coordinates and the identity on the normal coordinate. Its path of rotations is an orientation-preserving ambient isotopy of S3 preserving the crossing heights and oriented strand data. The two resulting plane codes now have the same selected outer face, so Valid codes reconstruct the declared link diagram identifies their diagrams up to planar isotopy. Thus the original grid and braid closure represent the same oriented knot even if their initially chosen planar outer faces differ. The braid closure lies on the standard unknotted torus with slope 2α+3β (equivalently the swapped slope 3α+2β under the orientation-preserving torus-coordinate swap), so it is T(2,3) by Coprime torus knot. The grid therefore represents the right-handed trefoil with its positive orientation, and its writhe is +3.

2.1F1step 1.2constructalgebra

Let s=τ(C) and choose a Maslov-zero vertical cycle z at j≤s representing its distinguished class. Its corner part zc is nonzero, or the threshold would be smaller. If Fs=0, choose a Maslov-one northeast-hook chain b with dNb=zc and split it into strictly upper, corner and strictly right parts b+,b0,br. The strictly upper part of dvb+ is zero, since the other parts cannot reach it. Hence z′=z+dvb+ is another distinguished vertical cycle supported at j≤s. Put q=b0+br. Its horizontal boundary h=dhq has no strictly right component, and its corner is zc′, by the corner equation of dNb=zc. Then x=z′+hleft is supported in i≤0,j≤s, its vertical projection represents the distinguished class, and its horizontal projection is the boundary h. Conversely, if such an x has horizontal part dhq, project q to the northeast hook: its strictly left part cannot reach the corner or right ray, and the remaining boundary is precisely xc, with no upper component. Thus Fs=0. This proves the exact boundary-representative alternative, rather than assuming a simultaneous simplification theorem.

2.2F1F2step 1.2constructalgebra

The dual vertical threshold is −s. Indeed, if B is the vertical boundary space, the distinguished cycle z is not in B+V≤s−1, since such an expression would give a lower-level cycle representing it. Finite-dimensional basis extension gives a cocycle functional annihilating that subspace and taking z to 1; its dual filtration is at most −s. A dual cocycle at level at most −s−1 vanishes on every cycle at level s and hence on the one-dimensional vertical homology, so it is a dual boundary. The finite perfect pairing identifies the dual of the northeast hook at s with the southwest hook of C∗ at −s. The transpose of Fs(C) is G−s(C∗), and the transpose of Gs(C) is F−s(C∗): quotient/inclusion maps reverse under this pairing. Duality of finite-dimensional homology preserves zero/nonzero. Thus ϵ(C∗)=−ϵ(C); [F2] identifies this with ϵ(−K)=−ϵ(K).

2.3F6step 1.3constructalgebra

Following oriented strands in the nine-grid gives fifteen positive crossings and the full signed rotation/strand code of the closure of the four-strand positive word 121321321121321, after a cyclic starting-point change and reversal of the knot orientation. This is an explicit finite code equality: enumerate crossings in each row and column interval, then follow each row O→X and column X→O; on the braid follow the strand permutation through each listed crossing, taking the top-right strand over to bottom-left. The exact words and crossing correspondence are recorded in the finite certificate named in Remarks. Commutations 13=31 and braid relations 121=212, 232=323 give the successive words 123121321121321, 123123121121321, 123123121212321, 123123121213231, 123123121231231, 123123121231213, 123123121232123, 123123121323123, 123123123123123. Each is a local disjoint-strand isotopy or oriented R3, so their closures are equivalent. The last is (123)5. To identify its torus embedding, cut the Clifford curve (re4it,se5it) by the disk coordinate arg⁡(z1)=θ: its four disk points have arguments 5(θ+2πk)/4. A generic phase makes one quarter-turn's braid 132, which becomes 321 by moving the first generator past the closure cut, and then 123 by reversing the four disk positions via the half-turn conjugation. Five quarter-turns give the last closure. Finally simultaneous complex conjugation is an ambient SO(4) isotopy endpoint and sends this curve to its orientation reverse: rotate its two imaginary axes through π. Thus the code reversal preserves oriented knot type, and [F6] proves the actual positive T4,5 admission.

2.4F6step 1.4givenconstructalgebra

For the cable take n=10, O=[8,9,7,6,4,5,3,2,1,0], X=[4,5,2,3,0,1,8,9,6,7]. Here is an explicit preferred-framing admission independent of any Floer calculation. Double each row and column of the admitted positive trefoil five-grid in [F6]. At an old corner let h,v∈{±1} be the directions toward its horizontal and vertical partner. A diagonal two-mark block for hv=1 and an antidiagonal block for hv=−1 give exactly two crossing-free parallel corners; checking the four quadrants verifies this and the oriented attachments. Only at the O corner (row 0,column 4), where h=−1,v=1, use the opposite diagonal block. It introduces one crossing of sign hv=−1. The listed ten-grid is precisely these ten corner blocks, and its component cycle visits rows 0,4,9,2,7,1,5,8,3,6,0, hence it is one knot. Away from the exceptional block it follows two blackboard parallel copies of the trefoil. The blackboard longitude has linking number equal to writhe +3, so λbb=λpref+3μ. The one negative half-twist therefore gives slope 2λbb−μ=2λpref+5μ, with longitudinal orientation inherited from the original trefoil. This is exactly T2,3;2,5 in the Statement; it is not identified from a polynomial or a candidate matrix.

3.1F1step 1.2step 2.1constructalgebra

If Gs≠0, choose a Maslov-zero southwest-hook cycle mapping to the distinguished vertical class. In the reduced complex it is x=z+ℓ, with z on the lower vertical ray, including the corner, and ℓ strictly left at j=s. The two retained boundary equations are exactly dvz=0 and dh(zc+ℓ)=0: a lower ray cannot reach the other ray, and the corner has no equal-bifiltration differential. Conversely these two equations give a southwest-hook cycle mapping to the vertical class. Therefore Gs≠0 is exactly the existence of this simultaneous vertical/horizontal cycle representative. If also Fs≠0, its horizontal cycle is not a boundary, by step 2.1. Each constructed x extends to a homogeneous filtered Laurent basis: choose a nonzero original corner coordinate e, whose coefficient is 1, and replace e by x. Homogeneity excludes any other power of that same basis element, and all other terms are no higher in either filtration, so the inverse is the same filtered elementary substitution. These are the needed distinguished representative normal forms. A chosen horizontal noncycle alone is not used as an epsilon test.

3.2F5step 1.3step 2.3step 1.4step 2.4constructalgebra

Compute the tilde groups of these three new grids by the following finite exact procedure. Enumerate the n! state permutations p. For each ordered pair a≠b, take the positive cyclic row interval a→b and column interval p(a)→p(b). Its initial corners are southwest and northeast, and the two row orders give the two directed rectangles for each unordered pair. Retain the rectangle exactly when its cell support contains no O or X, and no state point lies in the product of its strict interior intervals. Its target swaps p(a),p(b); equal targets cancel over F2. Compute each state's degrees directly from MO=I(p,p)+I(O,O)−I(p,O)−I(O,p)+1 and A=(MO−MX−(n−1))/2. In a column, use the largest target permutation index as pivot. If that pivot has an existing stored column, take symmetric difference with it; otherwise store the column there. A replacement is an invertible field-column operation and strictly lowers the pivot, so distinct stored pivots give precisely the rank. For each grade, homology dimension is basis count minus outgoing rank minus incoming rank. The completed exact computation over all 5040, 362880, 3628800 states respectively gives tilde dimensions 320, 1792, 2560 and the graded polynomials recorded in Remarks. The implementation and full pivot checkpoints are finite arithmetic certificates of this explicit calculation; its square-zero input is the already supplied grid differential, not an unproved reconstruction theorem.

4.1F3step 1.2step 2.1step 3.1constructalgebra

Normalize Laurent bases at i=0. The vertical slice of C⊗D is the ordinary field tensor of the vertical slices, with differential dv⊗1+1⊗dv; no term lowering algebraic level can survive there. Similarly horizontal slices at levels s,t tensor to the horizontal slice at s+t. Splitting a finite field complex into boundary pairs and homology representatives proves the field Kunneth assertion directly: a boundary pair tensored with anything is contractible by its pair homotopy. In particular the tensor of distinguished vertical cycles represents the distinguished tensor class. Its threshold is s+t by [F3]. All representatives used in steps 2.1, 3.1 are supported southwest, so their vertical and horizontal projections tensor exactly to the projections of their tensor.

4.2F5step 1.2step 3.2constructalgebra

By [F5], divide only the tilde HOMOLOGY dimension polynomial by (1+m−1a−1)n−1. Its quotient is unique by successively subtracting the largest-Maslov nonzero monomial times this factor. For T2,5 the normalized hat degrees, each of rank one, are (M,A)=(0,2),(−1,1),(−2,0),(−3,−1),(−4,−2); for T4,5 they are (0,6),(−1,5),(−2,2),(−5,0),(−6,−2),(−11,−5),(−12,−6); for the cable they are (0,4),(−1,3),(−2,0),(−7,−3),(−8,−4). Now reduce the actual singly pointed CFK-infinity model supplied by [F5] using the contractions in step 1.2. Its Laurent basis at i=0 has exactly these reduced hat groups: every canceled equal-bifiltration pair is a graded boundary pair, and the reduced corner differential is zero. This step does not cancel V in a chain category or tensor homology through a nonflat quotient.

5.1F1F2F3step 2.1step 3.1step 2.2step 4.1constructalgebra

If both epsilon values are 1, choose the boundary representatives of step 2.1. Both horizontal parts are cycles; if xh=dha, then (x⊗y)h=dh(a⊗yh). Its vertical part is the distinguished tensor class, so the converse in step 2.1 gives Fs+t=0, and epsilon of the tensor is 1. The same proof works when one factor has epsilon zero and the other has epsilon 1, using a cycle representative from step 3.1 for the zero factor. If both factors have epsilon zero, tensor their southwest-hook lifts to obtain Gs+t≠0. Their duals also have epsilon zero by step 2.2; applying the same lift construction to the dual tensor gives its G−(s+t)≠0, hence Fs+t≠0 on the original tensor. Its epsilon is therefore zero. Dualizing the already proved positive cases proves the negative/negative and zero/negative cases. Together with [F3], these are exactly both tensor rules in the Statement, with actual representatives and compatible homotopies.

5.2step 4.2constructalgebra

These exact degree profiles determine the full differential; no general inference from hat ranks to a full staircase is needed. List their generators in the displayed order as e0,e1,…. A possible term Ukej in dei must satisfy k=(Mj−Mi+1)/2∈Z≥0 and Aj−k≤Ai. Exhausting these inequalities gives the following COMPLETE lists, with v(i,j) denoting coefficient 1 and h(i,j;k) coefficient Uk preserving horizontal level. For T2,5: v(0,1),v(1,2),v(2,3),v(3,4) and h(1,0;1),h(2,1;1),h(3,2;1),h(4,3;1). For T4,5: v(0,1),v(1,2),v(3,4),v(5,6) and h(1,0;1),h(3,2;2),h(5,4;3),h(6,5;1). For the cable: v(0,1),v(1,2),v(3,4) and h(1,0;1),h(3,2;3),h(4,3;1). Every allowed arrow is axial; there is no diagonal term. Homogeneity fixes each monomial, and its remaining coefficient is zero or one.

6.1F2step 1.2step 4.2step 5.2constructalgebra

The normalized vertical homology in [F2] is one-dimensional in Maslov degree zero. Thus the only degree-zero candidate e0 survives and v(0,1)=0. In the first list, absence of degree −1 homology forces v(1,2)=1, square-zero forces v(2,3)=0, and absence of degree −3 homology forces v(3,4)=1. In the other lists the remaining disjoint vertical pairs must all be present. At horizontal level zero use generators UAiei, whose Maslov degrees are Mi−2Ai, the reverse displayed vertical list. The same normalized argument from the opposite end forces every odd-to-previous-even horizontal coefficient to be 1 and all listed reverse arrows to be zero. Hence the ACTUAL reduced complexes are T2,5:de1=Ue0+e2, de3=Ue2+e4; T4,5:de1=Ue0+e2, de3=U2e2+e4, de5=U3e4+e6; cable: de1=Ue0+e2, de3=U3e2+e4. All even differentials vanish, so these matrices square to zero. The reductions already supply filtered inverse maps and homotopies. This proves the three geometric staircase admissions with all scalar factors handled, without any L-space or unproved cabling/reconstruction theorem.

6.2F1F2F5F6step 5.1step 3.2step 5.2constructalgebra

For the right-handed trefoil, reuse the geometric five-grid admission in [F6] and perform the new, previously missing 120-state tilde-rank operation of step 3.2. Its tilde dimension is 48; division of its graded homology polynomial by the supplied V4 factor gives degrees (0,1),(−1,0),(−2,−1), each rank one. The inequalities in step 5.2 allow only v(0,1),v(1,2),h(1,0;1),h(2,1;1). Normalized vertical and horizontal degree-zero homology forces exactly dx1=Ux0+x2, with even differentials zero. At s=τ=1, the northeast-hook boundary of U−1x1 is x0, since U−1x2 lies below its retained horizontal ray. Thus F1=0 and ϵ(T2,3)=1 for the actual admitted knot complex. Step 5.1 gives ϵ(T2,3#T2,3)=1, whereas any integer homomorphism taking the trefoil to 1 would take its double to 2. Hence epsilon is not an integer homomorphism on the concordance group. This is failure of additivity under connected sum; it uses no missing theorem identifying concordant complexes.

7.1F1F2F3step 6.1constructalgebra

Write A,B,C for the actual staircases of T2,5,T4,5,T2,3;2,5 just admitted, and let ai,bi,ci denote their bases, with bi now dual to the T4,5 basis. The vertical thresholds are 2,−6,4, so [F3] gives threshold zero for E=A⊗B∗⊗C. Its distinguished vertical class is a0b0c0 at (M,A)=(0,0). In its northeast hook the Maslov-one chain q=U−1a0b0c1+a0b2c1+U−1a1b2c2 is supported at (i,j)=(1,0),(0,3),(1,0). Its three boundaries, after discarding terms outside the hook, are respectively a0b0c0+a0b1c1, a0b1c1+a0b2c2, and a0b2c2. Here db0=Ub1, db2=b1+U2b3. The discarded terms from the first boundary have (i,j)=(1,−3); those from the second have i=−1 or −2; those from the third have (i,j)=(1,−1),(1,−3) or i=−1. Thus dNq=a0b0c0 exactly. Consequently F0(E)=0 and ϵ(E)=1 by [F1]. The actual tensor and reverse-mirror identifications [F2]–[F3] now give precisely the knot T2,5#−T4,5#T2,3;2,5 in the Statement, with τ=2−6+4=0 and epsilon 1. The previously completed 175-generator calculation supplies the identical finite boundary certificate; it has not been rerun or used as a substitute for the geometric admissions.

8.1givenF1F2constructalgebra∎

The implication ϵ=0⇒τ=0 uses the normalized horizontal homology supplied by [F2]. Set s=τ and use Gs≠0 to choose a Maslov-zero southwest-hook cycle y=z+ℓ mapping to the normalized vertical class, where z is on the lower vertical ray and ℓ is strictly left at j=s. Homogeneity is available by projecting a preimage to Maslov degree zero. Its horizontal projection h=zc+ℓ, with zc its corner part, is a horizontal cycle. If it were a horizontal boundary, write a bounding chain as a++a−, splitting strictly right support from support at i≤0. The right component of its boundary is zero; the corner is zc=(∂a+)c+(∂a−)c. In the northeast hook, the chain a++(a−)c then has boundary exactly zc: the left part of a− cannot reach the corner, and differential from the corner toward the left is killed in that hook. But Fs([z]) is represented by zc, so this would give Fs=0, contrary to ϵ=0. Thus h is a nonzero horizontal homology class in Maslov degree zero. Multiplication by Us takes it to horizontal level zero and Maslov degree −2s. Actual normalized conjugation [F2] identifies that horizontal homology with the vertical homology generated in Maslov degree zero, giving s=0. The geometric conjugation and absolute normalization used here are supplied by [F2]; thus this implication no longer has a separate conjugation hold.

Remarks

The new exact finite admission evidence is under research/inverse-problems-knot-theory-all-109-2026-10-19-supervision-20261020/epsilon/: new-torus-grid-code-result.json and torus45-braid-certificate.json give the new oriented geometric code certificates; positive-cable-grid.json gives every cable marking block and preferred-framing construction; grid-tilde-ranks.cpp, the four .input files, completed .checkpoint.bin carriers and .result.json files give the finite tilde-rank computation; normalized-hat-ranks.json, trefoil-new-profile.json and allowed-edge-reconstruction.json give the exact reconstruction data. The earlier staircase-hook-result.json records the already completed three-term tensor-boundary computation. These are arithmetic and geometric authoring evidence, not native independent-review or certification receipts.

The stable-core and geometric grid/tensor/duality suppliers are reused as supplied interfaces; no repaired source was reread or revalidated for this completion. Concordance descent still uses the separate geometric stable-slice/concordance result. It is not inferred from the finite algebra here.

Depends on

Used by

Dependency tree · two levels

64 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources