arxiv: 2605.02719 · v1 · submitted 2026-05-04 · 🧮 math.CO · math.QA

Recognition: 3 theorem links

· Lean Theorem

Classification of isomorphism classes of lattices from Construction A and B

Takara Kondo

Authors on Pith no claims yet

Pith reviewed 2026-05-08 18:14 UTC · model grok-4.3

classification 🧮 math.CO math.QA

keywords lattice isomorphismself-orthogonal codesConstruction AConstruction Bfinite fieldslattice classificationorbifoldsvertex operator algebras

0 comments

The pith

For self-orthogonal codes over odd-prime fields, lattices from Construction A or B are isomorphic exactly when the codes are.

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The paper proves that two self-orthogonal codes C and D of equal length over F_p, p an odd prime, produce isomorphic lattices under Construction A precisely when C and D are isomorphic as codes. The same equivalence holds when the lattices are built by Construction B. The argument proceeds by extending the notion of a frame inside a lattice and introducing auxiliary codes that recover the original code. A reader cares because the result supplies a complete classification of isomorphism classes for these two families of lattices, which appear in the study of orbifolds of lattice vertex operator algebras.

Core claim

We prove that for self-orthogonal codes C and D of the same length over F_p with p an odd prime, the lattice L_X(C) is isomorphic to L_X(D) if and only if C is isomorphic to D as codes, where X stands for either Construction A or Construction B. This is shown by generalizing the notion of a frame of a lattice and defining auxiliary codes that are analogues of codes from Kleinian codes.

What carries the argument

The generalized frame of the lattice together with the auxiliary codes derived from it, which allow the original self-orthogonal code to be recovered from the lattice.

If this is right

The isomorphism classes of L_A(C) stand in one-to-one correspondence with the isomorphism classes of self-orthogonal codes over F_p.
The same one-to-one correspondence holds for the lattices L_B(C).
This supplies a lattice analogue of the classification of lattice vertex operator algebras and their orbifolds.
Distinct code isomorphism classes necessarily produce non-isomorphic lattices under either construction.

Where Pith is reading between the lines

These are editorial extensions of the paper, not claims the author makes directly.

The bijection could be used to translate counting or classification results from coding theory directly into statements about these lattices.
Similar recovery techniques might apply to lattices built from other codes or by other constructions.
The classification may help enumerate distinct lattices arising in orbifold constructions by instead enumerating code classes.

Load-bearing premise

The lattices L_A(C) and L_B(C) are defined exactly as in Lam and Shimakura, and the generalized frames and auxiliary codes behave as claimed under the self-orthogonality condition.

What would settle it

A pair of non-isomorphic self-orthogonal codes C and D over the same F_p such that L_A(C) is isomorphic to L_A(D) as lattices, or such that L_B(C) is isomorphic to L_B(D).

read the original abstract

