Let $A$ be an $n \times n$ matrix and denote by $M_{ji}$ the $(j,i)$-th cofactor of $A$, namely $(-1)^{i+j} \det A[ij]$, where $A[ij]$ is obtained from $A$ by deleting the $i$-th row and $j$-th column. Does it hold that $$M_{ji} = \sum_{\sigma \in S_n, \sigma(i) = j} \text{sgn}(\sigma) \, A_{1 \sigma(1)} \cdot \dots \cdot \hat{A}_{ij} \cdot \dots \cdot A_{n \sigma(n)},$$ where the hat means omit that factor? Of course $$M_{ji} = (-1)^{i+j} \sum_{\tau \in S_{n-1}} \text{sgn}(\tau) \, A_{1 \tau(1)} \cdot \dots \cdot A_{n-1, \tau(n-1)};$$ since each sum contains $(n-1)!$ terms, I tried to construct a correspondence between $\tau$ and $\sigma$ for which the associated summands coincide: $$\sigma(k) = \begin{cases} \tau(k) &\quad \text{if} \quad {k < i, \tau(k) < j}\\ \tau(k-1) &\quad \text{if} \quad {k \ge i+1, \tau(k-1) < j}\\ j &\quad \text{if} \quad {k =i} \\ \tau(k)+1 &\quad \text{if} \quad {k < i, \tau(k) \ge j} \\ \tau(k-1)+1 &\quad \text{if} \quad {k \ge i+1, \tau(k-1) \ge j}.\\ \end{cases}$$ However, determining $\text{sgn}(\sigma)$ in terms of $\tau$ is a nightmare, so I'm not quite there. Thanks for any advice.
2026-04-08 09:31:53.1775640713
Formula for $(i,j)$-th cofactor
100 Views Asked by Bumbble Comm https://math.techqa.club/user/bumbble-comm/detail At
1
There are 1 best solutions below
Related Questions in COMBINATORICS
- Using only the digits 2,3,9, how many six-digit numbers can be formed which are divisible by 6?
- The function $f(x)=$ ${b^mx^m}\over(1-bx)^{m+1}$ is a generating function of the sequence $\{a_n\}$. Find the coefficient of $x^n$
- Name of Theorem for Coloring of $\{1, \dots, n\}$
- Hard combinatorial identity: $\sum_{l=0}^p(-1)^l\binom{2l}{l}\binom{k}{p-l}\binom{2k+2l-2p}{k+l-p}^{-1}=4^p\binom{k-1}{p}\binom{2k}{k}^{-1}$
- Algebraic step including finite sum and binomial coefficient
- nth letter of lexicographically ordered substrings
- Count of possible money splits
- Covering vector space over finite field by subspaces
- A certain partition of 28
- Counting argument proof or inductive proof of $F_1 {n \choose1}+...+F_n {n \choose n} = F_{2n}$ where $F_i$ are Fibonacci
Related Questions in PERMUTATIONS
- A weird automorphism
- List Conjugacy Classes in GAP?
- Permutation does not change if we multiply by left by another group element?
- Validating a solution to a combinatorics problem
- Selection of at least one vowel and one consonant
- How to get the missing brick of the proof $A \circ P_\sigma = P_\sigma \circ A$ using permutations?
- Probability of a candidate being selected for a job.
- $S_3$ action on the splitting field of $\mathbb{Q}[x]/(x^3 - x - 1)$
- Expected "overlap" between permutations of a multiset
- Selecting balls from infinite sample with certain conditions
Related Questions in DETERMINANT
- Form square matrix out of a non square matrix to calculate determinant
- Let $T:V\to W$ on finite dimensional vector spaces, is it possible to use the determinant to determine that $T$ is invertible.
- Optimization over images of column-orthogonal matrices through rotations and reflections
- Effect of adding a zero row and column on the eigenvalues of a matrix
- Geometric intuition behind determinant properties
- Help with proof or counterexample: $A^3=0 \implies I_n+A$ is invertible
- Prove that every matrix $\in\mathbb{R}^{3\times3}$ with determinant equal 6 can be written as $AB$, when $|B|=1$ and $A$ is the given matrix.
- Properties of determinant exponent
- How to determine the characteristic polynomial of the $4\times4$ real matrix of ones?
- The determinant of the sum of a positive definite matrix with a symmetric singular matrix
Trending Questions
- Induction on the number of equations
- How to convince a math teacher of this simple and obvious fact?
- Find $E[XY|Y+Z=1 ]$
- Refuting the Anti-Cantor Cranks
- What are imaginary numbers?
- Determine the adjoint of $\tilde Q(x)$ for $\tilde Q(x)u:=(Qu)(x)$ where $Q:U→L^2(Ω,ℝ^d$ is a Hilbert-Schmidt operator and $U$ is a Hilbert space
- Why does this innovative method of subtraction from a third grader always work?
- How do we know that the number $1$ is not equal to the number $-1$?
- What are the Implications of having VΩ as a model for a theory?
- Defining a Galois Field based on primitive element versus polynomial?
- Can't find the relationship between two columns of numbers. Please Help
- Is computer science a branch of mathematics?
- Is there a bijection of $\mathbb{R}^n$ with itself such that the forward map is connected but the inverse is not?
- Identification of a quadrilateral as a trapezoid, rectangle, or square
- Generator of inertia group in function field extension
Popular # Hahtags
second-order-logic
numerical-methods
puzzle
logic
probability
number-theory
winding-number
real-analysis
integration
calculus
complex-analysis
sequences-and-series
proof-writing
set-theory
functions
homotopy-theory
elementary-number-theory
ordinary-differential-equations
circles
derivatives
game-theory
definite-integrals
elementary-set-theory
limits
multivariable-calculus
geometry
algebraic-number-theory
proof-verification
partial-derivative
algebra-precalculus
Popular Questions
- What is the integral of 1/x?
- How many squares actually ARE in this picture? Is this a trick question with no right answer?
- Is a matrix multiplied with its transpose something special?
- What is the difference between independent and mutually exclusive events?
- Visually stunning math concepts which are easy to explain
- taylor series of $\ln(1+x)$?
- How to tell if a set of vectors spans a space?
- Calculus question taking derivative to find horizontal tangent line
- How to determine if a function is one-to-one?
- Determine if vectors are linearly independent
- What does it mean to have a determinant equal to zero?
- Is this Batman equation for real?
- How to find perpendicular vector to another vector?
- How to find mean and median from histogram
- How many sides does a circle have?
Hint:
You can define an index mapping function
$$M_n(m):=\begin{cases}m<n\to m\\m\ge n\to n+1\end{cases}$$ and write the formula for the determinant of the $n-1\times n-1$ matrix
$$B_{kl}:=A_{M_i(k)M_j(l)}.$$