Edition 1
Scott Schubr
- Primary subject
- Mathematics
- Subject subfield
- Linear Algebra and Matrix Inequalities
- Paper type
- Research Article
- Manuscript stage
- Preprint
For a complex positive semidefinite Gram matrix B = VV* of order n ≥ 2, this paper couples the permanent-cofactor contractions of B and |B|². With a = per B, c = per |B|² and the transposed cofactor contractions T and U, it proves the sharp bound 0 ⪯ U − aT/n! ⪯ (n − 1)(c − a²/n!)I. The difference is represented as a one-mode occupation expectation in the orthogonal difference of two nested invariant subspaces. At order six, a central-transposition statistic gives a computable refinement involving fifteen mixed permanents. Applications retain all Gram kernel directions and include complex rank-five and rank-six examples with an improved sufficient certificate. Residual occupation polynomials, exact kernel thinning, zero-safe top-coefficient cancellation and complex examples without real-rooted occupation polynomials are also established. No unrestricted Chollet inequality is proved.
Edition 1
Scott Schubr
- Primary subject
- Mathematics
- Subject subfield
- Linear Algebra and Matrix Inequalities
- Paper type
- Research Article
- Manuscript stage
- Preprint
Strong permanent contraction is proved for every complex positive semidefinite matrix supported in K₄,q, for any finite q, and in K₅,₅. The four-row proof is analytic; the five-by-five proof combines a retained third-minor budget, finite-column moment bounds and an exact tensor Bernstein certificate with 3,145,728 rational coefficients. Independently, a dimension-free energy criterion proves the ordinary self-Chollet inequality under squared row and column bounds of one and total squared energy at most 12 + (201 + 16√537)/988, including all positive semidefinite K₁₂,q supports. Strong five-row estimates with arbitrary finite column count are also obtained near row-isometries and under dispersed fourth moments. Structural proofs, large-entry transfer and analytic reductions are included, with classical inputs credited. Complex phases, missing edges and singular endpoints are covered; full strong contraction for arbitrary K₅,q is not claimed.
Edition 1
Scott Schubr
- Primary subject
- Mathematics
- Subject subfield
- Linear Algebra and Matrix Inequalities
- Paper type
- Research Article
- Manuscript stage
- Preprint
We prove that every complex positive semidefinite matrix A supported in K₄,₈ satisfies per(|A|²) ≤ per(A) ∏ᵢ aᵢᵢ. The proof extends an established four-row framework by retaining a necessary lower bound on squared row moments and choosing a convex permanent bound as a polynomial of the row norms. An exact two-point obstruction shows why one fixed mixture in the inherited scalar framework is insufficient. A small-row reduction and a rational tensor Bernstein certificate cover the capped-entry region; a published all-column large-entry theorem covers its complement. The result is computer-assisted, includes arbitrary phases and singular endpoints, and does not establish all four-row supports or unrestricted Chollet.
Edition 1
Scott Schubr
- Primary subject
- Mathematics
- Subject subfield
- Linear Algebra and Matrix Inequalities
- Paper type
- Research Article
- Manuscript stage
- Preprint
We prove that every complex positive semidefinite matrix A supported in K₄,₇ satisfies per(|A|²) ≤ per(A) ∏ᵢ aᵢᵢ. The normalized off-diagonal block is a four-by-seven operator contraction. The new argument retains third-order minor contributions and controls their coupled phase cancellations through the row Gram matrix. A split according to the smallest squared row norm separates an analytic corner reduction from a balanced-row polynomial inequality. The latter is verified by an exact rational tensor Bernstein certificate on 256 boxes. An established all-column large-entry theorem covers the complementary region. The computer-assisted result includes arbitrary phases, missing edges and singular endpoints. It does not prove the all-column four-row case, the K₅,₅ case, or unrestricted Chollet.
Edition 1
Scott Schubr
- Primary subject
- Mathematics
- Subject subfield
- Linear Algebra and Matrix Inequalities
- Paper type
- Research Article
- Manuscript stage
- Preprint
We prove that every complex positive semidefinite matrix A supported in K₄,₆ satisfies per(|A|²) ≤ per(A) ∏ᵢ aᵢᵢ. The normalized off-diagonal block is a four-by-six operator contraction. For squared entries at most 7/10, the proof combines a four-vertex overlap estimate with a fixed mixture of rectangular permanent bounds. Separate affinity, deletion of inactive rows and piecewise separate concavity reduce the remaining inequality to fifteen rational corner values. A convex-border argument covers larger entries for every number of columns, using Lieb’s block inequality and the published three-row theorem. Arbitrary phases, missing edges and singular endpoints are included. The four-by-four and four-by-five conclusions follow by padding. No all-column four-row or unrestricted Chollet theorem is asserted.
Edition 1
Scott Schubr
- Primary subject
- Mathematics
- Subject subfield
- Linear Algebra and Matrix Inequalities
- Paper type
- Research Article
- Manuscript stage
- Preprint
For every complex 3 × q contraction X, we prove that the permanent of [I₃ X; X* Iq] is at least the permanent of its entrywise squared modulus. The proof retains all square-minor orders and controls the coupled third-order cancellations through the row Gram matrix. It gives an explicit sum of nonnegative lower bounds and includes arbitrary phases, zero entries and singular endpoints. Combining this theorem with three pentagon blow-up cases and an exact finite graph classification proves the same strong inequality for every positive semidefinite matrix with triangle-free support on at most seven vertices, after diagonal scaling. Two previously unpublished blow-up cases are proved here, one analytically and one by an explicit positive integer polynomial certificate. Reproducibility supplements contain the certificate and finite classification verifier. The unrestricted Chollet conjecture is not settled.
Edition 1
Scott Schubr
- Primary subject
- Mathematics
- Subject subfield
- Linear Algebra and Matrix Inequalities
- Paper type
- Research Article
- Manuscript stage
- Preprint
We prove per(|A|²) ≤ per(A) for complex positive semidefinite correlation matrices supported on a seven-cycle with chords 03,15,26. More precisely, the difference dominates one fiftieth of the matching-partition loss. The proof combines elementary cycle estimates with an explicit nonnegative integer polynomial identity, supplied with a standard-library verification program. The two-chord subgraph with chords 03,15 inherits the same bound. For the crossing placement 03,14 we give a separate analytic proof with constant 1/12. All results include missing edges and singular matrices. The normalized arguments require only vertex-star magnitude bounds, and we describe equality and diagonal scaling. These structural results do not establish the unrestricted Chollet conjecture.
Edition 1
Scott Schubr
- Primary subject
- Mathematics
- Subject subfield
- Linear Algebra and Matrix Inequalities
- Paper type
- Research Article
- Manuscript stage
- Preprint
We study two auxiliary cofactor comparisons motivated by permanent Hadamard inequalities. For a complex positive definite correlation matrix B, let R be its transposed permanental cofactor matrix and L that of its entrywise squared modulus. We compare zᵀLz and zᵀ|R|◦²z, where zᵢ = |xᵢ|², with (per B)(x*B⁻¹x)(x*Rx). Both comparisons have sharp universal constant one in orders one and two. At every fixed order at least three, neither admits any finite universal constant, even among dense irreducible positive definite correlation matrices with nonreal triangle phases. An explicit roots-of-unity family gives quantitative divergence. The cancellation mechanism is classical; the result concerns these auxiliary comparisons and does not disprove Chollet’s inequality.
Edition 1
Scott Schubr
- Primary subject
- Mathematics
- Subject subfield
- Linear Algebra and Matrix Inequalities
- Paper type
- Research Article
- Manuscript stage
- Preprint
For a complex Hermitian positive semidefinite matrix A, write Q(A) = per(A ◦ Ā) and d(A) = ∏ᵢ aᵢᵢ. We prove Q(A) ≤ d(A) per(A) whenever the off-diagonal support of A is contained in a cycle of length at least four, or in a theta graph with endpoint-path lengths 1, b, c, where b, c ≥ 3 and b + c ≥ 7. The entries may have arbitrary phases and unequal magnitudes, and singular matrices are included. For a single cycle, the loss between two weighted matching partition functions pays the worst possible directed-cycle contribution. For a single-chord cycle, a simultaneous matching-loss allocation pays all three overlapping cycles. We give the complex form of the known one-point strong-closure argument and obtain hereditary inequalities for graphs assembled from these blocks. These are structural results; the unrestricted permanent inequalities are not proved.
Edition 1
Scott Schubr
- Primary subject
- Mathematics
- Subject subfield
- Linear Algebra and Matrix Inequalities
- Paper type
- Research Article
- Manuscript stage
- Preprint
We prove quantitative self-conjugate Chollet inequalities for all complex Hermitian positive semidefinite matrices of rank at most four in orders eight and nine, with respective factors 243/320 and 1215/1352. A short extension of the occupation-border comparison of Li, Zhao and Luo balances its two multiplicative losses. The input is the previously established singular order-five factor 3/5; no new certificate is needed. Together with Rodtes’ order-four theorem and Ma’s theorem for orders at least ten, the new estimates imply Chollet’s inequality in every order when both factors have rank at most four. The coefficient-one inequality is strict for positive diagonal in orders at least five. No claim of optimal constants or an unrestricted-rank conclusion is made.