Primitive Vectors in Mathematics

• Primitive vectors are defined as irreducible elements (e.g. having coprime coordinates in ℤⁿ) that serve as the building blocks for bases and support precise counting and equidistribution results.
• They manifest in diverse fields: in planar lattice geometry for rotation numbers, in S-arithmetic dynamics for equidistribution, and in combinatorial settings as criteria for realizability.
• They also have algorithmic significance, enabling efficient extensions of matrices to unimodular forms and forming the basis for robust pseudorandom generation methods and representation-theoretic constructions.

Primitive vectors are vectors singled out by a context-dependent notion of irreducibility, maximality, or highest-weight behavior. In the integer lattice $\mathbb{Z}^n$, a vector is primitive when its coordinates are coprime; in $\mathbb{Z}^2$, sequences of primitive vectors support discrete formulas for rotation numbers; in arithmetic dynamics, primitive vectors on spheres and in $S$-arithmetic lattices are the basic objects in equidistribution and counting theorems; in the combinatorics of the hypercube, a primitive vector is a nonnegative integer normal vector whose prescribed numerical rectangles are all realizable; in multiple-recursive matrix methods, the paper does not isolate “primitive vector” as a separate term, but every nonzero state vector lies on a single maximal cycle when the transition matrix is primitive; and in supergroup representation theory, primitive vectors are highest-weight vectors for the action of a Borel or of the even subgroup (Holmin, 2012, Suyama, 2013, Gioan et al., 2020, Bishoi et al., 2016, Marko, 2016).

1. Primitive lattice vectors in $\mathbb{Z}^n$

In the number-theoretic and lattice-theoretic sense, an integer vector $v=(v_1,\dots,v_n)\in\mathbb{Z}^n$ is primitive if it cannot be written as a nontrivial integer multiple of another integer vector, equivalently if $\gcd(v_1,\dots,v_n)=1$ (Holmin, 2012). Geometrically, such a vector is the first lattice point on its ray from the origin, and lattice-theoretically it is precisely a vector that can be extended to a $\mathbb{Z}$-basis of $\mathbb{Z}^n$ (Holmin, 2012). The same notion is used in the matrix-completion literature: a row vector is primitive exactly when it is a $1\times n$ primitive matrix, and such a vector can be completed to an $n\times n$ unimodular matrix over $\mathbb{Z}^2$0 (Chen et al., 2021).

Two structural characterizations are emphasized in the matrix setting. First, a $\mathbb{Z}^2$1 integer matrix is primitive if and only if for every prime $\mathbb{Z}^2$2 its reduction modulo $\mathbb{Z}^2$3 has full row rank; for a single row this reduces to the usual coprimality test (Chen et al., 2021). Second, when $\mathbb{Z}^2$4, primitiveness is equivalent to the row Hermite normal form condition

$\mathbb{Z}^2$5

so primitive submodules are exactly direct summands of $\mathbb{Z}^2$6 (Chen et al., 2021). This identifies primitive vectors as the atomic one-dimensional cases of primitive matrices.

This lattice notion also governs asymptotic counting. For nonsingular integer $\mathbb{Z}^2$7 matrices of determinant $\mathbb{Z}^2$8 and Euclidean norm at most $\mathbb{Z}^2$9, the subset with primitive rows has the asymptotic

$S$0

while the density inside all determinant-$S$1 matrices is

$S$2

a multiplicative function of $S$3 (Holmin, 2012). For fixed $S$4, $S$5 lies strictly between $S$6 and $S$7, tends to $S$8 along rough sequences, and tends to $S$9 along totally divisible sequences (Holmin, 2012). This suggests that primitiveness is arithmetically local—encoded prime-by-prime—while remaining globally compatible with the geometry of large-norm counting.

2. Primitive vectors in planar lattice geometry and rotation theory

For $\mathbb{Z}^n$0, primitiveness again means $\mathbb{Z}^n$1 (Suyama, 2013). A sequence of primitive vectors

$\mathbb{Z}^n$2

is assumed nondegenerate when

$\mathbb{Z}^n$3

with cyclic indexing $\mathbb{Z}^n$4 (Suyama, 2013). The associated closed polygonal line $\mathbb{Z}^n$5 has rotation number

$\mathbb{Z}^n$6

where $\mathbb{Z}^n$7 is the segment from $\mathbb{Z}^n$8 to $\mathbb{Z}^n$9 (Suyama, 2013).