In this paper, we completely classify the isomorphism classes of certain lattices $L_A(C)$ and $L_B(C)$ from a self-orthogonal code $C$ over the finite field $\mathbb{F}_p$, where $p$ is an odd prime. These lattices are obtained by \emph{Construction A} and \emph{B} for a code $C$ over $\mathbb{F}_p$ introduced by Lam and Shimakura, which arose from a study of orbifolds of lattice vertex operator algebras. For self-orthogonal codes $C$ and $D$ of the same length over $\mathbb{F}_p$, we show that $L_X(C) \cong L_X(C)$ as lattices if and only if $C \cong D$ as codes, where $X=A$ or $B$. This can be expected to be lattice analogues of classifications of the isomorphism classes of lattice vertex operator algebras and its orbifolds. To prove the result, we generalize the notion of a frame of a lattice and define some codes which are analogues of codes constructed from Kleinian codes studied by H{\"o}hn.

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, simulated authors' rebuttal, and a circularity audit. Tearing a paper down is the easy half of reading it; the pith above is the substance, this is the friction.

Referee Report

2 major / 2 minor

Summary. The paper claims a complete classification of isomorphism classes of lattices L_A(C) and L_B(C) obtained via Construction A and B from self-orthogonal codes C over F_p (p odd prime), as introduced by Lam and Shimakura. It asserts that for self-orthogonal codes C and D of equal length, L_X(C) ≅ L_X(D) as lattices if and only if C ≅ D as codes (X = A or B). The proof proceeds by generalizing the notion of frames of a lattice and defining auxiliary codes as analogues of those arising from Kleinian codes.

Significance. If the central theorem holds, the result supplies a lattice-theoretic counterpart to known classifications of lattice vertex operator algebras and their orbifolds, tightening the link between coding-theoretic data and geometric invariants of lattices. The explicit generalization of frames together with the auxiliary-code construction is a concrete technical contribution that may be reusable in other settings where lattices are recovered from codes.

major comments (2)

[§3] §3 (generalized frames): the 'only if' direction of the main classification theorem requires that any lattice isomorphism L_X(C) ≅ L_X(D) canonically induces an isomorphism of the associated generalized frames (and hence of the auxiliary codes that recover C and D). The manuscript defines the generalized frame and auxiliary code but does not supply an explicit uniqueness argument showing that the frame is determined by the lattice alone rather than by the choice of embedding or code; without this, non-isomorphic codes could in principle produce isomorphic lattices.
[§4, Theorem 4.1] §4, Theorem 4.1 (main classification): the reduction from lattice isomorphism to code isomorphism is stated to hold under the self-orthogonality hypothesis, yet the verification that the auxiliary code is independent of the choice of generalized frame (or of any auxiliary data) is only sketched. A concrete check that different frames on the same lattice yield isomorphic auxiliary codes would make the argument load-bearing rather than conditional.

minor comments (2)

[§3] Notation for the auxiliary code (e.g., the precise definition of the map from frame vectors to codewords) is introduced without a displayed equation; adding an explicit formula would improve readability.
The abstract and introduction cite Lam-Shimakura and Höhn but omit a short comparison table of the new generalized frame versus the classical frame; such a table would clarify the precise extension.

Simulated Author's Rebuttal

2 responses · 0 unresolved

We thank the referee for the careful reading and constructive comments, which help clarify the proof structure. We address the major comments below and will revise the manuscript accordingly to strengthen the arguments.

read point-by-point responses

Referee: [§3] §3 (generalized frames): the 'only if' direction of the main classification theorem requires that any lattice isomorphism L_X(C) ≅ L_X(D) canonically induces an isomorphism of the associated generalized frames (and hence of the auxiliary codes that recover C and D). The manuscript defines the generalized frame and auxiliary code but does not supply an explicit uniqueness argument showing that the frame is determined by the lattice alone rather than by the choice of embedding or code; without this, non-isomorphic codes could in principle produce isomorphic lattices.

Authors: We agree that an explicit uniqueness argument is required to make the 'only if' direction fully rigorous. In the revised manuscript we will insert a new lemma in §3 establishing that any lattice isomorphism between L_X(C) and L_X(D) induces a canonical isomorphism of generalized frames. The argument relies on the fact that the frame is recovered from the set of minimal vectors of the lattice, which is intrinsically determined by the self-orthogonality of C and the geometry of Construction A/B; the lemma will show this recovery is independent of any auxiliary embedding. revision: yes
Referee: [§4, Theorem 4.1] §4, Theorem 4.1 (main classification): the reduction from lattice isomorphism to code isomorphism is stated to hold under the self-orthogonality hypothesis, yet the verification that the auxiliary code is independent of the choice of generalized frame (or of any auxiliary data) is only sketched. A concrete check that different frames on the same lattice yield isomorphic auxiliary codes would make the argument load-bearing rather than conditional.

Authors: We acknowledge that the current sketch of independence needs to be expanded. We will add a proposition in §4 that explicitly verifies the auxiliary code is independent of frame choice: for any two generalized frames on the same lattice L_X(C), we construct an explicit lattice automorphism mapping one frame to the other and show that this automorphism induces an isomorphism of the corresponding auxiliary codes. This concrete check will be carried out using the root-system description of the frames and the self-orthogonality hypothesis, rendering the reduction unconditional. revision: yes

Circularity Check

0 steps flagged

No significant circularity; classification rests on independent generalization of frames

full rationale

The paper establishes the iff statement by generalizing the frame notion from Lam-Shimakura and defining auxiliary codes as analogues of those from Höhn's Kleinian code work. These steps are constructive definitions applied to the lattices L_X(C), followed by explicit verification that lattice isomorphisms recover code isomorphisms. No equation or claim reduces by construction to a fitted parameter, self-citation chain, or renamed input; the central result is a theorem proved from the generalized objects rather than assumed in their definition. External references supply the base constructions without load-bearing self-reference.

Axiom & Free-Parameter Ledger

0 free parameters · 2 axioms · 0 invented entities

The central claim rests on the definitions of Construction A and B from Lam and Shimakura together with a new generalization of lattice frames; no free parameters or invented entities are introduced in the abstract.

axioms (2)

domain assumption The lattices L_A(C) and L_B(C) are defined exactly as in Lam and Shimakura (2019 or later reference).
The constructions are taken as given from prior literature.
domain assumption Self-orthogonality of the code C is preserved under the lattice constructions.
Required for the lattices to be well-defined and for the isomorphism statement to hold.

pith-pipeline@v0.9.0 · 5487 in / 1328 out tokens · 22035 ms · 2026-05-08T18:14:49.082048+00:00 · methodology

discussion (0)

Lean theorems connected to this paper

Citations machine-checked in the Pith Canon. Every link opens the source theorem in the public Lean library.

IndisputableMonolith/Cost.lean (J(x) = ½(x+x⁻¹)−1) washburn_uniqueness_aczel unclear

?

unclear
Relation between the paper passage and the cited Recognition theorem.

We define a lattice A_{n-1} = {(x_1,...,x_n) ∈ Z^n | x_1+...+x_n = 0} ... A finite subset F of L(2) is called an A_n-frame.

What do these tags mean?

matches: The paper's claim is directly supported by a theorem in the formal canon.
supports: The theorem supports part of the paper's argument, but the paper may add assumptions or extra steps.
extends: The paper goes beyond the formal theorem; the theorem is a base layer rather than the whole result.
uses: The paper appears to rely on the theorem as machinery.
contradicts: The paper's claim conflicts with a theorem or certificate in the canon.
unclear: Pith found a possible connection, but the passage is too broad, indirect, or ambiguous to say the theorem truly supports the claim.

Reference graph

Works this paper leans on

17 extracted references

[1]

Bosma, J

W. Bosma, J. Cannon and C. Playoust, The Magma algebra system I: The user language, J. Symbolic Comput.24(1997), 235–265

1997
[2]

Conway and N.J.A

J.H. Conway and N.J.A. Sloane, Sphere packings, lattices and groups, 3rd Edition, Springer, New York, 1999

1999
[3]

Frenkel, J

I. Frenkel, J. Lepowsky and A. Meurman, Vertex operator algebras and the Monster, Pure and Appl. Math., Vol.134, Academic Press, Boston, 1988

1988
[4]

Harada, A

M. Harada, A. Munemasa, Database of Ternary Maximal Self-Orthogonal Codes,https://www.math.is.tohoku.ac.jp/ ~munemasa/research/codes/ mso3.htm
[5]

Harada, A

M. Harada, A. Munemasa, Database of Maximal Self-Orthogonal Codes over GF(5),https://www.math.is.tohoku.ac.jp/ ~munemasa/research/codes/ mso5.htm
[6]

H¨ ohn, Selbstduale Vertexoperatorsuperalgebren und das Babymonster, Dis- sertation, Rheinische Friedrich-Wilhelms-Universitat Bonn, Bonn, 1995

G. H¨ ohn, Selbstduale Vertexoperatorsuperalgebren und das Babymonster, Dis- sertation, Rheinische Friedrich-Wilhelms-Universitat Bonn, Bonn, 1995

1995
[7]

H¨ ohn, Self-dual codes over the Kleinian four group, Math

G. H¨ ohn, Self-dual codes over the Kleinian four group, Math. Ann.327(2003), 227–255. 24 TAKARA KONDO

2003
[8]

H¨ ohn, Conformal designs based on vertex operator algebras,Adv

G. H¨ ohn, Conformal designs based on vertex operator algebras,Adv. Math. 217(2008), 2301–2335

2008
[9]

Humphreys, Introduction to Lie algebras and representation theory, Grad- uate Texts in Mathematics,9

J.E. Humphreys, Introduction to Lie algebras and representation theory, Grad- uate Texts in Mathematics,9. Springer-Verlag, New York-Berlin, 1972

1972
[10]

Kitazume, T

M. Kitazume, T. Kondo, and I. Miyamoto, Even lattices and doubly even codes.J. Math. Soc. Japan43(1991), no. 1, 67–87

1991
[11]

Kondo, Isomorphism problems for Construction A, RIMS Kˆ okyˆ uroku (2025)

T. Kondo, Isomorphism problems for Construction A, RIMS Kˆ okyˆ uroku (2025)

2025
[12]

Lam and H

C.H. Lam and H. Shimakura, On orbifold constructions associated with the Leech lattice vertex operator algebra, Math. Proc. Camb. Philos. Soc.168 (2020) 261–285

2020
[13]

Lam and H

C.H. Lam and H. Shimakura, Extra automorphisms of cyclic orbifolds of lattice vertex operator algebras, Jornal of pure and Applied Algebra228(2024), Article no. 107454

2024
[14]

Martinet, Perfect lattices in Euclidean spaces

J. Martinet, Perfect lattices in Euclidean spaces. Grundlehren Math. Wiss.,
[15]

Springer-Verlag, Berlin, 2003

2003
[16]

Shimakura, AnE 8-approach to the moonshine vertex operator algebra, J

H. Shimakura, AnE 8-approach to the moonshine vertex operator algebra, J. London Math. Soc.83(2011), 493–516

2011
[17]

Shimakura, On isomorphism problems for vertex operator algebras associ- ated with even lattices, Proc

H. Shimakura, On isomorphism problems for vertex operator algebras associ- ated with even lattices, Proc. Amer. Math. Soc.140(2012), 3333–3348. (T. Kondo)Graduate School of Science and Technology, Kumamoto University, Kumamoto 860-8555, Japan Email address:258d9001@st.kumamoto-u.ac.jp

2012