Pith. sign in
module module high

IndisputableMonolith.Geometry.CofactorPolynomial

show as:
view Lean formalization →

Gives every tetrahedral Cayley-Menger cofactor an explicit multivariate polynomial normal form in the six edge lengths. Anyone differentiating dihedral cosines or matching cofactor identities to the 5x5 CM matrix cites this layer. The module builds the relevant 3x3 minors, expands their determinants as polynomials, and proves agreement with the matrix cofactors.

claimFor each entry of the $5\times 5$ Cayley-Menger matrix of a tetrahedron, the corresponding cofactor equals an explicitly written polynomial in the six squared edge lengths (e.g. the $(3,4)$ and $(2,4)$ cofactors match $\det$ of named $3\times 3$ minor matrices). Partial derivatives of those polynomials are likewise named.

background

The Cayley-Menger matrix encodes a tetrahedron's edge geometry so that volumes and dihedral data are determinants and cofactors. Upstream, CayleyMengerMatrix ties the explicit tetrahedral polynomial cm3 to the actual $5\times 5$ determinant and sets the row/column convention needed by the dihedral cosine formula. DihedralCayleyMenger then defines each edge's dihedral cosine from a ratio of those cofactors: for edge $(i,j)$ with opposite vertices $(p,q)$, the cosine is built from CM cofactors with vertex indices shifted by one in the bordered matrix.

This module sits between those layers and any calculus on dihedrals. It introduces named $3\times 3$ minor matrices (e.g. for positions $(3,4)$, $(2,4)$, $(2,3)$), their determinants as polynomials in the edge data, and a polynomial representative cmCofactor3Poly for each cofactor of interest, plus partials cmCofactorPartial. The agreement predicates record that the polynomial form equals the matrix cofactor.

proof idea

Definition-heavy module with targeted determinant expansions. For each needed cofactor index pair it builds an explicit minor matrix, proves the submatrix extraction identity against the full CM matrix, expands the $3\times 3$ determinant into a polynomial, and equates that polynomial to the corresponding CM cofactor. Agreement lemmas (cmCofactor3_34_eq_poly, cmCofactor3_24_eq_poly, and siblings) are the bridge from matrix language to polynomial language. Partials are defined on the polynomial side so later derivative interfaces need not differentiate determinants symbolically from scratch.

why it matters in Recognition Science

Dihedral cosines in Recognition geometry are cofactor ratios; any rigidity, variation, or continuum limit needs derivatives of those ratios. Downstream CofactorDerivatives imports this module to expose derivative hooks for CM cofactors and the dihedral cofactor ratio, noting that hard symbolic simplifications remain further down but the calculus layer is no longer implicit. Without polynomial normal forms, cofactor differentiation stays stuck in opaque matrix minors. This file is the algebraic normal-form step that makes those hooks honest and checkable against the Cayley-Menger determinant layer.

scope and limits

used by (1)

From the project-wide theorem graph. These declarations reference this one in their body.

depends on (2)

Lean names referenced from this declaration's body.

declarations in this module (116)

… and 36 more