Alphabeta Math
LemmaStatement: Literature-sourcedProof: AI-adaptedprecheck passjudge pass (deepseek-v4-pro + gpt-5.6-terra)audited 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 symmetric M=(ABBTC) with A invertible, a block-unitriangular congruence gives A⊕(C−BTA−1B) and factors det⁡M

Statement

Let

M=(ABBTC)

be symmetric over a field, with square diagonal blocks and A invertible. Put S=C−BTA−1B. Then for

P=(I−A−1B0I)

one has PTMP=A⊕S, and

det⁡M=det⁡Adet⁡S,

where the determinant of a 0×0 block is interpreted as 1.

Facts & Assumptions

Given: The displayed symmetric block matrix with A invertible; an empty square block has determinant 1.

[L1]

A basis change by P changes a bilinear-form matrix to PTMP (A basis change by P changes the matrix of a bilinear form from A to PTAP).

[L2]

For a positive-sized square matrix over a commutative ring, the determinant is the signed sum over permutations of products selecting one entry in each row and column (For n≥1, the determinant over a commutative ring by the Leibniz formula, and ∣det⁡A∣ for a real matrix).

[L3]

Determinants of positive-sized square matrices over a commutative ring are multiplicative (For same-sized finite square matrices over a commutative ring, det⁡(AB)=det⁡(A)det⁡(B)).

[L4]

A triangular matrix has determinant equal to the product of its diagonal entries (The determinant of a triangular matrix is the product of its diagonal entries).

Proof

technique · explicit block elimination
1.1

If the total size is zero, every block and P is empty, both displayed matrix identities are the empty identity, and the determinant formula reads 1=1⋅1. Otherwise P is block upper triangular with identity diagonal blocks, and P−1=(IA−1B0I); hence it is invertible and [L4] gives det⁡P=1=det⁡PT.

L4L5givenalgebra
2.1

Since symmetry of M makes AT=A and therefore (A−1)T=A−1, direct multiplication gives PTMP=(A00C−BTA−1B)=A⊕S.

step 1.1L1L5algebra
3.1

In positive total size, [L3] and step 1.1 give det⁡(PTMP)=det⁡M. In the Leibniz sum [L2] for the block diagonal matrix of step 2.1, every nonzero term preserves both index blocks, so its determinant is det⁡Adet⁡S, with the stated empty-block convention when one block has size zero. Thus det⁡M=det⁡Adet⁡S.

step 1.1step 2.1L2L3algebra
4.1

The calculation proves both assertions. Zero-sized blocks, zero entries inside A,B,C, and singular S require no cancellation and are all included.

step 1.1step 2.1step 3.1∎

Depends on

Used by

Dependency tree · two levels

24 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