Answers are grounded in this paper and cite their sources.
Give each vertex i of a graph a complex vector space V_i, place a tensor W_ij in V_i ⊗ V_j on each edge, and sum the tensor products of these edge tensors over all perfect matchings. We study the image of this matching-tensor map and the recovery of the edge tensors from its output. For every support graph with a perfect matching and all local dimensions at least three, the image closure has dimension N_* - |E_*| + dim P(G) + 1, where E_* is the set of edges lying in some perfect matching, N_* is the number of parameters on those edges and P(G) is the perfect matching polytope; on those edges the generic differential kernel consists of the edge rescalings that preserve every matching term. For complete support at every even order at least four and all local dimensions at least three, the entire fibre over a general output is a single vertex-rescaling orbit, and a normalized representative is a rational function of the output. The proof recovers cofactor lines from tangent spaces and glues lower-order representations, allowing vanishing cofactors. For complete support at every even order at least six, the dimension formula and the vertex-rescaling kernel remain valid when the local dimensions are only two. At four vertices we determine the dimension in every format with local dimensions at least two. Files. paper.pdf is the manuscript, revision 4 (25 pages). paper.tex is its LaTeX source. The other ten files are the contents of the directory verification/ that the paper refers to: five standard-library Python programs (verify_qubit_certificates.py, verify_qubit_from_matchings.py, check_graph.py, independent_rank_check.py, verify_four.py) and five JSON files holding their certificates and recorded results. The SHA-256 values of the five programs are printed in the final section of the paper. To run the programs, keep the ten files together in one folder. Prior work. Earlier results are credited in Section 1 and in the references of the paper. Disclosure. AI systems from OpenAI, working under the direction of the person who publishes as Ignoramus, developed the statements and proofs, performed the computations and wrote the first three versions; each version was reviewed by Claude (Anthropic), also an AI system, and the edits of this fourth version were written and checked by Claude agents. The final section of the paper sets this out in full. No AI system is an author; the author publishes under a pseudonym. The author has not checked the proofs, and no human mathematician has checked the manuscript. Two determinant computations in one proof can be replayed with the accompanying programs; the remaining arguments are analytic. The AI reviews are not human refereeing, peer review or a certification of originality, and novelty and significance are not established. The manuscript is a draft for mathematical review. Corrections are welcome at ignoramus110926@gmail.com.
No takes yet. Share an insight, caveat, or question.
Ignoramus (2026) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: