Failure of Ado-type theorems for preLie and postLie algebras

Vsevolod Gubarev

Home/Archive/arXiv

arXiv · 2609.29582

Failure of Ado-type theorems for preLie and postLie algebras

Vsevolod Gubarev

View original source ↗Read source document ↗Export metadata ↓

Abstract

Over an arbitrary field of characteristic zero, we construct a two-dimensional preLie algebra and a two-dimensional postLie algebra that do not embed into the corresponding induced structures of any finite-dimensional preassociative or postassociative algebra, respectively.

Explore related subjects

math.RA

Keep this discovery

Explore connections, maps & timelines

BibTeX RIS

Vsevolod Gubarev. 2026-08-27. Failure of Ado-type theorems for preLie and postLie algebras. https://arxiv.org/abs/2609.29582

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Fast factorization in diagram monoids

We give explicit algorithms that factor elements of the standard diagram monoids into their usual generators. These algorithms generalize sorting from permutations to partial matchings and set partitions. In every case the worst-case complexity is $n^2$, which is optimal for algorithms that explicitly list the factors. We also determine the average complexity of our algorithms.

math.RA↗

arXiv2026

Asymptotic completions of preordered semirings

The study of preordered semirings is motivated by applications in computer science, graph theory, and information theory, and provides tools for understanding the asymptotic preorder, which compares large powers of a pair of elements. This paper studies sequences which behave approximately as sequences of powers, but are not necessarily equivalent to geometric sequences. Our main result is that preordered semirings admit completions where such sequences, that we call approximately geometric, become equivalent to geometric sequences, and that existing characterizations of the asymptotic preorder extend to the completion. We provide several classes of examples of approximately geometric sequences in the semiring of tensors, and in the semiring of graphs. As a concrete application, we determine the strong converse exponent for binary hypothesis testing with composite Markov hypotheses.

math.RA↗

arXiv2026

t-Product and t-STP of cubic matrices with an application to hyper-networked systems

Control systems with tensor-valued state transitions require a product that specifies both how coefficients act on each frontal slice and how different slices interact. This paper develops a t-semi-tensor product (t-STP) on cubic matrices that retains the circular coupling of the t-product while allowing rectangular coefficient slices to act on a fixed state space. The construction combines the dimension-keeping semi-tensor product (DK-STP) bridge with circular convolution, overcoming the absence of cross-slice coupling in a slice-wise DK-STP. It provides a compact coefficient description of a structured class of dynamical operators, with fewer stored entries when the coefficient slices have fewer columns than rows. For a fixed number of frontal slices, we establish associative algebra and module structures and describe the associated Lie algebra and Lie groups. These structures make coefficient composition and exponential evolution consistent, while equivalent classical matrix realizations connect the tensor formulation to control analysis of cubic matrix-based dynamics. A specified supply-network game illustrates how the construction organizes interacting chain flows, reproduces the classical trajectories, and supports a globally convergent payoff-gradient adjustment law with explicit damping. The example quantifies coefficient storage while clarifying that the state dimension is unchanged and that the same economy is available to a classical implementation retaining the factorization.

math.RA↗