This text is a study of concepts in classical reliability theory generalized to very abstract settings. Concepts involving the reliability function, the failure rate function, a type of random walk, and constant rate distributions that ultimately depend only on the order relation
Much of the underlying mathematics in the general theory is relatively simple and well known, corresponding to basic results in measure theory, linear algebra, functional analysis, and graph theory. But the application of the mathematics to the particular topics in probability theory presented here is not well known, to the best of my knowledge. But it should be. The theory is elegant and the applications interesting and diverse, even if they sometimes have little relation to the classical reliability theory that served as motivation.
My hope is that this text will be interesting and useful to students and researchers who study the interplay between probability and algebraic structures. The text includes some simple exercises and also includes a few problems that are interesting to me, but whose solutions I do not know. This text is currently a work in progress, and may well contain mistakes, hopefully mostly minor but pehaps some that are serious. I am grateful for comments and corrections.
The prerequisites for this text are basic topics in the set theory, combinatorics, linear algebra, measure theory and integration, probabiity theory, and certain stochastic processes. The companion web-book Random has all of these topics (and many more) written in a similar style, and with consistent notation and terminology. The following chapters in Random include the topics that are the basic prerequisites for this text:
In particular, the chapter on Foundations include basic facts about sets, functions and relations, measure spaces and integration, and topology
The following notation is used for special sets:
The following subsections review a few definitions and properties that will be most important in this text.
A measurable space
The collection
To avoid measurable spaces that are too sparce, we generally assume that
The intersection of a collection of
So
A measurable space
In the language and notation of Chapter 1, measurable diagonal means that the basic graph
Suppose that
For a proof, see the paper by Dravecký
A measure space
We generally assume that measure spaces are
Suppose that
The product structure extends to a finite collection of measure spaces, of course. In particular, if
We try to avoid topological assumptions unnecessarily. Our point of view is that there is no need to invoke topolgy unless there is a real topological concept at play—continuity or convergence, for example. It seems a bit remarkable (to me at least) that most of the basic theory in this text flows from the basic assumptions of product measurablility and
If
We use the terms integrable in the weak sense and absolutely integrable in the strong sense.
Suppose that
So if
Suppose again that
If the measure space is understood we abbreviate the notation to
Recall that a topological space
The collection
So the open sets are preserved under arbitrary unions and finite interesections. Topology is intimately conncectd with measure theory:
If
Suppose that
Bases are useful for constructing topologies with a given collection of open sets.
A collection of subsets
Suppose that
Once again, the product topology
Suppose that
A topological space that is locally compact, Hausdorff, and has a countable base is an LCCB space.
An LCCB space has a number of nice properties. The space is metrizable so that there exists a metric that generates the topology. In turn, this means that continuity and other convergence properties can be formulated in terms of convergent sequences. With the Borel
Suppose that
If
For
Of course,
A topological space
This is a well-known result, but we give the proof since it's so simple. Note first that if
So for a Hausdorff space, the diagonal is in the Borel
Suppose that
So if follows that in a topological space that is separable and metrizable, the diagonal is measurable. In particular, an LCCB space has a measurable diagonal.
We use the term random variable in the general sense.
If
Here is another useful expression that we will use frequently:
Suppose that
The text is divided into chapters, and each chapter in turn is divided into sections. Each section is a separate web page. Definitions, mathematical statements, exercises, examples, and open problems are indicated by a die icon and are numbered consecutively in each section. Definitions are indicated by a green die, mathematical statements by a blue die, and simulation exercises by a red die. For mathematical statements, I do not bother to distinguish between theorems, propositions, lemmas, or corollaries. Proofs (or partial proofs) of statements, and solutions or answers to exercises, are referred to as details. These are initially hidden, but the details for a mathematical item can be expanded or contracted by clicking on the small triangle that accompanies the item. My hope is that this feature will make it easier to browse the exposition without getting too involved in the details, and will encourage the reader to think about the proof of a statement or try an exercise before looking at the details in the text. All of the details in a section can be expaned or contracted by clicking on the plus or minus icons at the top and bottom of a page. Links to topics in other sections are clearly indicated by referencing the section or chapter number. You may wish to open a page of this type in a separate browser tab to avoid the delay in rendering the mathematics that occurs when you go back and forth between pages. Links to topics in external sites always open in separate browser tabs.
The apps in this project are designed to demonstrate the mathematical theory in a dynamic, interactive way. A standard graphical user interface is used, with command buttons, scroll bars and list boxes. The app output is displayed numerically and graphically in a set of coordinated tables and graphs. A consistent color-coding is used. Graphical objects that depend only on the distributions or parameters are shown in blue, while graphical objects that depend on data are shown in red. Most app objects have tool tips: small pop-up boxes that explain the object. Rest the cursor on an object to display the tool tip.
Apps that are simulations of random processes all have a standard toolbar with the following basic buttons and controls:
The stop frequency is selected from the second list box in the main toolbar. The stop frequency is the number of runs before the simulation stops in run mode. In most apps you can select a stop frequency of 100, 1000, or 10000. In some apps, other stop rules are provided. In addition, most apps have one or more parameters that can be varied, usually with a scrollbar. The controls for varying parameters appear on toolbar.