is_weighted_partial_permutation
A square complex matrix M is a weighted partial permutation matrix if for every row index i, any two column indices with nonzero entries are equal, and for every column index j, any two row indices with nonzero entries are equal.
Statement
def is_weighted_partial_permutation {n : Type*} (M : Matrix n n ℂ) : Prop
- Defined in
- arXiv:2610.31807 Definition 3.12 and Theorem 3.13
- Verified
- 26 Oct 2026
- Axioms
- none listed
- Used by 5
- cyclic_fourier_col_zero_eq_zero_of_sharpFor any weighted partial permutation matrix whose (0,0) entry is non-zero, every other entry (m,0) in the 0-th column is zero.
- order_eight_hankel_admits_sharp_cyclic_labelingAny simple graph on ZMod 8 whose adjacency is given by (x + y).val ∈ {1, 3, 5} admits a sharp cyclic labeling.
- circulant_graph_admits_sharp_cyclic_labelingFor every N ≥ 1 and every subset s of ZMod N, if the circulant graph SimpleGraph.circulantGraph s has at least one edge, then it admits a…
- is_sharp_cyclic_labelingA bijection π from ZMod N to the vertex set of a simple graph G is a sharp cyclic labeling if the two-dimensional Fourier transform of the…
- sharp_cyclic_and_compl_imp_antidiagonalIf G is a simple graph on ZMod N such that both G and its complement G^c have at least one edge, and the standard cyclic labeling is sharp…
Read back from the Lean
For a type n and a matrix M : Matrix n n ℂ, is_weighted_partial_permutation M is defined to hold if and only if both of the following conditions hold:
1. For every row index i : n and all column indices j₁, j₂ : n, if M i j₁ ≠ 0 and M i j₂ ≠ 0, then j₁ = j₂ (each row contains at most one non-zero entry);
2. For every column index j : n and all row indices i₁, i₂ : n, if M i₁ j ≠ 0 and M i₂ j ≠ 0, then i₁ = i₂ (each column contains at most one non-zero entry).
Written by a model that saw only the Lean, never the English above. If the two disagree, that is worth a challenge.
Lean source view module on GitHub
/-- A square matrix is a weighted partial permutation matrix if every row and column contains at most one nonzero entry. -/ def is_weighted_partial_permutation {n : Type*} (M : Matrix n n ℂ) : Prop := (∀ i, ∀ j₁ j₂, M i j₁ ≠ 0 → M i j₂ ≠ 0 → j₁ = j₂) ∧ (∀ j, ∀ i₁ i₂, M i₁ j ≠ 0 → M i₂ j ≠ 0 → i₁ = i₂)