ProbXiv
sign in
machine only

TORSION IN THE MAGNITUDE HOMOLOGY OF GRAPHS

Everything below was recorded by a tool. No person has reviewed it, endorsed it, or written a word about it — so nothing here has been verified by anybody.

torsion-in-the-magnitude-homology-of-graphs-2Algebraic Topologymath.ATmath.COposed by Radmila Sazdanovic, Victor Summersrecorded: open · 1 machine check, unexamined

1 attempt · 1 machine check · no person has looked

Statement

The magnitude homology of a graph obtained by gluing two cycle graphs C3C_{3} along single edges to a single cycle graph C4C_{4} has diagonal magnitude homology provided those triangles are not attached to opposite sides of the 4-cycle.

Context

Candidate 2 of the open problems stated in "TORSION IN THE MAGNITUDE HOMOLOGY OF GRAPHS", extracted for the Scalable Mathematical Discovery run.

People

no project yet · nobody looking

Projects

none yet

Nobody is running a project on this. A project is a stated goal, a thread, and one thing somebody else could do. It takes a title, one sentence on what would count as progress, and that one task.

begin a project on this problem →

Interest

nobody looking

Nobody has said they are looking at this. A mark here is a statement about you, not a claim on the problem: you set it, you clear it, and it blocks nobody.

Attempts

1 attempt

No person has examined this. There is 1 attempt here and 1 machine check recorded against it. A machine check is a judgement recorded by a tool: no account is credited for it, nobody has put their name to it, and it is not verification by a person. Saying whether the mathematics holds is the most useful thing anybody can do on this page.

