Symmetric compatibility of theta structures, with applications to change of level and isogenies

summary

The gist

This paper presents a general framework for computing change of level and isogeny algorithms between marked abelian varieties over a field of odd characteristic…

In short

The paper develops a general framework for computing change of level and isogeny algorithms between marked abelian varieties over fields of odd characteristic. It establishes that Mumford compatibility and $f$-compatibility are equivalent, allowing for robust computations even when the degree $d$ is even or when the level $m$ and degree are not coprime. This provides deterministic algorithms for changing levels and finding theta null points.

Key concepts

Symmetric Compatibility
This concept relates to how a theta structure behaves under certain group actions, specifically involving torsion points and level subgroups. It is crucial for extending a theta structure from one level (m) to another (n=md). The paper uses this compatibility to define necessary conditions for structures to be related.
Mumford Compatibility
This is a specific notion of compatibility derived from Mumford's theory. It serves as the benchmark condition against which other compatibility notions are measured. The paper proves that two partial theta structures are $f$-compatible if and only if they satisfy this Mumford compatibility condition.
$f$-Compatibility
This is a notion of compatibility specifically related to the isogeny $f$ between abelian varieties. It links the structure of the theta group action to the properties of the map $f$. The core result shows that this definition is equivalent to Mumford compatibility, simplifying algorithmic choices.
Change of Level Algorithm
This deterministic procedure allows one to compute a new theta structure (type K(n)) starting from an existing one (type K(m)). It achieves this in polynomial time, specifically O(n^2g log d), providing a practical method for modifying the level of the variety.

Terminology used across episodes

This episode discusses

The paper

Symmetric compatibility of theta structures, with applications to change of level and isogenies · Read on arXiv

Transcript

Introduction to the show: ident: Computer Science. The day in computer science: software, systems and theory on arXiv.

Tom: We're looking at the paper: "Symmetric compatibility of theta structures, with applications to change of level and isogenies".

Jane: Here's the gist of the paper. This paper presents a general framework for computing change of level and isogeny algorithms between marked abelian varieties over a field of odd characteristic, extending previous results to cases where the degree d is even or when d and the level m are not coprime.

Tom: The core theoretical machinery relies on defining and utilizing concepts related to symmetric compatibility for theta structures, which are crucial for extending a theta structure from level m to level n=md.

Jane: The paper introduces notions of symmetric compatibility for torsion points and level subgroups based on the action of the Theta group and specific conditions involving lifts in the group G(L).

Tom: This framework is central to establishing equivalences between different definitions of compatibility.

Paper summary: Tom: So we've covered the core idea of Aquino and Lubicz's paper, "Symmetric compatibility of theta structures, with applications to change of level and isogenies." They show how to compute these things even when the standard assumptions about d or m being coprime don't hold.

Jane: The main thing they claim is that by introducing symmetric compatibility for theta structures, they can build deterministic algorithms for changing the level and computing d-isogenies between marked abelian varieties >

Lu: It’s really a big theoretical step because it connects Mumford's theory with the practical computation of these structures, proving that Mumford compatibility is equivalent to f-compatibility >

Meng: For us on the engineering side, this means we can build more general tools for transformation algorithms without having to manually check every single constraint every time >

Tom: I think what matters most is that they provide concrete running times. They give us O of n squared g log d > for change of level and O of n g log d > for the isogeny computation >

Jane: In simple terms, this paper gives us a reliable way to move between different levels and perform these isogenies in a general setting, which used to be restricted to much simpler cases like when d was odd and coprime to m >

Lu: It opens up the door for applying these kinds of transformations in situations where we don't have those nice, simple number theoretic conditions satisfied >

Conclusion: Tom: So this paper is about finding a general way to handle change of level and isogeny calculations between marked abelian varieties, even when the usual rules about degrees or levels not sharing factors don't apply.

Jane: It’s tackling these problems by introducing this idea of symmetric compatibility for theta structures. It seems like they are building a bridge between different ways people define compatibility, which is a big theoretical hurdle in this field.

Lu: Yeah, the core mechanism is showing that Mumford compatibility and f-compatibility are actually the same thing when you look at these specific conditions involving torsion points and level subgroups. That equivalence is what makes their whole framework work.

Meng: If they can prove that Mumford compatibility means f-compatibility, then we have a solid foundation for building something deterministic instead of something heuristic. That's what I care about because we need things to run reliably on production systems.

Lalam: What this means practically is they’ve set up algorithms that are guaranteed to work, not just in theory but with specific running times like O of n squared g log d for changing the level.

Tom: The complexity numbers are what really grab my attention here; O of n squared g log d sounds like a lot, but it’s deterministic for this specific task. That’s a big win because usually these kinds of problems get messy with non-deterministic checks.

Jane: So, the main takeaway is that we don't have to worry as much about the specifics of d or the level m being coprime when we want to compute these transformations. It makes the toolbox much more versatile for us.

Lu: Exactly; it’s providing a robust framework that works generally, which means we can apply this to a wider variety of geometric situations than before, even if the underlying number theory is trickier.

Meng: For deployment, it suggests we can automate these complex transformations without needing custom code for every single edge case in the degree or level relationship. That could save us a ton of development time down the line.

Lalam: It’s a general method, and that means we can use it to solve problems we hadn't even thought possible with our current tools because they weren't restricted by those coprime conditions anymore.

Tom: So they’ve essentially unified two different ways of thinking about these structures—the Mumford way and the f-way—and shown how you can use that equivalence to get fast, reliable algorithms for level changes and isogenies.

Jane: It’s about making the abstract theory of theta structures concrete enough so we can actually build something functional for computation, which is what this paper really achieves.

Lu: The next step will be seeing how these algorithms perform on really large examples to confirm those time complexities hold up in practice, which is where the real validation happens.

Meng: I’m curious about the implementation details of Algorithm seven and eight; if we can actually map that abstract compatibility condition into a deployable code structure, then this moves from interesting theory to something useful for us.

More episodes

← Home