🔢 mathematics

Rational Points in Weighted Projective Spaces over Finite Fields

This paper establishes the equivalence of three definitions of rational points on weighted projective spaces over finite fields and derives explicit combinatorial formulas for their enumeration, including closed expressions for smooth and singular loci that confirm the rationality of the associated zeta function.

Original authors: Sajad Salami, Tanush Shaska

Published 2026-04-14

📖 6 min read🧠 Deep dive

CC BY 4.0

Original authors: Sajad Salami, Tanush Shaska

Original paper licensed under CC BY 4.0 (http://creativecommons.org/licenses/by/4.0/). ✨ This is an AI-generated explanation of the paper below. It is not written or endorsed by the authors. For technical accuracy, refer to the original paper. Read full disclaimer

Imagine you are an architect designing a city, but this isn't a normal city. In this city, the rules of perspective are different. In a standard city (like a normal Projective Space), if you zoom in or out, everything scales up or down equally. A house looks like a tiny house or a giant house, but it's still a house.

But in this paper, the authors are studying a "Weighted City" (Weighted Projective Space). Here, the rules are quirky. If you zoom in, the "houses" (coordinates) don't just get bigger; they get bigger at different speeds.

One street might scale by 1x.
Another street might scale by 2x.
A third might scale by 5x.

This creates a city with strange corners and "kinks" (mathematical singularities) where the geometry gets messy. The authors, Salami and Shaska, are trying to answer a very specific question: If we build this city over a tiny, finite grid (a Finite Field), how many distinct "locations" or "points" can we actually find?

Here is the breakdown of their discovery, using simple analogies:

1. The Confusion: What is a "Point"?

In this weird weighted city, there was some confusion about what counts as a "real" location.

Definition A: Is a point real only if you can write down its address using standard numbers?
Definition B: Is a point real if it stays the same when you apply a "magic mirror" (the Frobenius automorphism) that shuffles the numbers?
Definition C: Is a point real if its "home base" is the standard field?

The Paper's First Big Win: The authors proved that for all practical purposes, these three definitions are actually the same thing. It's like proving that "a house," "a building with a roof," and "a place you can live in" all refer to the same structure in this specific city. This clears up the confusion so everyone can start counting.

2. The Counting Game: Burnside's Lemma as a Dance Floor

To count the points, the authors used a tool called Burnside's Lemma.

The Analogy: Imagine a dance floor where people are spinning. Some people are spinning fast, some slow. You want to count how many unique dance formations exist, ignoring the fact that everyone is just spinning.
The Math: Instead of trying to list every single point (which is impossible for large cities), they looked at the "symmetries." They asked: "If I rotate the city by a certain amount, how many points stay exactly where they are?"
The Result: By adding up these "staying put" points for all possible rotations and averaging them, they derived a precise formula to count the total number of locations. They also found a second, faster way to count using a "Greatest Common Divisor" (GCD) method, which is like grouping people by the size of their shoes to count them faster.

3. The "Smooth" vs. The "Bumpy"

The city isn't perfectly smooth. Because of the different scaling rules, some areas are "smooth" (like a flat park), and others are "bumpy" or "singular" (like a jagged mountain peak where the rules break down).

The Breakdown: The authors split the city into two zones:
1. The Smooth Zone: Where the geometry behaves nicely.
2. The Singular Zone: The messy, kinked corners.
The Discovery: They created separate formulas to count the points in the smooth zone and the bumpy zone. This is important because the "bumpy" parts contribute to the total count in a very specific, predictable way.

4. The "Zeta Function": The City's DNA

In mathematics, there is a special tool called a Zeta Function. Think of this as the DNA or the fingerprint of the city. It encodes the entire history of how many points exist as you expand the city's grid size.

Rationality: They proved that this DNA is "rational," meaning it can be written as a simple fraction (a ratio of two polynomials). It's not a chaotic, infinite mess; it has a clean, predictable structure.
The Decomposition: They showed that the DNA of the whole city is just the product of the DNA of the Smooth Zone and the DNA of the Bumpy Zone.
The Riemann Hypothesis: This is a famous, difficult math puzzle. The authors showed that their weighted city obeys the "Riemann Hypothesis" part of the rules (the points are distributed in a very specific, balanced way), even though the city is bumpy.

5. The Twist: Normalization Doesn't Work

Here is the most surprising part.

The Idea: In normal math, if you have a city with weights (2, 4, 6) and you divide them all by 2 to get (1, 2, 3), you usually think, "Oh, that's just the same city, just scaled down."
The Reality: In this weighted world over finite fields, it is NOT the same city.
The Analogy: Imagine you have a recipe for a cake. If you double the ingredients, you get a bigger cake. But if you change the type of flour (the weights) and then try to simplify the recipe, the taste (the Zeta function) changes completely.
The Lesson: The "fingerprint" (Zeta function) of the city depends on the exact weights you started with. You cannot just simplify the weights and expect the math to stay the same. This is a crucial discovery because it means the "weight" is a fundamental part of the city's identity, not just a label.

Why Does This Matter?

You might ask, "Who cares about counting points in a weird, bumpy city?"

Coding Theory: The authors mention this is useful for Quantum Codes. Think of these points as "checkpoints" in a digital message. If you know exactly how many checkpoints exist and where the "bumps" are, you can build better error-correcting codes that don't crash when data gets corrupted.
Understanding Complexity: It helps mathematicians understand how "singular" (messy) spaces behave. Most math textbooks focus on perfect, smooth shapes. This paper gives us the tools to handle the messy, real-world shapes that appear in advanced physics and cryptography.

Summary

Salami and Shaska took a confusing, bumpy, weighted mathematical space and:

Agreed on what a "point" actually is.
Invented a fast way to count them using symmetry.
Split the space into "smooth" and "bumpy" parts to count them separately.
Proved that the space's "fingerprint" (Zeta function) is clean and predictable, even though the space is messy.
Discovered that you can't just "simplify" the weights without changing the fundamental nature of the space.

It's a map for navigating a strange, distorted universe, showing us that even in the most twisted geometries, there is a hidden order waiting to be counted.

1. Problem Statement

The paper addresses the arithmetic geometry of weighted projective spaces ( $P^n_w$ ) over finite fields ( $\mathbb{F}_q$ ). Unlike classical projective spaces where coordinates scale uniformly, weighted projective spaces involve a non-standard scaling action $(x_0, \dots, x_n) \sim (\lambda^{w_0}x_0, \dots, \lambda^{w_n}x_n)$ defined by a weight vector $w = (w_0, \dots, w_n)$ .

The authors identify three specific challenges in this setting:

Ambiguity in Definition: There are multiple, non-equivalent definitions of what constitutes an $\mathbb{F}_q$ -rational point in a weighted space (strict coordinate definition vs. Frobenius invariance vs. field of definition).
Enumeration Complexity: The presence of orbifold singularities and non-trivial stabilizer groups under the scaling action complicates the counting of rational points, rendering standard formulas for classical projective spaces insufficient.
Zeta Function Behavior: It is unclear how the singularities and weight normalization affect the rationality, functional equations, and the Riemann Hypothesis component of the associated zeta function $Z(P^n_w, t)$ .

2. Methodology

The authors employ a combination of algebraic geometry, group theory, and combinatorics:

Equivalence of Definitions: The paper rigorously analyzes three definitions of rational points (G-invariance, field of definition, and existence of an $\mathbb{F}_q$ -representative) to establish their equivalence under standard interpretations.
Burnside's Lemma: To count orbits under the weighted scaling action of $\mathbb{F}_q^*$ , the authors utilize Burnside's Lemma. This involves calculating the number of fixed points for each group element $\lambda \in \mathbb{F}_q^*$ .
Combinatorial Stratification: The space is stratified based on the support of points (the set of indices $S$ where coordinates are non-zero) and the greatest common divisor (GCD) of the corresponding weights ( $k_S = \gcd(\{w_i\}_{i \in S})$ ).
Normalization Analysis: The authors investigate the relationship between a weighted space $P^n_w$ and its normalized version $P^n_{w'}$ (where weights are divided by their GCD), analyzing how point counts and zeta functions change under this transformation.
Stratification of Loci: The space is decomposed into a smooth (weak) locus ( $WP^n_w$ ) and a singular locus ( $\text{Sing}(P^n_w)$ ) to derive separate counting formulas and zeta functions for each component.

3. Key Contributions and Results

A. Equivalence of Rational Point Definitions

The paper proves that under standard assumptions, the following three definitions are equivalent for a point $x \in P^n_w$ :

G-invariance: The Frobenius map sends the point to an equivalent point (i.e., $x_i^q = \lambda^{w_i} x_i$ for some $\lambda$ ).
Field of Definition: The field generated by the point is $\mathbb{F}_q$ .
Existence of Representative: There exists a representative of the point with all coordinates in $\mathbb{F}_q$ .

Note: The authors clarify that a "strict" interpretation (requiring the given representative to have coordinates in $\mathbb{F}_q$ ) is a stronger condition and generally not equivalent to the others.

B. Explicit Enumeration Formulas

The authors derive two primary formulas for the number of $\mathbb{F}_q$ -rational points $|P^n_w(\mathbb{F}_q)|$ :

Burnside's Lemma Formula:
$|P^n_w(\mathbb{F}_q)| = \frac{1}{q-1} \sum_{\lambda \in \mathbb{F}_q^*} (q^{N(\lambda)} - 1)$
where $N(\lambda)$ is the number of indices $i$ such that $\lambda^{w_i} = 1$ .
Combinatorial Stratification Formula:
$|P^n_w(\mathbb{F}_q)| = \sum_{\emptyset \neq S \subseteq \{0,\dots,n\}} (q-1)^{|S|-1} \cdot \gcd(k_S, q-1)$
where $k_S = \gcd(\{w_i \mid i \in S\})$ . This formula is computationally efficient for large fields.

C. Weight Normalization and Discrepancies

The paper demonstrates that point counts are not invariant under weight normalization in positive characteristic.

If $w' = w/d$ (where $d = \gcd(w)$ ), the number of points in $P^n_w$ and $P^n_{w'}$ are related by a formula involving $d' = \gcd(d, q-1)$ .
Equality holds if and only if $d' = 1$ . Otherwise, strict inequalities arise, and the relationship depends on the specific field structure and weights.

D. Singular vs. Smooth Loci

The authors provide closed-form expressions for the number of points in the singular and smooth loci:

Singular Loci ( $\text{Sing}(P^n_w)$ ): Points where $k_S > d$ .
Smooth Loci ( $WP^n_w$ ): Points where $k_S = d$ .
This stratification allows for precise counting of singular points, which is crucial for understanding the orbifold structure.

E. Zeta Function Analysis

The paper establishes deep properties of the zeta function $Z(P^n_w, t)$ :

Rationality: $Z(P^n_w, t)$ is proven to be a rational function of $t$ , expressible as a finite product of terms of the form $(1 - (tq^j)^{o_d})^{\pm 1}$ .
Multiplicative Decomposition: The zeta function decomposes according to the geometric stratification:
$Z(P^n_w, t) = Z(WP^n_w, t) \cdot Z(\text{Sing}(P^n_w), t)$
Riemann Hypothesis: The reciprocals of the roots and poles satisfy the Weil conjectures' magnitude condition ( $|\alpha| = q^j$ ).
Failure of Functional Equation: Unlike smooth projective varieties, $P^n_w$ generally does not satisfy the standard functional equation due to the presence of singularities and the alternating signs in the point-counting expansion.
Non-Invariance: The zeta function is not an invariant of the abstract variety; $Z(P^n_w, t) \neq Z(P^n_{w'}, t)$ even if the spaces are isomorphic as abstract varieties, highlighting the dependence on the weighted embedding.

4. Significance and Applications

Arithmetic Theory: The work provides a foundational framework for the arithmetic of singular spaces (orbifolds) over finite fields, extending classical results from smooth varieties.
Computational Utility: The derived combinatorial formulas allow for efficient calculation of point counts for high-dimensional spaces and large finite fields, which is difficult using geometric methods alone.
Coding Theory: The results have direct applications in the design of graded quantum codes and error-correcting codes, where precise rational point counts determine code parameters and fault tolerance.
Moduli Spaces: The methods generalize previous work on Humbert surfaces and moduli spaces of curves with split Jacobians, offering tools for higher-dimensional orbifold settings.
Future Directions: The paper sets the stage for studying weighted hypersurfaces, complete intersections, and the development of weighted height functions and entropy invariants for rational points.

In summary, Salami and Shasha resolve fundamental ambiguities in defining rational points on weighted projective spaces, provide exact combinatorial counting tools, and reveal the complex, non-invariant nature of their zeta functions, bridging the gap between algebraic geometry, number theory, and coding theory.