syntopogenous structure

In the early part of the 20th century, topological spaces were invented to capture the essence of the idea of continuity. At around the same time, other competing ideas had emerged, resulting in a variety of other “similar” types of spaces: uniform spaces and proximity spaces are the two prominent examples. These abstractions have led mathematicians to even further abstractions, in an attempt to combine all these concepts into a single construct. One such result is so-called a syntopogenous structure.

Before formally defining what a syntopogenous structure is, let us look at some of the commonalities among the three types of spaces that led to this “generalized” structure. Specifically, in all three types of sapces, we can define a transitive relation on the space such that the relation satisfies some features that are common in all three cases:

Let $X$ be a space and $A,B\\subseteq X$ , we define $A\\leq B$ iff

•
(topological) $A\\subseteq B^{\\circ}$ , the interior of $B$ .
•
(uniform) $U[A]\\subseteq B$ for some entourage $U$ . $U[A]$ is a uniform neighborhood of $A$ .
•
(proximity) $A\\delta^{\\prime}(X-B)$ , where $\\delta$ is the proximity relation, and $\\delta^{\\prime}$ is its complement.

In all three cases, the relation is transitive. Furthermore, we have the following:

1.
$\\varnothing\\leq\\varnothing$ ,
2.
$X\\leq X$ ,
3.
if $A\\leq B$ , then $A\\subseteq B$ ,
4.
if $A\\leq B$ and $C\\leq D$ , then $A\\cap C\\leq B\\cap D$ ,
5.
if $A\\leq B$ and $C\\leq D$ , then $A\\cup C\\leq B\\cup D$ ,
6.
if $A\\subseteq B\\leq C\\subseteq D$ , then $A\\leq D$ .

Definition. Let $X$ be a set. A topogenous order $\\leq$ on $X$ is a binary relation on $P(X)$ , the powerset of $X$ , satisfying the six properties above.

By properties 2 and 6, we see that a topogenous order is a transitive antisymmetric relation.

We are now ready for the main definition.

Definition. A syntopogenous structure consists of a set $X$ and a collection $\\mathscr{S}$ of topogenous orders on $X$ such that:

•
if $R_{1},R_{2}\\in\\mathscr{S}$ , then there is $R\\in\\mathscr{S}$ such that $R_{1}\\cap R_{2}\\subseteq R$ ,
•
for any $R\\in\\mathscr{S}$ , then there is $S\\in\\mathscr{S}$ such that $R\\subseteq S\\circ S$ .

Remark. The two defining conditions of a syntopogenous structure $(X,\\mathscr{S})$ are equivalent to the following, given subsets $A, B$ of $X$ :

•
for any $\\leq_{1},\\leq_{2}\\in\\mathscr{S}$ , there is a $\\leq\\in\\mathscr{S}$ such that $A\\leq_{1}B$ and $A\\leq_{2}B$ imply $A\\leq B$ ,
•
for any $\\leq_{1}\\in\\mathscr{S}$ with $A\\leq_{1}B$ , there is a $\\leq_{2}\\in\\mathscr{S}$ such that $A\\leq_{2}C\\leq_{2}B$ for some subset $C$ of $X$ .

References

1 A. Császár, Foundations of General Topology,Macmillan, New York, 1963.
2 S.A. Naimpally, B.D. Warrack, Proximity Spaces, Cambridge University Press, 1970.