A special case is the unimodular case, where $v=(v_1,\dots,v_n)\in\mathbb{Z}^n$0 for all $v=(v_1,\dots,v_n)\in\mathbb{Z}^n$1. Then Higashitani–Masuda’s formula expresses the rotation number purely combinatorially: $v=(v_1,\dots,v_n)\in\mathbb{Z}^n$2 with

$v=(v_1,\dots,v_n)\in\mathbb{Z}^n$3

and

$v=(v_1,\dots,v_n)\in\mathbb{Z}^n$4

(Suyama, 2013). For general primitive sequences, the local failure of unimodularity is measured by integers $v=(v_1,\dots,v_n)\in\mathbb{Z}^n$5 and Hirzebruch–Jung continued fractions of $v=(v_1,\dots,v_n)\in\mathbb{Z}^n$6, leading to the formula

$v=(v_1,\dots,v_n)\in\mathbb{Z}^n$7

(Suyama, 2013).

In this setting, primitiveness is the condition that each vector represents a primitive lattice direction, so that each cone $v=(v_1,\dots,v_n)\in\mathbb{Z}^n$8 can be analyzed by lattice index and then resolved into unimodular cones by inserting additional primitive rays (Suyama, 2013). The paper makes explicit that the arithmetic of primitive vectors is the same arithmetic that governs the resolution of cyclic quotient singularities in toric geometry. A plausible implication is that primitiveness here is not merely a gcd condition: it is the discrete regularity assumption that makes a closed polygonal loop amenable to exact topological and toric formulas.

3. Arithmetic counting, spheres, and equidistribution

Primitive vectors are central in the study of lattice points on spheres and in $v=(v_1,\dots,v_n)\in\mathbb{Z}^n$9-arithmetic homogeneous dynamics. In $\gcd(v_1,\dots,v_n)=1$0, the primitive points on the sphere of squared radius $\gcd(v_1,\dots,v_n)=1$1 are

$\gcd(v_1,\dots,v_n)=1$2

and each such $\gcd(v_1,\dots,v_n)=1$3 determines both a direction $\gcd(v_1,\dots,v_n)=1$4 and an orthogonal lattice

$\gcd(v_1,\dots,v_n)=1$5

of covolume $\gcd(v_1,\dots,v_n)=1$6 (Aka et al., 2014). After normalization, the shape of $\gcd(v_1,\dots,v_n)=1$7 defines a point in

$\gcd(v_1,\dots,v_n)=1$8

and the paper proves joint equidistribution of directions and orthogonal grids in dimensions $\gcd(v_1,\dots,v_n)=1$9, and in dimensions $\mathbb{Z}$0 under the congruence restriction $\mathbb{Z}$1 for a fixed odd prime $\mathbb{Z}$2 (Aka et al., 2014). The limiting measure is the product $\mathbb{Z}$3 on the sphere and the space of orthogonal grids (Aka et al., 2014).

A finer invariant is the shortest solution $\mathbb{Z}$4 to the gcd equation

$\mathbb{Z}$5

for a primitive vector $\mathbb{Z}$6, together with the covering radius $\mathbb{Z}$7 of the orthogonal lattice $\mathbb{Z}$8 (Horesh et al., 2019). The normalized lengths $\mathbb{Z}$9 equidistribute in $\mathbb{Z}^n$0 with respect to a measure $\mathbb{Z}^n$1; this measure is Lebesgue only when $\mathbb{Z}^n$2, and non-Lebesgue otherwise (Horesh et al., 2019). By contrast, for $\mathbb{Z}^n$3 the naive normalization $\mathbb{Z}^n$4 collapses to zero along a full density set of primitive vectors, so no nontrivial equidistribution exists in that scale (Horesh et al., 2019). This shows that the geometry of the orthogonal lattice, rather than the norm of $\mathbb{Z}^n$5 itself, is the correct normalizing datum for the gcd equation in higher dimension.

The $\mathbb{Z}^n$6-adic analogue considers primitive vectors in $\mathbb{Z}^n$7 as points of the $\mathbb{Z}^n$8-adic unit sphere

$\mathbb{Z}^n$9

and proves joint equidistribution of

$1\times n$0

with respect to $1\times n$1 as $1\times n$2, with rate $1\times n$3 and $1\times n$4 (Guilloux et al., 2021). Here the real norm orders the primitive vectors, while the $1\times n$5-adic component records a local direction. The limiting product measure suggests asymptotic independence between the real and $1\times n$6-adic directional data.

