Multiplicative Ehresmann connections for Lie groupoid fibrations

This paper introduces and studies multiplicative Ehresmann connections for Lie groupoid fibrations, establishing existence criteria for specific classes of submersions and characterizing the completeness of these connections in relation to the underlying bundle structures.

The Gist

Imagine you are a conductor of a massive, complex orchestra. This orchestra isn't just a group of musicians; it is a Lie Groupoid—a highly organized system where every musician (an "arrow") has a specific role, a starting position (the "source"), and a destination (the "target"), and they all follow strict rules about how they can play together (the "multiplication").

Now, imagine this orchestra is part of a larger musical festival. The festival itself has its own structure, and there is a way to map the musicians' movements to the festival's schedule. This relationship is what mathematicians call a fibration.

This paper, written by Matthijs Lau and Ioan Mărcut, is essentially a manual on how to keep this massive, multi-layered musical performance perfectly in sync.

1. The Problem: The "Sync" Issue

In a normal orchestra, a conductor uses a connection (like a baton or a metronome) to ensure that if one violinist speeds up, the rest of the section follows suit in a predictable way. This is an "Ehresmann connection."

But in a Lie Groupoid, things are much harder. You don't just have musicians; you have relationships between musicians. If a violinist moves, it doesn't just affect their position; it affects their relationship to the cellist, the percussionist, and the entire structure of the song.

A standard "metronome" isn't enough. You need a Multiplicative Ehresmann Connection. This is a "Super-Metronome" that doesn't just track individual movements, but tracks how those movements interact and multiply together. It ensures that if Musician A and Musician B perform a specific duet, the "sync" of that duet is preserved throughout the entire festival.

2. The Discovery: It’s Not Always Possible

The authors start by asking: Can we always find this Super-Metronome?

Surprisingly, the answer is no. They show that even if your orchestra is very well-behaved (what they call "proper"), you might still run into a situation where a perfect sync is mathematically impossible.

The Analogy: Imagine a dance troupe where the dancers are required to move in pairs. If the rules of the dance are too chaotic (like a "non-trivial action"), you might find that no matter how good your conductor is, the pairs will eventually drift apart and lose their rhythm. The "Super-Metronome" simply cannot exist in that specific type of chaos.

3. The Success Stories: When Sync Works

However, the authors find several "Golden Rules" where the Super-Metronome is guaranteed to exist:

• Morita Fibrations: Think of this as two orchestras playing the exact same music in different rooms. Because they are essentially "mirror images," syncing them is easy.
• Families of Lie Groupoids: This is like having a series of small ensembles that change slightly over time. If the change is smooth and predictable (locally trivial), you can definitely keep them in sync.

4. The Grand Finale: Completeness

The most important part of the paper is about Completeness.

In music, "completeness" means that if you start a melody, the conductor can carry it all the way to the final note without the rhythm breaking down or the musicians getting lost.

The authors prove a beautiful mathematical "shortcut": To know if the entire massive festival is in sync (the whole groupoid), you only need to check two smaller things:

1. The Kernel: The "inner circle" of musicians who are only playing the core notes.
2. The Base: The main rhythm section that sets the tempo for everyone else.

If the inner circle stays in sync and the rhythm section stays in sync, the entire massive, complex festival is guaranteed to stay in sync.

Summary in a Nutshell

This paper provides the mathematical blueprints for maintaining perfect, structural harmony in highly complex, multi-layered systems. It tells us when we can expect perfect coordination, when chaos will make coordination impossible, and how to check the stability of a massive system by looking at its smallest, most essential parts.

Technical Summary

This paper, "Multiplicative Ehresmann Connections for Lie Groupoid Fibrations" by Matthijs Lau and Ioan Mărcut, extends the theory of multiplicative connections from the specific case of Lie groupoid extensions to the broader class of Lie groupoid fibrations (surjective submersions of Lie groupoids where the base map is not necessarily the identity).

Below is a detailed technical summary of the work.

---

1. The Problem: Beyond Extensions

In classical differential geometry, an Ehresmann connection allows for the lifting of paths from a base manifold to a total space. In the context of Lie groupoids, a connection is multiplicative if its horizontal distribution is compatible with the groupoid structure (specifically, it forms a VB-subgroupoid of the tangent groupoid).

Prior research (e.g., [LGSX09], [FM23]) focused on Lie groupoid extensions, where the base map is the identity. In that setting, existence and completeness are well-understood. However, when the base map $\pi_0: M \to N$ is a non-trivial surjective submersion, the existence of a multiplicative connection is no longer guaranteed, even for proper groupoids. The authors aim to:

1. Define multiplicative Ehresmann connections (MECs) for general surjective submersions.
2. Determine the conditions under which these connections exist.
3. Characterize the conditions for their completeness (the ability to lift all paths).

2. Methodology

The authors employ tools from VB-groupoid theory, Lie algebroid theory, and the geometry of foliations.

• Definition of MECs: They define a MEC through three equivalent characterizations: a multiplicative horizontal lift (a VB-groupoid morphism), a multiplicative vertical projection, or a horizontal distribution $Hor \subset TG$ that is a VB-subgroupoid.
• Geometric Interpretation: They use the "current groupoid" of smooth paths to characterize multiplicativity. A connection is multiplicative if and only if the subgroupoid of horizontal paths is a subgroupoid of the path groupoid.
• Averaging Techniques: To prove existence in the proper case, they utilize linear averaging operators along $t$-fibres, a standard technique in the study of proper Lie groupoids, to "force" a standard Ehresmann connection to become multiplicative.

3. Key Contributions and Results

A. Existence Results (Theorem 1.1)

The authors show that while existence can fail for general surjective submersions (e.g., non-trivial action morphisms), MECs always exist for the following classes:

1. Morita fibrations (inductors).
2. Proper uniform Lie groupoid fibrations.
3. Locally trivial families of Lie groupoids.
4. Proper families of Lie groupoids.

B. Completeness and the Kernel (Theorem 1.2)

A major contribution is the reduction of the completeness problem. For a Lie groupoid fibration $\pi: G \to H$, the completeness of the MEC on $G$ is intrinsically linked to the completeness of the induced connection on the kernel bundle $K = \ker \pi$.

• Theorem 5.2: A MEC on a fibration is complete if and only if the induced MEC on the kernel is complete.
• Theorem 5.6: If the kernel is source-connected, the completeness of the MEC on $G$ is equivalent to the completeness of the induced connection on the base $M$.

C. Local Triviality of Families (Theorem 1.3)

The paper provides a groupoid-theoretic analogue to a classical result by Mathias del Hoyo. For a family of Lie groupoids where the total groupoid is source-proper:

• The family is locally trivial if and only if it admits a complete multiplicative Ehresmann connection.

4. Significance

This paper is significant for several reasons:

• Unification: It provides a unified framework that generalizes classical Ehresmann connections, linear connections on vector bundles, and multiplicative connections on extensions.
• Poisson Geometry & Stacks: By providing local models for multiplicative connections, the work supports the study of non-abelian differentiable gerbes over stacks and local models in Poisson geometry.
• Structural Insight: It clarifies the relationship between the algebraic structure of a groupoid morphism (the kernel and the base) and the geometric property of path-lifting (completeness). It demonstrates that for "well-behaved" groupoids (fibrations), the global geometry is controlled by the kernel and the base.