Alphabeta Math
Physics theoremStatement: AI-adaptedProof: AI-generated
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.

Aydin–Barg rank-one correction and lower host angular momentum

PDF p. 6: Aydin–Barg bullet; PDF p. 17: Fig. S5.1 caption

Statement

Consider the displayed signed Aydin–Barg encoding in J=4 and the displayed Æ encoding in J=5. For either code choose a finite set of output spin blocks containing its input block and obeying ∣J′−J∣≤1. Both codes satisfy the pair-product Knill–Laflamme condition for the complete selected coherent order-one tensor error span. Therefore every finite trace-preserving Kraus channel whose errors lie in that span has an exact decoded recovery on the code. Tensor components change magnetic labels by ∣m′−m∣≤1; this is not a claim about every separately resolved matrix-unit transition with those label bounds.

The spin-four code uses smaller minimum magnetic-support separation, two rather than three, at lower hosting spin, four rather than five (block dimensions nine rather than eleven). In the explicit within-block distance convention of the distance lemma—the smallest spherical-tensor rank with a nonscalar code compression—both codes have exact distance three. They also both have exact spin-polynomial distance three, measured by the first undetected degree in the Cartesian spin generators. Thus the article's equal-distance comparison has this precise supported interpretation. It does not assert equality under an unspecified alternative metric or global minimality of J=4.

For the zero-temperature downward-branch specialization, select the lower block J−1 as well as the input block, and assume Choice, Countable Choice and Dependent Choice, finitely many integer-spin blocks, strictly increasing spin-manifold energies, a rank-one spherical coupling, and all bath preparation, ULE/weak-Markov, regularity, spectral-matching and compatible vacuum-limit hypotheses of Canonical angular-momentum downward jumps. In particular the chosen nonnegative spectral representative must vanish at every required nonpositive transition frequency, including zero. Under those hypotheses, the single-jump errors out of the code's host block have only J→J−1 and lie in its selected order-one span. Zero temperature by itself is not used to assert a pointwise spectral value or to eliminate zero-frequency intramanifold transitions. Exact recovery above concerns channels with Kraus errors in the stated span; arbitrary finite-time repeated jumps or degeneracy-resolved errors require their own analysis.

Facts & Assumptions

Given: The finite objects, measure conventions and explicit hypotheses in the Statement.

[F1]

The article-selected signed spin-four encoding has the displayed magnetic amplitudes and its isometric code. J equals four Aydin–Barg encoding

[F2]

The article-selected spin-five encoding has the displayed magnetic amplitudes and its isometric code. J equals five absorption-emission code

[F3]

Rank one denotes a coherent spherical tensor transformation law, not matrix rank or an arbitrary resolved matrix unit. Rank-one transition errors in the benchmark

[F4]

The finite Kraus channel criterion supplies exact decoded recovery from scalar pair products, with trace preservation required. Knill–Laflamme criterion

[F5]

The complete selected order-one tensor error span contains rank-zero and rank-one components with the specified target blocks. Order-one absorption–emission tensor error span

[F6]

The signed spin-four code satisfies the full order-one pair-product condition without a separated-support assumption. Finite signed-code KL product test

[F7]

The spaced-support moment criterion supplies the order-one pair-product condition when support gaps are at least three and moments zero through two agree. Spaced-support moment criterion for order-one AE correction

[F8]

Under its complete finite-block physical and pointwise spectral hypotheses, the canonical atomic jumps have only the downward spin branch. Canonical angular-momentum downward jumps

[F9]

Assume the Axiom of Choice for inherited physical supplier constructions. The Axiom of Choice

[F10]

Assume Countable Choice for inherited physical and mathematical suppliers. The Axiom of Countable Choice (AC_ω)

[F12]

Within-block tensor families through rank three have the stated polynomial realizations and uniqueness. Low-rank tensor families are spin polynomials

[F13]

Pair-product correction detects every quadratic spin error and every tensor component through rank two. Pair-product correction detects quadratic spin errors

[F14]

The two explicit encodings have the stated first, second and third moment matrices. The selected spin-four and spin-five codes have nontrivial cubic moments

[F15]

Their magnetic support unions have minimum gaps two and three and hosting dimensions nine and eleven. The selected codes have magnetic-support gaps two and three

[F16]

Both code distances equal three in the explicit minimum-undetected-rank and polynomial-degree conventions once their pair-product conditions hold. Both selected codes have exact tensor-rank distance three

Proof

Goal: Establish the stated formula, convergence and qualifications.

1.1F1F2F4F5F6F7F14F15algebra

