No. Let be the displayed infinite axiom set. Any finite subset mentions only finitely many of the two infinitude requirements. Choose at least as large as every index mentioned. A finite equivalence relation with exactly singleton classes and doubleton classes satisfies , but is not a first-order model of the complete theory.
If a finite axiomatization existed, let be the conjunction of its axioms. Then , so the compactness theorem gives a finite with . Every first-order model of would then satisfy the full first-order theory, contradicting the finite first-order model above. This is the finite subaxiomatization from an equivalent finite theory argument: finite axiomatizability would force one finite fragment of the explicit axioms to suffice.
WriteThese are first-order formulas in the original language, not new predicate symbols. An axiomatization consists of the equivalence relation axioms for , the boundand, for every , the two sentencesThe first scheme supplies infinitely many singleton classes. The second supplies infinitely many distinct non-singleton classes; the size bound makes these doubletons.
Every countable first-order model has countably infinitely many classes of each size. A bijection between singleton classes, and another between doubleton classes followed by a bijection inside each matched pair, gives an isomorphism between any two countable first-order models. To infer completeness, suppose a sentence had different truth values in two arbitrary first-order models. The Downward Lowenheim-Skolem theorem supplies countable elementary substructures of those first-order models, which would still disagree on the sentence, contradicting the isomorphism just constructed. Thus all first-order models satisfy the same sentences. Since the original first-order structure satisfies the axioms, these axioms form a complete axiomatization of its first-order theory. This is the theory of infinitely many singleton and doubleton equivalence classes.
The Kummer-Dedekind theorem states the following. If with integral and , factor the minimal polynomial modulo as into distinct monic irreducible factors. ThenThe index restriction is essential.
For the proposed ideal relation, reflexivity uses and symmetry interchanges . If and , multiplication gives . All multipliers remain nonzero. Thus it is an equivalence relation, namely equality of ideal classes.
Put . The minimal polynomial is and the given full power basis makes every prime eligible for the theorem. Modulo its roots are ; modulo and it is irreducible; modulo its roots are . ConsequentlyThe two inert ideals have norms and ; each split factor has norm equal to its rational prime.
For , quadratic reciprocity and its supplementary laws give . Thus has two distinct roots modulo , giving distinct prime ideals withThe given principal ideal domain property makes for some integers . Taking norms, which are positive here, gives .
For each continuous map to a Hausdorff target, equality of its values is reflexive, symmetric and transitive. The relation requires all these equalities simultaneously. Explicitly, gives reflexivity; implies ; and gives . These arguments apply to every map in the defining family, proving is an equivalence relation.
Use the equivalence relation of belonging to the same fibre:The map , , is well defined, injective by the definition of the relation, and surjective because is surjective. It is continuous by the quotient topology: for open , is open.
Use the equivalence relation of belonging to the same fibre:The map , , is well defined, injective by the definition of the relation, and surjective because is surjective. It is continuous by the quotient topology: for open , is open.
Conjugacy is an equivalence relation: the identity element gives reflexivity, conjugation by reverses conjugation by , and composing conjugations gives transitivity. Its equivalence classes therefore partition the finite set . Counting this disjoint union givesSeparating singleton classes from the others gives the class equation .
The relation is reflexive because the exceptional set for is empty, and symmetric because the exceptional sets for and agree. If off a null set and off a null set , then off , which is null by part (b). Hence it is transitive as well, so equality almost everywhere is an equivalence relation.
The relation is reflexive because the exceptional set for is empty, and symmetric because the exceptional sets for and agree. If off a null set and off a null set , then off , which is null by part (b). Hence it is transitive as well, so equality almost everywhere is an equivalence relation.
Past exam of the philosophy of space-time course of the University of Oxford 2022 2 Solution 2026-10-25
The crucial distinction is between an observer-independent binary relation of absolute simultaneity and a relation defined relative to an inertial frame. The relativity of simultaneity removes the former from the usual structure of special relativity; it does not make the latter meaningless or subjective.
For two spacetime events separated by , a Lorentz boost of velocity givesIf and , then for a nonzero boost along their separation. More generally, spacelike separated events can be simultaneous in some inertial frame, and their time order can reverse between inertial frames. Distinct timelike separated or null separated events cannot be simultaneous in any inertial frame; their causal order is preserved by time-orientation-preserving Lorentz transformations. These are precise geometric facts, independent of anyone's beliefs.
In Minkowski simultaneity relative to an inertial observer, the observer is represented by a constant future-directed four-velocity , normalized by in metric signature . ThenFor a fixed , this is a perfectly well-defined equivalence relation. It can be specified without coordinates. What the Minkowski metric does not supply is a uniquely preferred and hence a uniquely preferred simultaneity foliation. This is the strongest defensible interpretation of the claim by Tim Maudlin: there is no additional fundamental, frame-independent simultaneity relation in the bare theory.
Calling it merely “relative to an observer” can mislead in two ways. First, distant simultaneity does not depend on when an image is received: travel time of the light signal must be accounted for. Second, two observers at the same spacetime event but with different four-velocities assign different simultaneity hyperplanes; the dependence is on state of motion, rather than consciousness. Einstein synchronisation operationalizes the standard frame assignment by setting a reflected pulse's remote reading to the midpoint of its sending and returning readings.[ref]
On the Electrodynamics of Moving Bodies by Albert Einstein. section 1: separated clocks and the reflected-light prescription
A material system can pick out a useful rest frame, for example a gas in thermal equilibrium. That adds physical information beyond the Minkowski metric; it does not provide a universal absolute present. Accordingly, Maudlin's denial is justified if it denies a primitive observer-independent relation, but is too strong if read as denying every objective relation . The indexed relation and its measurable consequences remain part of the physics.
Past exam of the topology and groups course of the University of Oxford 2023 1 b i Solution 2026-10-25
Writefor the quotient map defining the mapping cylinder, and put . Since the equivalence relation only attaches points at height to , distinct points at height remain distinct. Thus is an injective continuous map.
Define the homotopyIt is a continuous map, with and . HenceEven if identifies many points, the free end of the mapping cylinder retains a separate copy of every point of .
The set consists of the equivalence classes for . The canonical surjection , , defines its quotient topology:The quotient space includes this topology, not just the collection of equivalence classes.
Regard the circle as and use the continuous surjectionDefine precisely when . This is an equivalence relation, being equality of function values. Equivalently or , so the construction is the circle modulo reflection.
Since is constant on each equivalence class, it induces a bijectionIt is continuous by the universal property of the quotient topology, because is continuous. The circle is compact by the Heine-Borel theorem, and its quotient space is a continuous image of a compact space, hence compact. The closed interval is Hausdorff. Part (a)(ii) therefore provesGeometrically, the equivalence relation folds the upper and lower semicircles together, retaining the two real endpoints separately.
Use the equivalence relation induced by a function:Equality in supplies reflexivity, symmetry, and transitivity, so this is an equivalence relation. Define by . It is well-defined; it is injective by the definition of and surjective because is surjective.
For an open set ,is open by continuity of . The quotient topology therefore makes open, proving that is continuous.
The continuous image of a compact space theorem applied to makes compact. If is closed in , it is compact, and is compact in the Hausdorff space , hence closed. Thus is a closed map. Its inverse function is continuous, since its preimage of is precisely . We have proved that is a homeomorphism, including the compact-to-Hausdorff continuous bijection theorem used in the argument.
The “same age” binary relation is a Euclidean relation, with age understood as one consistently measured value at a fixed time. If has the same age as both and , the ages of and are equal. HenceThis is another instance of equality of the values of a function inducing an equivalence relation.
Suppose is an equivalence relation, and , . Since it is a symmetric relation, . Since it is a transitive relation, together with implies . This proves
A binary relation on a set is an equivalence relation when it is a reflexive relation, a symmetric relation, and a transitive relation. In first-order logic, these three requirements are
On the nonempty set take the empty binary relation . There are no triples for which holds. The defining implication is therefore true for every triple by vacuous truth, making a Euclidean relation.
The answer is no, even when both original binary relations are equivalence relations. On , let have equivalence classes and have equivalence classes . Each is a transitive relation and, by the earlier proof, a Euclidean relation.
Use exactly the paper's convention for composition of relations: means and for some . The possible successors areIndeed, from or the first step can reach or , whose successors together exhaust ; from the first step must stay at , whose successors are only . Consequently and , but not . Therefore
- A reflexive relation satisfies .
- A symmetric relation satisfies .
- An antisymmetric relation satisfies .
- A transitive relation satisfies .
- An irreflexive relation satisfies .
- A serial relation satisfies .
Thus an equivalence relation is a binary relation that is simultaneously reflexive, symmetric and transitive. The equivalence class of is the set of all elements related to it:Antisymmetry permits diagonal pairs and does not mean that a binary relation fails to be a symmetric relation.
The relation is reflexive because . It is symmetric because implies . It is transitive because and imply . It is therefore an equivalence relation, namely congruence modulo an integer for modulus two. Its two equivalence classes consist of the even integers and the odd integers.