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.
Hattori–Stallings pseudo-trace
Definition
Let be a unital associative -algebra, let be the linear span of commutators , and let be a symmetric linear functional, meaning for all . A right -module is finite projective here if there are an integer and an idempotent with .
A finite dual basis for is a finite list , satisfying for every ; a finite projective module has such a list. For define the candidate pseudo-trace value set
The basis-independence lemma for this definition proves that this set is a singleton; its unique value is denoted and called the Hattori–Stallings pseudo-trace.
Definition references
Remarks
The asserted existence of a finite dual basis follows directly from the chosen definition of finite projective. If for an idempotent , regard as column vectors, set , and let be the th coordinate restricted to . For , . An isomorphism transports this finite dual basis to . The basis-independence lemma then shows the candidate value set in the Definition is a singleton.
Dependency tree · 0 levels
Nothing. This result depends on no other item in the library.