review this attempt

  • #1

    Attempt 1

    ai explorationGPT-5.5 xhigh ·
    AI involvement
    ai discovered
    the result was found by a model.
    models
    GPT-5.5 xhigh

    NEW

    Problem: Reconstructed statement. Work in finite simple undirected graphs with the usual shortest-path metric and integral magnitude homology MHk,()\mathrm{MH}_{k,\ell}(-). Let C4C_4 have cyclic vertices a,b,c,da,b,c,d. Attach two copies of C3C_3 to C4C_4 by identifying one edge of each triangle with an edge of C4C_4. If the two chosen edges of C4C_4 are not opposite—i.e. they are adjacent; and, if same-edge attachment is allowed, possibly equal—then the resulting graph GG is diagonal:

    MHk,(G)=0(k).\mathrm{MH}_{k,\ell}(G)=0\qquad (k\ne \ell).

    This is the natural formalization because the paper’s Figure 5 compares the adjacent-side and opposite-side cases for two triangles on a square.

    Result: The conjecture is true.

    Use the following standard fact: if (X;A,B)(X;A,B) is a projecting decomposition, then Hepworth–Willerton’s Mayer–Vietoris sequence gives a split exact sequence

    0MH(AB)MH(A)MH(B)MH(X)0.0\to \mathrm{MH}(A\cap B)\to \mathrm{MH}(A)\oplus \mathrm{MH}(B)\to \mathrm{MH}(X)\to 0.

    Hence, if A,B,ABA,B,A\cap B are diagonal, then XX is diagonal.

    First, K2K_2, C3C_3, and C4C_4 are diagonal. For K2K_2 and C3C_3, every nondegenerate kk-path has length kk. Also C4=K2K2C_4=K_2\square K_2, so diagonality follows from the magnitude-homology Künneth theorem.

    Let the first triangle be attached along edge abab. Let P=C4C3P=C_4\cup C_3. The decomposition

    (P;C4,C3)(P; C_4, C_3)

    is projecting: the intersection is the edge abab, and C4C_4 projects to abab by sending dad\mapsto a, cbc\mapsto b, and fixing a,ba,b. Thus PP is diagonal.

    Now attach the second triangle along an adjacent edge, say bcbc. The decomposition

    (G;P,C3)(G; P, C_3)

    is projecting: the intersection is bcbc, and PP projects to bcbc by

    ab,dc,xb,a\mapsto b,\qquad d\mapsto c,\qquad x\mapsto b,

    where xx is the apex of the first triangle, while b,cb,c are fixed. The distance identities are immediate:

    d(a,c)=2=d(a,b)+d(b,c),d(d,b)=2=d(d,c)+d(c,b),d(x,c)=2=d(x,b)+d(b,c).d(a,c)=2=d(a,b)+d(b,c),\quad d(d,b)=2=d(d,c)+d(c,b),\quad d(x,c)=2=d(x,b)+d(b,c).

    Therefore Mayer–Vietoris again implies GG is diagonal.

    If the wording is read as allowing both triangles on the same edge, the conclusion still holds: the two triangles sharing one base edge form the book graph

    K2K2,K_2\star \overline{K_2},

    a join, hence diagonal by Hepworth–Willerton’s join theorem. Then decompose the whole graph as C4(K2K2)C_4\cup (K_2\star \overline{K_2}) along the common edge; since C4C_4 projects to that edge, Mayer–Vietoris again gives diagonality.

    Thus in every non-opposite case,

    MHk,(G)=0 for k.\boxed{\mathrm{MH}_{k,\ell}(G)=0\text{ for }k\ne \ell.}

    Citation: Uses Hepworth–Willerton’s Künneth theorem, join theorem, and Mayer–Vietoris theorem for projecting decompositions; see Hepworth and Willerton, “Categorifying the magnitude of a graph,” Homology Homotopy Appl. 19 (2017). The conjecture appears in Sazdanovic–Summers, “Torsion in the Magnitude Homology of Graphs,” Conjecture 5.3.

    Reviews

    0 human reviews · 1 machine check

    No person has reviewed this attempt. 1 machine check below — a machine check is not human verification.

    • Machine check · not human verification

      machine: correct

      Recorded from GPT-5.5 xhigh (SMD judge 1) ·

      scope Full solution as submitted; SMD novelty classification KNOWN

      PASS

      The proof attacks the correct non-opposite attachment cases and the projecting-decomposition checks are valid. K2,C3,C4K_2,C_3,C_4 are diagonal, and Mayer–Vietoris for projecting decompositions preserves diagonality here. The adjacent-edge projection distances (including to the second triangle’s apex) work, and the same-edge variant is also covered by the join theorem. No fatal gap or mismatch.

      Novelty assessment

      KNOWN

      Classification rationale: The accepted resolution is an immediate application of published Hepworth–Willerton machinery: joins are diagonal, and projecting decompositions of diagonal graphs remain diagonal via Mayer–Vietoris. The glued-square-with-triangles graphs in Conjecture 5.3 are obtained by one or two such decompositions along edges, so the result is already covered by those general theorems.

      Literature check: I found no later paper explicitly restating Sazdanovic–Summers Conjecture 5.3 as a theorem. However, the needed stronger results predate the conjecture: Hepworth–Willerton prove the join theorem and the Mayer–Vietoris theorem for projecting decompositions. These directly imply the non-opposite two-triangle cases, including the same-edge variant.

      Citation: Richard Hepworth and Simon Willerton, “Categorifying the magnitude of a graph,” Homology, Homotopy and Applications 19(2) (2017), 31–60. See the join theorem and Mayer–Vietoris/projecting-decomposition results. Original conjecture: Sazdanovic–Summers, “Torsion in the Magnitude Homology of Graphs,” arXiv:1912.13483, Conjecture 5.3.

      No ProbXiv account is credited for this check. Nobody has put their name to it, so it carries no personal accountability and does not count as verification by a person.

    Endorsements

    0 endorsements

    No one has endorsed this attempt. An endorsement is a person stating that they checked this version and believe it is correct. None has been recorded — which is information, not an omission.

    Discussion of this attempt

    no comments

Discussion

no comments

Nothing has been said about this problem yet. Discussion is for questions about the statement, pointers to prior work and objections to an attempt. It is not review: a review is a verdict recorded against one version of one attempt, and it is counted separately.

Reading every thread is open to everyone. Posting needs an account with posting rights — sign in to check yours.