TheoremStatement: AI-adaptedProof: AI-adaptedprecheck passaudited 2026-08-13

How statement and proof provenance work

The first chip identifies the source of the statement or construction; the second identifies the source of its local proof or verification.

Literature-sourced: the exact statement appears in a cited source; only wording and notation differ.
AI-adapted: a semantically identical restatement of literature-sourced material, modulo indexing, notation, and boundary cases adopted by the library.
AI-generated: a genuinely novel statement formulated by AI, with no source for the claim itself.

These labels describe origin, not correctness: citations and verification chips remain separate evidence.

For every positive-sized square matrix over a commutative ring, $A adj (A) = adj (A) A = \det (A) I$

Statement

For a commutative ring $R$ , $n \geq 1$ , and $A \in M_{n} (R)$ ,

$A adj (A) = adj (A) A = \det (A) I_{n} .$

Facts & Assumptions

Given: $R, n, A$ as in the statement.

[L1]

Laplace expansion along row $i$ is $\det (A) = \sum_{k} a_{i k} C_{i k} (A)$ , and expansion along column $j$ is $\det (A) = \sum_{k} a_{k j} C_{k j} (A)$ (Laplace expansion computes the determinant along every row and every column over a commutative ring).

[L2]

The determinant is alternating and multilinear in rows (The determinant is alternating and multilinear in the rows as well as in the columns).

[L3]

A matrix with two equal columns has determinant $0$ (A square matrix with a zero column or two equal columns has determinant zero).

[F1]

Matrix multiplication is given by $(B C)_{i j} = \sum_{k} b_{i k} c_{k j}$ (Entrywise ring-matrix operations, rectangular matrix products, identity matrices and transpose).

[L4]

Matrix multiplication is associative and distributive, and $I_{n}$ is its identity (Matrix arithmetic over a commutative ring is associative, unital and distributive, and transpose reverses products).

Proof

technique · direct

1.1

The $(i, j)$ entry of $A adj (A)$ is $\sum_{k} a_{i k} C_{j k} (A)$ . If $i = j$ , [L1] makes this $\det (A)$ .

F1L1

1.2

If $i \neq j$ , replace row $j$ of $A$ by row $i$ . Expanding the resulting determinant along row $j$ gives $\sum_{k} a_{i k} C_{j k} (A)$ , because the minors used in that row do not involve row $j$ . The matrix has two equal rows, so its determinant is $0$ by alternation.

L1L2

1.3

The $(i, j)$ entry of $adj (A) A$ is $\sum_{k} C_{k i} (A) a_{k j}$ . It equals $\det (A)$ when $i = j$ by column expansion. When $i \neq j$ , it is the column- $i$ expansion of the matrix obtained by replacing column $i$ by column $j$ , whose determinant is $0$ because it has two equal columns.

F1L1L3

2.1

Thus $A adj (A) = \det (A) I_{n}$ .

step 1.1step 1.2L4

2.2

Hence $adj (A) A = \det (A) I_{n}$ .

step 1.3L4

3.1

Combining steps 2.1 and 2.2 proves both identities.

step 2.1step 2.2∎

Depends on

Used by

Dependency tree · two levels

14 results within two dependency steps of this one, each drawn at its shortest distance from it. An arrow runs from a result to what uses it, so the chart reads left to right and ends at this result, which carries a heavier outline. Every node is a link to that result. Click elsewhere on the chart to enlarge it.

Sources

András Pál, Introduction to Commutative Algebra, Proposition 7.2 (standard reference, not scraped)

For every positive-sized square matrix over a commutative ring, Aadj⁡(A)=adj⁡(A)A=det⁡(A)IAadj(A)=adj(A)A=det(A)I