Related papers: Free Independence is not definable
In this paper we study different concepts of independence for convex sets of probabilities. There will be two basic ideas for independence. The first is irrelevance. Two variables are independent when a change on the knowledge about one…
Let m>2 be an integer. We show that ZF + "For every integer n, Every countable family of non-empty sets of cardinality at most n has an infinite partial choice function" is not strong enough to prove that every countable set of m-element…
This is a largely expository paper about how groups arise or are of interest in model theory. Included are the following topics: classifying groups definable in specific structures or theories and the relation to algebraic groups, groups…
For x,y in R (where R denotes the real numbers) and f in L^2(R), define (x,y)f(t) = e^{2 pi i yt}f(t+x) and if L is a subset of R^2, define S(f,L) = {(x,y)f | (x,y) in L}. It has been conjectured that if f is not 0, then S(f,L) is linearly…
For a class of nonassociative metagroup algebras their separability is investigated. For this purpose the cohomology theory on them is utilized. Conditions are found under which nonassociative metagroup algebras are separable. Algebras…
We describe a set of defining relations for automorphism groups of finitely generated free algebras of Nielsen-Schreier varieties. In particular, this gives a representation of the automorphism groups of free Lie algebras by generators and…
We study the freeness of the group $\mathrm{Inv}(D)$ of invertible ideals of an integral domain $D$, and the freeness of some related groups of (fractional) ideals. We study the relation between $\mathrm{Inv}(D)$ and $\mathrm{Inv}(D_P)$, in…
Independent component analysis provides a principled framework for unsupervised representation learning, with solid theory on the identifiability of the latent code that generated the data, given only observations of mixtures thereof.…
We prove that the form of conditional independence at play in database theory and independence logic is reducible to the first-order dividing calculus in the theory of atomless Boolean algebras. This establishes interesting connections…
We study the independence structure of finitely exchangeable distributions over random vectors and random networks. In particular, we provide necessary and sufficient conditions for an exchangeable vector so that its elements are completely…
We give some general theorems on free algebras of varieties of Boolean algebras with operators; a hitherto new result is obtained for Pinter's substitution algebras. For n\geq 3, and m>1, there is a generating set of the free algebra freely…
We show that for any finitely generated group of matrices that is not virtually solvable, there is an integer m such that, given an arbitrary finite generating set for the group, one may find two elements a and b that are both products of…
In the literature there are two different notions of lovely pairs of a theory T, according to whether T is simple or geometric. We introduce a notion of lovely pairs for an independence relation, which generalizes both the simple and the…
In this book I treat the structure of D-module which has countable basis. If we do not care for topology of D-module, then we consider Hamel basis. If norm is defined in D-module, then we consider Schauder basis. In case of Schauder basis,…
In this paper, we introduce a concept of non-dependence of variables in formulas. A formula in first-order logic is non-dependent of a variable if the truth value of this formula does not depend on the value of that variable. This variable…
We present a self-contained analysis of infinity from two mathematical perspectives: set theory and algebra. We begin with cardinal and ordinal numbers, examining deep questions such as the continuum hypothesis, along with foundational…
We introduce and study a natural notion of selflessness for inclusions of C*-probability spaces, which in particular implies that all intermediate C*-algebras are selfless in the sense of Robert. We identify natural sources of selfless…
The paper is devoted to the study of free objects in the variety of Steiner loops and of the combinatorial structures behind them, focusing on their automorphism groups. We prove that all automorphisms are tame and the automorphism group is…
It is shown how a C*-algebra representation of the transformations of a physical system can be derived from two operational postulates: 1) the existence of dynamically independent systems}; 2) the existence of symmetric faithful states.…
A theorem of Swan states that the locally free class group of a maximal order in a central simple algebra is isomorphic to a restricted ideal class group of the center. In this article we discuss this theorem and its generalization to…