Marcus's block-permanent inequality on the four-cycle
Main result: Proof of the four-cycle case of Marcus's block-permanent conjecture for every common block size k ≥ 2. The theorem applies to positive semidefinite Hermitian block matrices with A13 = A31 = A24 = A42 = 0, including singular matrices, and gives per A ≥ per G with a quantitative gap. The equality characterization assumes positive definite diagonal blocks. The claim is restricted to this four-cycle support. Abstract Let A be a positive semidefinite Hermitian matrix partitioned into four square blocks of common size k ≥ 2, with the two opposite off-diagonal blocks zero. Let G be the matrix of block permanents. We prove Marcus's inequality per A ≥ per G on this four-cycle support for every block size, together with the quantitative bound per A - per G ≥ (k - 1/2)ℰ, where ℰ is the sum of the four weighted squared edge permanents. If the diagonal blocks are positive definite, equality per A = per G occurs exactly for block-diagonal A. The proof combines nonnegative crossing coefficients, a degree-k symmetric-tensor contraction inequality, an isolated coefficient contribution, and a scalar four-cycle bound. Singular matrices are included by continuity. All auxiliary coefficient and tensor identities are derived in the article; the result concerns the stated support and does not assert the unrestricted Marcus conjecture. The PDF contains the complete analytic proofs. The LaTeX source and computational verification materials are provided as supplementary reproducibility material. The computational checks are optional error checks and do not replace the analytic proofs. Conceptual origin and AI assistance The initial idea and conceptual starting point of this investigation are based on the framework of the original geometric paper by Christos Panorias and Kostandina Theodhori, Canonical Parametric Representation of Plane Euclidean Geometry. This attribution concerns the conceptual origin and methodological organization of the research; every mathematical premise required by the present proofs is stated explicitly here. OpenAI ChatGPT/Codex assisted verification of calculations, editorial polishing and selected, delimited arguments during proof development, including substantive mathematical reasoning in those arguments. Christos Panorias is the sole named author and retains responsibility for reviewing, adopting and submitting the mathematical claims and final text.
Authors
- Christos Panorias
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-16
- DOI
- https://doi.org/10.5281/zenodo.24270945
- Primary Topic
- Matrix Theory and Algorithms
- Type
- preprint