The signed spin-four code in [F1] is exactly the isometry in [F6], so it has the complete order-one pair-product condition. For the spin-five code in [F2], [F15] gives disjoint supports with minimum gap three. Fact [F14] gives moments 1,0,10 for either column, so [F7] establishes its pair-product condition for the complete selected span. Both selected sets contain their input blocks, as required. Applying [F4] to any finite trace-preserving Kraus family inside either span gives the corresponding exact decoded recovery; a bare unnormalized spanning list is not called a channel.

2.1F12F13F14F15F16step 1.1

By [F15] the support and host-spin comparison is exactly two versus three and four versus five. Step 1.1 supplies the pair-product hypotheses of [F13] and [F16]. With [F12] and the cubic moments [F14], those results give exact distance three in both stated conventions for each code. In particular equality of correction order alone is not substituted for equality of these distances: the rank-three witnesses provide the matching upper bounds.

2.2F3F5F8F9F10F11step 1.1

For the general selected tensor family, the rank-one selection rule [F3] gives ∣m′−m∣≤1 and the selected-spin condition gives ∣J′−J∣≤1. With the additional full hypotheses in the final Statement paragraph, [F8] removes the nonpositive-frequency branches and supplies only the coherent downward jumps. Their restriction to a fixed host block is a rank-one tensor component into the lower selected block, so [F5] and step 1.1 cover these single-jump errors. This deduction needs the stated spectral representative and increasing energies, in addition to the vacuum hypothesis; it does not follow from zero temperature alone.

3.1F3F4F5F8step 1.1step 2.1step 2.2∎

The preceding steps prove the claimed coherent correction, support and distance comparisons and the conditional downward-branch specialization. They neither replace coherent components by individually resolved matrix units nor infer that the entire finite-time noisy channel remains in the order-one span. These are exactly the model and channel qualifications in the Statement, with the article's comparison retained as attribution.

Source notes

The original article, PDF p. 6 Aydin–Barg bullet and Fig. 4, says the signed J=4 code “corrects the same rank-1 transitions with smaller separation between the supporting states, achieving the same code distance at lower J.” Its Fig. S5.1 caption on PDF p. 17 specifies the label bounds and says only the downward branch occurs at zero temperature. These claims are preserved with the coherent-span meaning and explicit distance convention above. The article does not define a distance metric in these cited passages; the local distance comparison is proved from the code amplitudes and tensor structure, not inferred from the wording.

Independent source context: Aydin and Barg, Class of codes correcting absorptions and emissions, arXiv:2410.03562v1, PDF p. 2, §II Eqs. (1)–(4) and the paragraph continuing on p. 3, defines coherent order-t and spin error families. It explicitly declines to use a proposed spin-code distance convention in its results. The code constructions and examples in §III, PDF pp. 3–5, are not simply identified with the target's signed J=4 code. Actual reading for this resolution uses those source definitions/statement passages and the already completed signed-code supplier; its imported Theorem III.1 remains subject to that supplier's honest reading limits, including no Appendix C reconstruction. This theorem supplies its distance calculation locally and does not import an unspecified distance equality.

The source's code-distance phrase is an interpretation issue resolved here by explicit formulation, not an independently assessed article defect. The original figure curves and checking-time fits are not inputs to this proof, and no numerical reproduction, experiment, separate review or scientific acceptance is asserted.

Depends on

Used by · 2

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.

External dependencies

Class of codes correcting absorptions and emissions · §II, PDF p. 2, Eqs. (1)–(4), and the distance paragraph continuing on PDF p. 3; §III A, PDF pp. 3–4, Theorem III.1; PDF p. 4, Construction III.1, Theorem III.3 and Examples 1–2.

Eqs. (2)–(3) define order-t absorption–emission errors as coherent Clebsch–Gordan sums; Eq. (4) gives the within-block spin-error family. The distance paragraph discusses a possible spin-code convention but does not use it in the results. The displayed examples are not used here to identify the target signed J=4 encoding.

Hypotheses: Finite spin J=n/2 with positive integer n, two-dimensional code subspaces as in Eq. (1), and nonnegative integer transition order t; coherent error families. These are contextual definitions and a distance disclaimer, not an imported proof of the target code or its distance.

Reading limits: Read the retrieved v1 PDF text at Eqs. (1)–(4), the distance paragraph, Theorem III.1, Construction III.1, Theorem III.3 and Examples 1–2. Text retrieval only; Appendix C was not read or reconstructed. The signed-code supplier records its separate imported criterion and local application.

Sources