单词	SyntopogenousStructure
释义	syntopogenous structure In the early part of the 20th century, topological spaces were invented to capture the essence of the idea of continuity. At around the same time, other competing ideas had emerged, resulting in a variety of other “similar” types of spaces: uniform spaces and proximity spaces are the two prominent examples. These abstractions have led mathematicians to even further abstractions, in an attempt to combine all these concepts into a single construct. One such result is so-called a syntopogenous structure. Before formally defining what a syntopogenous structure is, let us look at some of the commonalities among the three types of spaces that led to this “generalized” structure. Specifically, in all three types of sapces, we can define a transitive relation on the space such that the relation satisfies some features that are common in all three cases: Let $X$ be a space and $A,B\\subseteq X$ , we define $A\\leq B$ iff • (topological) $A\\subseteq B^{\\circ}$ , the interior of $B$ . • (uniform) $U[A]\\subseteq B$ for some entourage $U$ . $U[A]$ is a uniform neighborhood of $A$ . • (proximity) $A\\delta^{\\prime}(X-B)$ , where $\\delta$ is the proximity relation, and $\\delta^{\\prime}$ is its complement. In all three cases, the relation is transitive. Furthermore, we have the following: 1. $\\varnothing\\leq\\varnothing$ , 2. $X\\leq X$ , 3. if $A\\leq B$ , then $A\\subseteq B$ , 4. if $A\\leq B$ and $C\\leq D$ , then $A\\cap C\\leq B\\cap D$ , 5. if $A\\leq B$ and $C\\leq D$ , then $A\\cup C\\leq B\\cup D$ , 6. if $A\\subseteq B\\leq C\\subseteq D$ , then $A\\leq D$ . Definition. Let $X$ be a set. A topogenous order $\\leq$ on $X$ is a binary relation on $P(X)$ , the powerset of $X$ , satisfying the six properties above. By properties 2 and 6, we see that a topogenous order is a transitive antisymmetric relation. We are now ready for the main definition. Definition. A syntopogenous structure consists of a set $X$ and a collection $\\mathscr{S}$ of topogenous orders on $X$ such that: • if $R_{1},R_{2}\\in\\mathscr{S}$ , then there is $R\\in\\mathscr{S}$ such that $R_{1}\\cap R_{2}\\subseteq R$ , • for any $R\\in\\mathscr{S}$ , then there is $S\\in\\mathscr{S}$ such that $R\\subseteq S\\circ S$ . Remark. The two defining conditions of a syntopogenous structure $(X,\\mathscr{S})$ are equivalent to the following, given subsets $A, B$ of $X$ : • for any $\\leq_{1},\\leq_{2}\\in\\mathscr{S}$ , there is a $\\leq\\in\\mathscr{S}$ such that $A\\leq_{1}B$ and $A\\leq_{2}B$ imply $A\\leq B$ , • for any $\\leq_{1}\\in\\mathscr{S}$ with $A\\leq_{1}B$ , there is a $\\leq_{2}\\in\\mathscr{S}$ such that $A\\leq_{2}C\\leq_{2}B$ for some subset $C$ of $X$ . References 1 A. Császár, Foundations of General Topology,Macmillan, New York, 1963. 2 S.A. Naimpally, B.D. Warrack, Proximity Spaces, Cambridge University Press, 1970.
随便看	proof of cofactor expansion ProofOfCompactnessTheoremForFirstOrderLogic proof of compactness theorem for first order logic ProofOfCompactPavingsAreClosedSubsetsOfACompactSpace proof of compact pavings are closed subsets of a compact space ProofOfComparisonTest proof of comparison test ProofOfCompletenessOfSemimartingaleConvergence proof of completeness of semimartingale convergence ProofOfCompletenessUnderUcpConvergence proof of completeness under ucp convergence ProofOfCompletePartialOrdersDoNotAddSmallSubsets proof of complete partial orders do not add small subsets ProofOfComplexMeanvalueTheorem proof of complex mean-value theorem ProofOfCompositionLimitLawForUniformConvergence proof of composition limit law for uniform convergence ProofOfConformalMappingTheorem proof of conformal mapping theorem ProofOfConformalMobiusCircleMapTheorem proof of conformal Möbius circle map theorem ProofOfCongruenceOfClausenAndVonStaudt proof of congruence of Clausen and von Staudt ProofOfContinuousFunctionsAreRiemannIntegrable proof of continuous functions are Riemann integrable