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.
Statement
The magnitude homology of a graph obtained by gluing two cycle graphs along single edges to a single cycle graph 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
Projects
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.
Interest
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
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.
NEW
Problem: Reconstructed statement. Work in finite simple undirected graphs with the usual shortest-path metric and integral magnitude homology . Let have cyclic vertices . Attach two copies of to by identifying one edge of each triangle with an edge of . If the two chosen edges of are not opposite—i.e. they are adjacent; and, if same-edge attachment is allowed, possibly equal—then the resulting graph is diagonal:
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 is a projecting decomposition, then Hepworth–Willerton’s Mayer–Vietoris sequence gives a split exact sequence
Hence, if are diagonal, then is diagonal.
First, , , and are diagonal. For and , every nondegenerate -path has length . Also , so diagonality follows from the magnitude-homology Künneth theorem.
Let the first triangle be attached along edge . Let . The decomposition
is projecting: the intersection is the edge , and projects to by sending , , and fixing . Thus is diagonal.
Now attach the second triangle along an adjacent edge, say . The decomposition
is projecting: the intersection is , and projects to by
where is the apex of the first triangle, while are fixed. The distance identities are immediate:
Therefore Mayer–Vietoris again implies 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
a join, hence diagonal by Hepworth–Willerton’s join theorem. Then decompose the whole graph as along the common edge; since projects to that edge, Mayer–Vietoris again gives diagonality.
Thus in every non-opposite case,
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 checkNo person has reviewed this attempt. 1 machine check below — a machine check is not human verification.
Machine check · not human verification
machine: correctscope 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. 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 endorsementsNo 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
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.