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.
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.
Tensor networks provide descriptions of strongly correlated quantum systems based on an underlying entanglement structure given by a graph of entangled states along the edges that identify the indices of the local tensors to be contracted. Considering a more general setting, where entangled states on edges are replaced by multipartite entangled states on faces, allows us to employ the geometric properties of multipartite entanglement in order to obtain representations in terms of superpositions of tensor network states with smaller effective dimension, leading to computational savings.
Unrefereed AI-assisted preprint, version 0.2.2, 9 October 2026. No author affiliation is given. For each m >= 1, set q = m^2 + m + 1. Attach q intermediate vertices to a root and q - 1 leaves to each intermediate vertex. This produces infinitely many pairwise nonisomorphic non-star trees of order q^2 + 1, with root Laplacian spectral support {0, m^2 + 1, (m + 1)^2 + 1}. The symbolic argument establishes Laplacian peak state transfer at time pi from the root to an intermediate vertex for odd m and to a leaf for even m, addressing Open Problem 7.1 of Coutinho, Guo and Schmeits, arXiv:2505.11986v4. The ten-vertex m = 1 member is their known Figure 10 example. Phase alignment is an application of their Lemma 5.2 and Corollary 5.3; the general peak-time classification follows their Theorem 5.4 and Corollary 5.5. The contribution presented here is the explicit infinite family and its spectral coefficients, targets and gcd calculation. For the specified pairs, all positive peak times are odd multiples of pi/g, where g = 5 when m = 2 mod 5 and otherwise g = 1. Novelty and priority are not certified. Peak transfer means attaining the mutual-projector absolute-sum bound, not unit amplitude. The probabilities tend to zero along both parity subsequences. This does not establish perfect transfer, efficient long-distance quantum communication or a classification of all trees. Exact standard-library reruns check actual full-tree Laplacians for m = 1..5, quotients for m = 1..1000, and gcd/phase regressions for m = 1..10000. Those finite checks support, not replace, the symbolic all-parameter proof and the analytic all-real-time Bezout argument. No complete Lean or other proof-assistant verification is supplied. 本研究は、清水竣平が個人の自主研究として企画・進行した、AIを活用した数学探索です。清水は探索方針の指示、検証の手配、成果の取りまとめを担当しました。証明の構成、計算による検証、原稿作成の大部分にはAIを使用しています。検証方法とその範囲は本文に記載しており、人間の専門家による査読は未実施です。 This work is an AI-assisted mathematical exploration initiated and coordinated by Shunpei Shimizu as a personal independent research project. Shimizu directed the exploration, arranged verification, and compiled the results. AI systems performed most proof construction, computational checking, and manuscript preparation. The verification methods and their scope are documented in the manuscript. The work has not received specialist human peer review. The submitter has not independently certified every mathematical step. Separate AI analyses and implementations are not human refereeing. No cited-author or institutional endorsement is implied. Read peak_trees_en_v0.2.2.tex first. The current package is Quantum_peak_trees_publication_v0.2.2_20261009.zip; QUANTUM_TREES_README_PUBLICATION_v0.2.2_EN.md explains its contents. Version 0.2.2 removes author affiliation; mathematical text, equations, statements, proofs and verification programs are unchanged from version 0.2.1. The current package omits old manuscript sources and old full ZIPs. Earlier verification records retain their original dates; they are not human peer review. The built-in LaTeX compiler failed at Windows environment setup before TeX diagnostics. No PDF has been generated or visually verified; editable TeX and exact-check code are supplied. Documentation clarification, 10 October 2026. The retained README_EN.txt and README_JA.md are historical documentation; the corresponding preserved v0.1.0 copies describe the 8 October 2026 working draft. QUANTUM_TREES_README_PUBLICATION_v0.2.1_EN.md describes the superseded v0.2.1 package. Their source names, payload inventories, draft-status statements and no-Publish instructions are dated history, not the current record state or operative instructions. Independent checks in those documents mean separate AI analyses or implementations, not human refereeing. The current entrypoints are peak_trees_en_v0.2.2.tex, Quantum_peak_trees_publication_v0.2.2_20261009.zip and QUANTUM_TREES_README_PUBLICATION_v0.2.2_EN.md. Refer to the current TeX for the argument where historical checker comments mention an absent review.md. This notice makes no change to the mathematical manuscript or verification programs. Publication packaging clarification, 10 October 2026. In addition to the three historical READMEs identified above, the two QUANTUM_TREES_ATTRIBUTION_AI_ROLE_ADDENDUM files and novelty_attribution_math_monitor_review_20261009.zip are dated supplementary review records. The r1 addendum and the current v0.2.2 manuscript give the operative author and AI contribution disclosure. The novelty archive also compares other manuscripts; those comparisons are context, not additional results of this Quantum record. Earlier private-save and no-publication instructions describe past workflow only. Current scientific claims are the explicitly stated tree-family construction and specified-pair peak times. No mathematical content, verification program or frozen historical attachment is changed by this clarification.
Status. Partial results only. The note studies, without answering it, the question of Yang, Leung and Tang (Linear Algebra Appl. 503 (2016), Question 3.9): is there an indecomposable 2-positive linear map M_3 → M_4? Dually: can a PPT state of a qutrit and a ququart (C^3 ⊗ C^4) have Schmidt number three? Proved. (1) A 2-block-positive operator on C^3 ⊗ C^4 that vanishes on one nonzero product vector is decomposable, so a witness for Schmidt number three among PPT states would have to be strictly positive on all product vectors. (2) For min(M,N) ≥ 2, the range of every PPT state on C^M ⊗ C^N is spanned by its vectors of Schmidt rank at most min(M,N) − 1; hence no range-only test that is valid for all positive operators can show full Schmidt number for a PPT state. (3) With a lemma of Chen, Yang and Tang: every non-extreme PPT state of birank (6,6) on C^3 ⊗ C^4, and every positive operator on C^3 ⊗ C^N of operator Schmidt rank at most seven, has a separable compression to a two-dimensional local subspace, hence Schmidt number at most two. (4) The maps proposed by C. A. Winda (J. Linear Topol. Algebra 14 (2025) 129–136) as indecomposable 2-positive maps M_3 → M_4 are not 2-positive. Open. A birank-(6,6) counterexample would have to be an extreme edge state with product-free kernels and operator Schmidt rank eight or nine. Numerically, every state tested (42 states covering all ten relevant birank classes) has a separable two-dimensional compression; the note describes where the proof attempts for birank (6,6) stopped. Files. ppt-3x4.pdf is the note. ppt-3x4-supplement.zip contains the statements, proofs and blind reviews of the results as written, the exact computation for the Winda maps, the numerical data and scripts (including exact rational birank-(6,6) edge states with separable compressions), the record of failed proof routes, and the unreviewed working files. "python check.py" (NumPy and SymPy) verifies the hashes and repeats the exact and numerical checks (a few seconds on the laptop used to assemble the archive). The written proofs have not yet been verified line by line by a human reviewer. AI tools. The author chose the question and the statements to attack, set the working rules (blind review of every result by the other model family; fixed stopping rules), had the published Winda maps checked and supplied the paper for that, decided when to stop, and is responsible for the content. The research was carried out on 4–5 November 2026 by an AI research system built on Claude Opus 5.5 (Anthropic) and GPT-6 Astra (OpenAI); the text was revised on 9 November 2026. Each proof was written by one of the two models and accepted by a blind review from the other; the Winda computation was done by both independently; Claude Opus 5.5 drafted the manuscript and GPT-6 Astra reviewed it blind. Section IX of the note has the details.
In quantum sequential growth of causal sets, the coherent predictions for finite histories are summarized by the Gram kernel of the reached history vectors, which fixes all finite-cylinder interference. A formally consistent kernel need not come from any complete growth dynamics, so a realization criterion decides which candidate quantum causal processes are admissible. For finite-dimensional, causal-past-ordered growth, and building on the operational descent and Bell-convention results of a preceding paper, we answer two questions. Realizability: a kernel arises from a complete direct-Bell model if and only if it satisfies five intrinsic conditions. Four of them (normalization, positivity and refinement; invertible graft graphs; commutation; Markov invertibility) reconstruct the unique minimal commutative late dynamics, and a first-junction rank condition decides whether that dynamics lifts. Sufficiency is proved by an injective-envelope dilation, which yields a full broad-Bell model on a carrier of dimension at most 2·dim(U)·rank(K), also when the relevant algebra is nonsemisimple. Consequently direct, source-faithful and broad Bell causality have identical kernel classes, despite their different full-matrix model classes. Observational completeness: apart from the empty/singleton pair, two finite causal sets are identified by every such model exactly when they have equal size and equal augmented past-profile multisets. Explicit examples show that a realizable kernel can require a carrier larger than its reached space, and that a consistent reduced kernel can fail the first-junction condition. We separate these finite-cylinder results from own-core classification, infinite-history extension and finite-prefix recognition. Contents of this record: the manuscript (PDF) and its LaTeX source, and a certificates bundle. The bundle holds twelve standalone Python programs that check every finite computation cited in the paper using exact integer and rational arithmetic, together with their result files and SHA-256 checksums. Reproducibility: the programs use only the Python standard library. Unzip the bundle and, inside its folder, run: python3 run_all.py. It verifies the checksums, runs all twelve programs and reports ALL 12 PROGRAMS PASSED. The all-stage theorems are proved in the manuscript; the programs are finite checks. Status: research preprint, not peer reviewed. Fourth paper in a series; it builds directly on T. G. Hamilton, "Which Bell causality? Operational abelianization and a Rideout–Sorkin theorem for quantum sequential growth", Zenodo (2026), doi:10.5281/zenodo.24083829, which in turn follows doi:10.5281/zenodo.24006143 and doi:10.5281/zenodo.23953788.Version 2 (13 November 2026): revised for submission to Physical Review D as a companion to “Which Bell causality?” (doi:10.5281/zenodo.24181929). Mathematics unchanged; presentation, references and the statement of the own-core open problem updated.