Related papers: Induction in Algebra: a First Case Study

We give a computational interpretation to an abstract instance of Zorn's lemma formulated as a wellfoundedness principle in the language of arithmetic in all finite types. This is achieved through G\"odel's functional interpretation, and…

Zorn's Lemma is a well-known equivalent of the Axiom of Choice. It is usually regarded as a topic in axiomatic set theory, and its historically standard proof (from the Axiom of Choice) relies on transfinite recursion, a non-elementary…

The Initial Algebra Theorem by Trnkov\'a et al.~states, under mild assumptions, that an endofunctor has an initial algebra provided it has a pre-fixed point. The proof crucially depends on transfinitely iterating the functor and in fact…

In many instances in first order logic or computable algebra, classical theorems show that many problems are undecidable for general structures, but become decidable if some rigidity is imposed on the structure. For example, the set of…

Jacobson proved that if a Lie algebra admits an invertible derivation, it must be nilpotent. He also suspected, though incorrectly, that the converse might be true: that every nilpotent Lie algebra has an invertible derivation. We prove…

We prove nilpotency results for Lie algebras over an arbitrary field admitting a derivation, which satisfies a given polynomial identity $r(t)=0$. For the polynomial $r=t^n-1$ we obtain results on the nilpotency of Lie algebras admitting a…

As mathematical induction is applied to prove statements on natural numbers, {\it continuous induction} (or, {\it real induction}) is a tool to prove some statements in real analysis.(Although, this comparison is somehow an overstatement.)…

Let $ L $ be a finite dimensional nilpotent Lie algebra and $ d $ be the minimal number generators for $ L/Z(L). $ It is known that $ \dim L/Z(L)=d \dim L^{2}-t(L)$ for an integer $ t(L)\geq 0. $ In this paper, we classify all finite…

A special final coalgebra theorem, in the style of Aczel's, is proved within standard Zermelo-Fraenkel set theory. Aczel's Anti-Foundation Axiom is replaced by a variant definition of function that admits non-well-founded constructions.…

The existence of ideal objects, such as maximal ideals in nonzero rings, plays a crucial role in commutative algebra. These are typically justified using Zorn's lemma, and thus pose a challenge from a computational point of view. Giving a…

The validity of the Addition Theorem for algebraic entropies $\ent_L$ induced by non-discrete length functions $L$ on the category of locally $L$-finite modules over arbitrary rings is proved. Concrete examples of non-discrete length…

In this paper, we give an algebraic completeness theorem for constructive logic with strong negation in terms of finite rough set-based Nelson algebras determined by quasiorders. We show how for a quasiorder $R$, its rough set-based Nelson…

Many proofs of the fundamental theorem of algebra rely on the fact that the minimum of the modulus of a complex polynomial over the complex plane is attained at some complex number. The proof then follows by arguing the minimum value is…

A Lie algebra L is known to be nilpotent if it admits a grading by (Zp, +) with support X not containing 0. It is also known that the class of L can be bounded by some explicit function of |X|. We generalise this and other classical results…

For certain weak versions of the Axiom of Choice (most notably, the Boolean Prime Ideal theorem), we obtain equivalent formulations in terms of partial orders, and filter-like objects within them intersecting certain dense sets or…

We propose a procedure for automated implicit inductive theorem proving for equational specifications made of rewrite rules with conditions and constraints. The constraints are interpreted over constructor terms (representing data values),…

In Feferman's work, explicit mathematics and theories of generalized inductive definitions play a central role. One objective of this article is to describe the connections with Martin-Lof type theory and constructive Zermelo-Fraenkel set…

Let G be a reductive group over an algebraically closed field k of separably good characteristic p>0 for G. Under these assumptions a Springer isomorphism from the reduced nilpotent scheme of the Lie algebra of G to the reduced unipotent…

Let U(L) be the enveloping algebra of a finite dimensional Lie algebra L over a field k of characteristic zero, Z(U(L)) its center and Sz(U(L)) its semicenter. A sufficient condition is given in order for Sz(U(L)) to be a polynomial algebra…

We give a general method for producing various effective Null and Positivstellens\"atze, and getting new Positivstellens\"atze in algebraically closed valued fields and ordered groups. These various effective Nullstellens\"atze produce…