We use cookies to distinguish you from other users and to provide you with a better experience on our websites. Close this message to accept cookies or find out how to manage your cookie settings.
To save content items to your account,
please confirm that you agree to abide by our usage policies.
If this is the first time you use this feature, you will be asked to authorise Cambridge Core to connect with your account.
Find out more about saving content to .
To save content items to your Kindle, first ensure [email protected]
is added to your Approved Personal Document E-mail List under your Personal Document Settings
on the Manage Your Content and Devices page of your Amazon account. Then enter the ‘name’ part
of your Kindle email address below.
Find out more about saving to your Kindle.
Note you can select to save to either the @free.kindle.com or @kindle.com variations.
‘@free.kindle.com’ emails are free but can only be saved to your device when it is connected to wi-fi.
‘@kindle.com’ emails can be delivered even when you are not connected to wi-fi, but note that service fees apply.
Biological data commonly involve multiple predictors. This chapter starts expanding our models to include multiple categorical predictors (factors) when they are in factorial designs. These designs allow us to introduce synergistic effects – interactions. Two- and three-factor designs are used to illustrate the estimation and interpretation of interactions. Our approach is first to consider the most complex interactions and use them to decide whether it is helpful to continue examining simple interactions. Main effects – single predictors acting independently of each other – are the last to be considered. We also deal with problems caused by missing observations (unbalanced designs) and missing cells (fractional and incomplete factorials) and discuss how to estimate and interpret them.
For a set x, let ${\cal S}\left( x \right)$ be the set of all permutations of x. We prove in ZF (without the axiom of choice) several results concerning this notion, among which are the following:
(1) For all sets x such that ${\cal S}\left( x \right)$ is Dedekind infinite, $\left| {{{\cal S}_{{\rm{fin}}}}\left( x \right)} \right| < \left| {{\cal S}\left( x \right)} \right|$ and there are no finite-to-one functions from ${\cal S}\left( x \right)$ into ${{\cal S}_{{\rm{fin}}}}\left( x \right)$, where ${{\cal S}_{{\rm{fin}}}}\left( x \right)$ denotes the set of all permutations of x which move only finitely many elements.
(2) For all sets x such that ${\cal S}\left( x \right)$ is Dedekind infinite, $\left| {{\rm{seq}}\left( x \right)} \right| < \left| {{\cal S}\left( x \right)} \right|$ and there are no finite-to-one functions from ${\cal S}\left( x \right)$ into seq (x), where seq (x) denotes the set of all finite sequences of elements of x.
(3) For all infinite sets x such that there exists a permutation of x without fixed points, there are no finite-to-one functions from ${\cal S}\left( x \right)$ into x.
(4) For all sets x, $|{[x]^2}| < \left| {{\cal S}\left( x \right)} \right|$.
For a set x, let ${\cal S}\left( x \right)$ be the set of all permutations of x. We prove by the method of permutation models that the following statements are consistent with ZF:
(1) There is an infinite set x such that $|\wp \left( x \right)| < |{\cal S}\left( x \right)| < |se{q^{1 - 1}}\left( x \right)| < |seq\left( x \right)|$, where $\wp \left( x \right)$ is the power set of x, seq (x) is the set of all finite sequences of elements of x, and seq1-1 (x) is the set of all finite sequences of elements of x without repetition.
(2) There is a Dedekind infinite set x such that $|{\cal S}\left( x \right)| < |{[x]^3}|$ and such that there exists a surjection from x onto ${\cal S}\left( x \right)$.
(3) There is an infinite set x such that there is a finite-to-one function from ${\cal S}\left( x \right)$ into x.
Recommend this
Email your librarian or administrator to recommend adding this to your organisation's collection.