Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedPipeline-generatedjudge pass (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.

A multiple of a fork surface has a closed compact replacement

Statement

For every fork F there is a class in H2(C~) represented by an immersed closed surface Σ~2(F) that agrees with (1−q)2(1+qt)Σ~(F) outside a small neighbourhood of the two tine punctures. Consequently the paired intersection ⟨N,F⟩ is independent of the escape-to-infinity behaviour of the non-compact surfaces Σ~(N) and Σ~(F).

Facts & Assumptions

Given: a fork F with tine endpoints pi,pj, its surface Σ~(F) and a noodle N of Forks, noodles and the LKB intersection pairing; the two-variable covering homomorphism Φ and the LKB cover.

[F1]

Long exact sequence of a pair supplies, for the pair (C~,U~), the exact sequence H2(C~)→j∗H2(C~,U~)→∂H1(U~) of Λ-modules.

[F2]

A relative class has a finite chain representative whose boundary is in the relative subspace (Relative singular homology); finite homotopies give the prism boundary identity (The singular chain homotopy formula).

Proof

1.1givenconstruct

Let ν(pi),ν(pj)⊂D be disjoint closed disks with ν(pk)∩P={pk} for k=i,j, and let U={{x,y}∈C:x∈ν(pi)∪ν(pj) or y∈ν(pi)∪ν(pj)}⊂C. Fix a basepoint u0={u1,u2} with u1∈ν(pi) and u2∈ν(pj), choose a lift u~0 of u0 in C~, and let U~ be the preimage of U. The component containing the chosen lift is a covering space, and π1(U~,u~0) is the kernel of the restriction of Φ to π1(U,u0), viewed inside π1(U,u0) through the inclusion U↪C. The surface Σ~(F) has both tine coordinates in a neighbourhood of pi or of pj near its boundary, so it represents a class [Σ~(F)]∈H2(C~,U~).

1.2givenconstruct

Using the arcs of Bigelow 2001 Figure 2, define elements of π1(U,u0) by a1={γ1,u2},a2={u1,γ2},b1={α1,β1β2β3}{α2α3,u1},b2={α1α2α3,β1}{u2,β2β3}, where γ1 is a loop in ν(pi)∖{pi} based at u1 enclosing pi once counterclockwise, γ2 is the analogous loop in ν(pj)∖{pj}, and α1,α2,α3, β1,β2,β3 are the six displayed corridor pieces: α1α2α3 runs from u1 to u2 along one shore of the tine neighborhood, and β1β2β3 runs from u2 to u1 along the other. The first and last pieces stay inside their endpoint disks; the middle pieces are disjoint corridors outside the punctures. In each braced path pair one coordinate remains in an endpoint disk while the other uses the corridor, so every stage lies in U. Their total puncture windings are zero and their mutual half-twist exponents are1, giving Φ(b1)=Φ(b2)=t; also Φ(a1)=Φ(a2)=q. Thus Φ(π1(U))=Z2 and the full preimage U~ is connected. The following relations hold in π1(U,u0): [a1,a2]=1,[a1,b1a1b1]=1,[a2,b2a2b2]=1.(2,3,4) The first is immediate because γ1 and γ2 can be representatives of the two coordinates supported in disjoint disks. For the second, b1a1b1 is equal in π1(U,u0) to {u1,δ}, where δ is a curve based at u2 which passes counterclockwise around pi and u1; the third relation follows by the same argument with the roles of the two coordinates interchanged.

2.1step 1.2algebra

Define elements of π1(U~,u~0) by a=a2−1a1,b=b2−1b1,c=a1−1b1−1a1b1,d=a2−1b2−1a2b2, where conjugates xy=y−1xy of elements of π1(U~,u~0) by elements y∈π1(U,u0) again lie in π1(U~,u~0). Rewriting the defining words in terms of a1,a2,b1,b2 gives the following relations in π1(U~,u~0): aa1=a,cb1a1c=1,db2a2d=1,dbab1=aba1c.(5,6,7,8) Indeed, the first three translate into relations (2)–(4), and the fourth translates into a trivial identity.

3.1step 2.1algebra

For x∈π1(U~,u~0) let [x] denote its image in H1(U~). Since conjugation by y∈π1(U,u0) acts on the kernel of Φ by the deck transformation Φ(y)−1, one has [xy]=Φ(y)−1[x]. Applying this to relations (5)–(8) gives (q−1−1)[a]=0,(q−1t−1+1)[c]=0,(q−1t−1+1)[d]=0,(q−1−1)[b]=(t−1−1)[a]−[c]+[d]. Multiplying the last relation by (u−1)(uv+1) with u=q−1, v=t−1 annihilates the [a],[c],[d] terms by the first three relations, and the left side is u3v (1−q)2(1+qt)[b]; since u3v is a unit, (1−q)2(1+qt)[b]=0.(*)

4.1step 3.1F1F2construct

The boundary map of the pair sends [Σ~(F)] to [b]: the boundary of the lifted surface in U~ is the loop represented by b, as read off from the arc decomposition defining b1 and b2. By (∗), the class (1−q)2(1+qt)[Σ~(F)] lies in the kernel of ∂; exactness of the sequence of [F1] therefore produces [Σ~2(F)]∈H2(C~) with j∗[Σ~2(F)]=(1−q)2(1+qt)[Σ~(F)]in H2(C~,U~). Representing this class by an immersed surface in general position with respect to the boundary, one may take Σ~2(F) to agree with (1−q)2(1+qt)Σ~(F) outside the open set U~ and to be closed and compact inside C~; this is the claimed class. It may be taken away from the disk boundary: the filled tine images are compact inside the disk, so choose an outer radial collar disjoint from them and from the two puncture disks. Its inward injective compression fixes the fork chain, preserves U because its near-puncture coordinate is fixed, and moves any remaining capping part off the boundary; [F2] keeps the absolute class unchanged.

5.1step 4.1construct

Let N be a noodle and choose the disks ν(pi),ν(pj) so small that N∩(ν(pi)∪ν(pj))=∅; this is possible because N is compact and disjoint from P. Then Σ~(N) is disjoint from U~, so all its intersections with Σ~(F) and with Σ~2(F) occur outside U~, where the two surfaces agree up to the factor (1−q)2(1+qt). Write ΔF=(1−q)2(1+qt)=∑hnhh as a finite sum of deck monomials. Outside U~ the closed chain equals ∑hnhhΣ~(F). Every translated noodle misses U~. Translation invariance of intersection therefore gives ∑g(gΣ~(N)⋅Σ~2(F))g=∑hnh∑g((h−1g)Σ~(N)⋅Σ~(F))g=ΔF⟨N,F⟩. The coefficient at a single g is a convolution of the fork intersection counts; multiplication by ΔF applies to the full Laurent sum, rather than to each integer count. The left-hand sum is finite without a generic assertion about noncompact translates. The compact replacement has projection with a positive minimum collision distance. Uniform continuity of the compact noodle lets us truncate its triangle by a common positive parameter gap, capturing every possible intersection for every deck translate. That one lifted truncated triangle is compact. Two compact sets in a regular covering meet in only finitely many relative deck positions, by a finite evenly-covered-chart argument.

6.1F1F2step 4.1step 5.1algebraconstruct∎

The diagram polynomial is homologically determined. The truncated noodle is a relative cycle in (C~,∂C~∪ν~ε), not boundary-only homology. Choose ε small enough to miss the compact replacement and any compact chain bounding a homologous replacement; choose all first-argument chains away from the disk boundary using the collar of step 4.1. The oriented boundary identity for transverse finite chains then makes their intersection counts invariant: the end and boundary terms miss the other argument, and a compact one-chain has total signed boundary zero. The finite prism compares homologous noodle truncations in the same way. Differences between two closing choices come from H2(U~) by [F1], and have no intersections with any translated noodle because its projection avoids U. For isotopies choose U disjoint from the entire compact noodle trace and truncate the fork ends uniformly; [F2] gives the same relative-chain comparison. Thus the right side of step 5.1 is invariant. The nonzero factor (1−q)2(1+qt) cancels in the Laurent domain, proving the original finite fork/noodle polynomial is independent of these choices and of escape behavior. No intersection of two classes approaching the same collision end has been asserted.

Depends on

Used by

Dependency tree · two levels

18 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