Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicablePipeline-generatedjudge pass (gpt-6-luna)
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.

Support and weight of an operator on a finite register

Definition

Fix an ordered physical register HP=⨂j<nHj with finite-dimensional factors. For S⊆[n]:={0,…,n−1}, form HS and HSc in the inherited order, and let ΠS:HP→HS⊗HSc be the declared bijective wire permutation. An operator E∈End⁡(HP) is supported in S if there is ES∈End⁡(HS) with

ΠSEΠS−1=ES⊗ISc.

Its weight is wt⁡(E):=min⁡{∣S∣:E is supported in S}. The minimum exists because the full set [n] supports every operator and [n] has finitely many subsets. Let H∅=C; scalar identity operators have weight zero. The weight is invariant under reordering the tensor factors by their declared wire permutation (Operator support weight is invariant under wire permutation ↗).

Here ES⊗ISc is the tensor map of Tensor products of finitely many linear maps. The product factors may have arbitrary finite dimensions; qubits are the special case dim⁡Hj=2 for every j.

Remarks

The register tensor pairing and exact permutation convention are supplied by Ordered tensor registers, their inner product, and wire permutations and Finite wire permutations are unitary basis permutations. Their current bodies were inspected; Operator support weight is invariant under wire permutation ↗ proves the resulting weight invariance.

Depends on

Used by

Dependency tree · two levels

20 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