At the level of $1\times n$7-arithmetic lattices, primitive vectors in $1\times n$8 are defined by

$1\times n$9

equivalently by the condition $n\times n$0 (Fairchild et al., 2023). For the primitive $n\times n$1-Siegel transform

$n\times n$2

the mean value formula is

$n\times n$3

and for $n\times n$4 the primitive second moment has the Rogers-type form

$n\times n$5

(Fairchild et al., 2023). These formulas yield quantitative counting of primitive $n\times n$6-arithmetic lattice points, Schmidt-type asymptotics for primitive integer vectors with congruence conditions, quantitative Khintchine–Groshev theorems over primitive sets, and an $n\times n$7-arithmetic logarithm law for unipotent flows (Fairchild et al., 2023). In all of these results, primitiveness is the condition that removes scalar redundancy and exposes the genuinely geometric distribution.

4. Primitive vectors as rows of primitive matrices

A $n\times n$8 integer matrix $n\times n$9 is primitive if

$\mathbb{Z}^2$00

so its row span is a direct summand of $\mathbb{Z}^2$01 (Chen et al., 2021). When $\mathbb{Z}^2$02, this recovers the primitive-vector condition. The paper emphasizes that a square primitive matrix is unimodular and that a $\mathbb{Z}^2$03 primitive matrix can always be extended to an $\mathbb{Z}^2$04 unimodular matrix over $\mathbb{Z}^2$05 (Chen et al., 2021).

The probabilistic extension problem starts with a fixed primitive matrix $\mathbb{Z}^2$06, $\mathbb{Z}^2$07, and appends $\mathbb{Z}^2$08 random rows with entries chosen independently and uniformly from $\mathbb{Z}^2$09 (Chen et al., 2021). If $\mathbb{Z}^2$10 is the resulting $\mathbb{Z}^2$11 matrix, then

$\mathbb{Z}^2$12

and a simpler lower bound is

$\mathbb{Z}^2$13

(Chen et al., 2021). For $\mathbb{Z}^2$14 and $\mathbb{Z}^2$15, this lower bound is at least $\mathbb{Z}^2$16 (Chen et al., 2021). Specializing to $\mathbb{Z}^2$17, this gives a quantitative statement on how often a fixed primitive vector can be extended by random rows to a larger primitive family.

This probabilistic fact is converted into an algorithmic completion theorem. The paper proves that there exists a fast Las Vegas algorithm that completes a $\mathbb{Z}^2$18 primitive matrix to an $\mathbb{Z}^2$19 unimodular matrix within expected $\mathbb{Z}^2$20 bit operations, where $\mathbb{Z}^2$21 is the exponent of matrix multiplication (Chen et al., 2021). For primitive vectors, this means that extension to a unimodular basis is not only possible in principle but can be performed with nearly optimal linear-algebraic complexity.

Placed next to the asymptotic counting theorem for determinant-$\mathbb{Z}^2$22 matrices with primitive rows (Holmin, 2012), this suggests a coherent picture: the primitive-vector condition is simultaneously a local congruence condition, a direct-summand condition, and an algorithmically stable property under random completion.

5. Combinatorial and pseudorandom meanings

In the oriented-matroid study of the real affine cube over

$\mathbb{Z}^2$23

a primitive vector is a nonnegative integer vector $\mathbb{Z}^2$24 such that all of its 3- and 4-numerical rectangles are realizable (Gioan et al., 2020). For

$\mathbb{Z}^2$25

the $\mathbb{Z}^2$26-level is

$\mathbb{Z}^2$27

and an $\mathbb{Z}^2$28-rectangle is a quadruple $\mathbb{Z}^2$29 with $\mathbb{Z}^2$30 (Gioan et al., 2020). Realizability means that there is an actual signed geometric rectangle in the affine cube with vertices lying in the prescribed levels. The paper proves that for a primitive vector $\mathbb{Z}^2$31, every level $\mathbb{Z}^2$32 is nonempty, every non-extremal level contains at least two elements, and if $\mathbb{Z}^2$33, then

$\mathbb{Z}^2$34

is again primitive (Gioan et al., 2020). Primitive vectors are then used to define primitive hyperplanes whose cocircuits are forced in any oriented cube; this yields a proof that for $\mathbb{Z}^2$35, the real affine cube is uniquely determined by its signed rectangles and its signed cocircuits complementary of its facets and skew-facets (Gioan et al., 2020). In this context, primitiveness is neither gcd-based nor dynamical: it is a complete rectangular realizability condition across level sets.

