While this submission is a draft, it cannot be used by other submissions.

Proof of `Counting tuples of symmetric matrices with bounded total rank` (1st statement)

groundedproofs/Lax342547Proofs/ProfileCounting.lean · lax-342547

What this proof establishes

Assuming the claims on the left, the claim on the right holds — checked by the archive's pipeline. Proof code is not displayed here.

Read the Lean proof on GitHub

Description

Every actual cut-profile component is a sum of symmetric point moments. The underlying component tuple embeds the bounded-rank cut profiles into the symmetric tuples counted above.