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.
Fixed-charge encoding and code projector
Definition
Fix a unitary fusion category and the representative set of Multiplicity-aware fusion-tree basis. For an ordered list , , a total charge , and a parenthesized input tensor , let , equipped with that definition's orthonormal fusion-tree inner product. The identical-input case retains the notation . Let with its ordered orthonormal computational basis, where . A fixed-charge encoding is an isometry , so . Its code subspace is , and its code projector is An encoding records a chosen subspace of a fusion space; it does not identify that subspace with an object of the fusion category.
Facts & Assumptions
Given: The finite-dimensional fusion space , the computational space , and an isometry .
The adjoint satisfies and . The adjoint is characterised by
Proof
By [F2], . Also by [F1]. Hence is an orthogonal projection.
For every , by [F1], so . Conversely lies in for every , so . Therefore .
Depends on
Used by
- Arbitrary-n triple-anyon fixed-charge code Definition
- Exact, projective, and encoded braid universality Definition
- Finite anyon task and promise interface Definition
- Fusion-tree task input encoding Definition
- Logical block error and leakage amplitude Definition
- Six-anyon triple-encoded subspace and leakage complement Definition
Dependency tree · two levels
14 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
- Chetan Nayak, Steven H. Simon, Ady Stern, Michael Freedman, and Sankar Das Sarma, Non-Abelian Anyons and Topological Quantum Computation (standard reference, not scraped)
- John Preskill, Lecture Notes for Physics 219: Quantum Computation, Chapter 9: Topological Quantum Computation (standard reference, not scraped)