A different usage occurs in pseudorandom generation by the multiple-recursive matrix method (MRMM). Here one works over $\mathbb{Z}^2$36 and considers the recurrence

$\mathbb{Z}^2$37

with transition matrix $\mathbb{Z}^2$38 (Bishoi et al., 2016). An MRMM is primitive if every nonzero initial state has period exactly

$\mathbb{Z}^2$39

equivalently if $\mathbb{Z}^2$40 has multiplicative order $\mathbb{Z}^2$41, equivalently if the characteristic polynomial $\mathbb{Z}^2$42 is primitive of degree $\mathbb{Z}^2$43 over $\mathbb{Z}^2$44 (Bishoi et al., 2016). The paper does not introduce “primitive vector” as a separate term, but it states that the nonzero vectors in the state space $\mathbb{Z}^2$45 form a single orbit under $\mathbb{Z}^2$46, so every nonzero state vector is primitive in the sense of lying on the unique long cycle of a Singer cycle (Bishoi et al., 2016). This suggests a distinct, orbit-theoretic meaning of primitive vector: not indivisible in a lattice, but dynamically generating the full nonzero state space under iteration.

6. Primitive vectors in supergroup representation theory

For the general linear supergroup

$\mathbb{Z}^2$47

over an algebraically closed field, with even subgroup

$\mathbb{Z}^2$48

primitive vectors are highest-weight vectors for a Borel action (Marko, 2013). A vector $\mathbb{Z}^2$49 in a rational $\mathbb{Z}^2$50-supermodule is primitive if the line $\mathbb{Z}^2$51 is stabilized by the Borel subsupergroup $\mathbb{Z}^2$52; a vector is $\mathbb{Z}^2$53-primitive if $\mathbb{Z}^2$54 is stabilized by the even Borel $\mathbb{Z}^2$55, equivalently if it is a weight vector annihilated by the positive even root spaces (Marko, 2013). The relevant induced supermodule is

$\mathbb{Z}^2$56

and as a $\mathbb{Z}^2$57-module it decomposes as

$\mathbb{Z}^2$58

(Marko, 2016).

The first floor

$\mathbb{Z}^2$59

admits explicit $\mathbb{Z}^2$60-primitive vectors $\mathbb{Z}^2$61 of weight

$\mathbb{Z}^2$62

under the usual dominance conditions on $\mathbb{Z}^2$63 (Marko, 2013). In characteristic $\mathbb{Z}^2$64, these $\mathbb{Z}^2$65 form a complete set of primitive vectors in $\mathbb{Z}^2$66, and $\mathbb{Z}^2$67 is a direct sum of induced $\mathbb{Z}^2$68-modules with highest weights $\mathbb{Z}^2$69 (Marko, 2013). For higher floors

$\mathbb{Z}^2$70

the paper constructs vectors $\mathbb{Z}^2$71 indexed by admissible multiindices $\mathbb{Z}^2$72, and under suitable robustness conditions these form bases of the spaces of $\mathbb{Z}^2$73-primitive vectors of given weight (Marko, 2013).

The later paper refines this classification in the polynomial case. It constructs explicit even-primitive vectors in the largest polynomial subsupermodule $\mathbb{Z}^2$74 and in the corresponding costandard supermodule for the Schur superalgebra $\mathbb{Z}^2$75 (Marko, 2016). The basis is indexed by marked tableaux, and for each marked tableau $\mathbb{Z}^2$76 one obtains an even-primitive vector

$\mathbb{Z}^2$77

a linear combination of the basic $\mathbb{Z}^2$78 with prescribed content (Marko, 2016). This yields a basis of all $\mathbb{Z}^2$79-primitive vectors of a given polynomial weight and realizes Littlewood–Richardson multiplicities as dimensions of explicit highest-weight spaces (Marko, 2016). In this representation-theoretic context, primitive vectors are not indivisible lattice points but generators of highest-weight submodules.

Across these settings, “primitive vector” does not denote a single invariant notion. It denotes, depending on the ambient structure, a coprime lattice point, a primitive lattice direction in a polygonal fan, a generic state on a maximal cycle, a hyperplane normal with full rectangle realizability, or a highest-weight vector. What persists is the role of primitiveness as a condition that removes redundancy and exposes the irreducible geometric, arithmetic, combinatorial, or representation-theoretic content of the vector under study.