We give a model-theoretic account for several results regarding sequences of random variables appearing in Berkes and Rosenthal [12]. In order to do this,•We study and compare three notions of convergence of types in a stable theory: logic convergence, i.e., formula by formula, metric convergence (both already well studied) and convergence of canonical bases. In particular, we characterise א0-categorical stable theories in which the last two agree.•We characterise sequences that admit almost indiscernible sub-sequences.•We apply these tools to the theory of (...) atomless random variables (ARV). We characterise types and notions of convergence of types as conditional distributions and weak/strong convergence thereof, and obtain, among other things, the Main Theorem of Berkes and Rosenthal. (shrink)

We point out how the "Fundamental Theorem of Stability Theory", namely the equivalence between the "non order property" and definability of types, proved by Shelah in the 1970s, is in fact an immediate consequence of Grothendieck's "Criteres de compacite" from 1952. The familiar forms for the defining formulae then follow using Mazur's Lemma regarding weak convergence in Banach spaces.