Alphabeta Math
RemarkRemark: AI-adaptedProof: Not applicableSession-authored (Fable 5 assisted)judge pass (gpt-5.6-terra)audited 2026-08-28
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.

A decomposition into irreducible summands need not be unique even when the isotypic decomposition is

Remark

Theorem The isotypic decomposition of a completely reducible representation is unique identifies the canonical part of a semisimple decomposition: the block V(S) attached to each irreducible type S.

What it does not canonically determine is a decomposition of one isotypic block into particular irreducible summands. Inside a block with multiplicity bigger than one, different complementary copies of the same irreducible can be chosen. The two-dimensional trivial representation of C2 already shows this: both ke1ke2 and k(e1+e2)ke2 split the same isotypic block into irreducible summands in different ways.

Depends on

Used by

Dependency tree · two levels

4 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