Alphabeta Math
DefinitionDefinition: AI-adaptedProof: Not applicable
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.

J equals five absorption-emission code

PDF p. 6: Æ-code bullet and Fig. 4

Definition

The article describes absorption–emission (Æ) codes as a family protecting against absorption–emission noise. Its selected J=5 instance uses the orthonormal magnetic basis ∣5,m⟩, m=−5,−4,…,5, and the two codewords ∣0ˉ⟩=5/7∣5,−2⟩+2/7∣5,5⟩ and ∣1ˉ⟩=2/7∣5,−5⟩+5/7∣5,2⟩. The code is their linear span. The encoding is the linear map from a two-dimensional logical space with orthonormal basis ∣0⟩,∣1⟩ that sends these basis vectors to ∣0ˉ⟩,∣1ˉ⟩, respectively.

For a precise error contract, choose a finite set S of spin labels containing 5, with ∣J′−5∣≤1 for every J′∈S. Let H=⨁J′∈SVJ′ be the orthogonal direct sum with one labelled copy of each block, let ιJ′:VJ′→H be the inclusion, and let π5:H→V5 be the orthogonal projection onto the input block. Regard the codewords and encoding as taking values in H via ι5. For each J′∈S and k∈{0,1}, take every component Tq:V5→VJ′, −k≤q≤k, of every rank-k spherical tensor family in the error-span contract. The order-one absorption–emission error span is the complex linear span in L(H), the space of complex-linear endomorphisms of H, of IH and all ιJ′Tqπ5. Rank refers to the tensor transformation law, not matrix rank. The article says this code corrects rank-one transitions with nonoverlapping error spaces. In the stated coherent error-span contract, the precise condition established below is PE∗FP=cE,FP for every two errors E,F in the span, where P is the orthogonal projector on H onto the embedded code. In particular, ⟨0ˉ∣E∗F∣1ˉ⟩=0: the error spaces generated from the two different codewords are orthogonal. This does not assert that the spaces generated by different errors on the same codeword are mutually orthogonal, or that every individually resolved matrix-unit transition belongs to the error span.

Justification

The magnetic basis is orthonormal. Each displayed codeword has squared norm 5/7+2/7=1, and their supports are disjoint, so they are orthogonal. Thus the encoding is an isometry and the code projector P is well defined. Angular-momentum basis and tensor labels Code restriction and decoded channel types

The union of the magnetic supports is {−5,−2,2,5}, whose consecutive gaps are 3,4,3. Both codewords have zeroth moment 1, first moment 0, and second moment 10: for ∣0ˉ⟩ the latter two are (5(−2)+2(5))/7=0 and (5(4)+2(25))/7=10, and for ∣1ˉ⟩ they are (2(−5)+5(2))/7=0 and (2(25)+5(4))/7=10. The spaced-support moment criterion therefore gives the pair-product condition for the selected coherent tensor error span. Taking its matrix element between the orthogonal codewords gives the displayed cross-term vanishing and hence orthogonality of the two generated error spaces. The error-span contract defines the selected blocks, tensor components and pair-product condition; it does not identify the span with all resolved matrix units. Each ιJ′Tqπ5 is an endomorphism of H, so the span and all products PE∗FP are well typed. Order-one absorption–emission tensor error span Spaced-support moment criterion for order-one AE correction

Depends on

Used by · 10

Dependency tree · 2 levels

Each result is drawn at its shortest distance from this item. Arrows run from prerequisites to the items that use them; this item has a heavier outline. External source nodes link directly to the cited text. The view shows up to two dependency steps; open a prerequisite to continue.

Sources