Notes on general topology

1965 ◽  
Vol 61 (4) ◽  
pp. 877-878 ◽  
Author(s):  
A. J. Ward

There is a close parallelism between the theories of convergence of directed nets and of filters, in which ‘subnet’ corresponds, in general, to ‘refinement’. With the standard definitions, however (1), pages 65 et seq., this correspondence is not exact, as there is no coarsest net converging to x0 of which all other nets with the same limit are subnets. (Suppose, for example, that a net X = {xj,: j ∈ J} in R1 has both the sequence-net S = {n−1; n = 1, 2,…} and the singleton-net {0} as subnets. Then (with an obvious notation), there existsuch that j0 ≥ jn for all n, while jn ≥ j0 for all n ≥ n0 say. But, given any j ∈ J, there exists n with jn ≥ j: it follows that jn ∈ j for all n ≥ n0 (independent of j); thus X cannot converge to 0. Even if nets with a last member are excluded, a similar result can be obtained by considering the net Y = {yθ; Θ an ordinal less than ω1}, where yθ = 0 for all Θ. If X has both Y and S as subnets we can show that (with a similar notation) there exists Θ0 such that Θ ≥ Θ0 implies jθ ≥ all jn, but also n0 such that n ≥ n0 implies ; the rest is as before.) Moreover, the theory of convergence classes, (l), pages 73 et seq., contains a condition (Kelley's condition (c)) whose analogue need not be separately stated for filters. These differences can be removed by adopting a wider definition of subnet, a course which does not seem unnatural, inasmuch as the standard definition is already wider than the ‘obvious’ one, and our proposed definition is equivalent to the standard one in the special case of sequences.

1984 ◽  
Vol 36 (6) ◽  
pp. 973-985
Author(s):  
Bryan E. Cain

The results in this paper respond to two rather natural questions about a polar decomposition A = UP, where U is a unitary matrix and P is positive semidefinite. Let λ1, …, λn be the eigenvalues of A. The questions are:(A) When will |λ1|, …, |λn| be the eigenvalues of P?(B) When will λ1/|λ1|, …, λn/|λn| be the eigenvalues of U?The complete answer to (A) is “if and only if U and P commute.” In an important special case the answer to (B) is “if and only if U2 and P commute.“Since these matters are best couched in terms of two different inertias, we begin with a unifying definition of inertia which views all inertias from a single perspective.For each square complex matrix A and each complex number z let m(A, z) denote the multiplicity of z as a root of the characteristic polynomial


2019 ◽  
Vol 51 (8) ◽  
pp. 1178-1191 ◽  
Author(s):  
SM Berman ◽  
RD Clear

Over the past decade, there has been a growing interest in lighting research on the effects of the recently discovered melanopsin receptor (also referred to as the intrinsically photosensitive retinal ganglion cell) and its impacts on health and vision. Presently, there is not a generally accepted metrology for dealing with the spectral response of the melanopsin receptor as applied to both lighting and vision research. A proposition to handle this issue from a vision science perspective has been presented in 2014 in the journal Trends in Neurosciences and from a more lighting perspective in 2017 in Lighting Research and Technology. These propositions are complex, and do not retain the CIE standard definition of a lumen. In this paper, we propose an approach based on effective watts and melanopic/photopic ratios that is both simpler and more closely aligned with CIE standard unit definitions. In addition, we include some practical examples of how such ratios are accessible now, and can be used for both lighting and vision research as well as applications.


2012 ◽  
Vol 96 (536) ◽  
pp. 213-220
Author(s):  
Harlan J. Brothers

Pascal's triangle is well known for its numerous connections to probability theory [1], combinatorics, Euclidean geometry, fractal geometry, and many number sequences including the Fibonacci series [2,3,4]. It also has a deep connection to the base of natural logarithms, e [5]. This link to e can be used as a springboard for generating a family of related triangles that together create a rich combinatoric object.2. From Pascal to LeibnizIn Brothers [5], the author shows that the growth of Pascal's triangle is related to the limit definition of e.Specifically, we define the sequence sn; as follows [6]:


2001 ◽  
Vol 66 (4) ◽  
pp. 1865-1883 ◽  
Author(s):  
Chaz Schlindwein

One of the main goals in the theory of forcing iteration is to formulate preservation theorems for not collapsing ω1 which are as general as possible. This line leads from c.c.c. forcings using finite support iterations to Axiom A forcings and proper forcings using countable support iterations to semi-proper forcings using revised countable support iterations, and more recently, in work of Shelah, to yet more general classes of posets. In this paper we concentrate on a special case of the very general iteration theorem of Shelah from [5, chapter XV]. The class of posets handled by this theorem includes all semi-proper posets and also includes, among others, Namba forcing.In [5, chapter XV] Shelah shows that, roughly, revised countable support forcing iterations in which the constituent posets are either semi-proper or Namba forcing or P[W] (the forcing for collapsing a stationary co-stationary subset ofwith countable conditions) do not collapse ℵ1. The iteration must contain sufficiently many cardinal collapses, for example, Levy collapses. The most easily quotable combinatorial application is the consistency (relative to a Mahlo cardinal) of ZFC + CH fails + whenever A ∪ B = ω2 then one of A or B contains an uncountable sequentially closed subset. The iteration Shelah uses to construct this model is built using P[W] to “attack” potential counterexamples, Levy collapses to ensure that the cardinals collapsed by the various P[W]'s are sufficiently well separated, and Cohen forcings to ensure the failure of CH in the final model.In this paper we give details of the iteration theorem, but we do not address the combinatorial applications such as the one quoted above.These theorems from [5, chapter XV] are closely related to earlier work of Shelah [5, chapter XI], which dealt with iterated Namba and P[W] without allowing arbitrary semi-proper forcings to be included in the iteration. By allowing the inclusion of semi-proper forcings, [5, chapter XV] generalizes the conjunction of [5, Theorem XI.3.6] with [5, Conclusion XI.6.7].


1990 ◽  
Vol 33 (2) ◽  
pp. 169-180 ◽  
Author(s):  
Juan A. Gatica ◽  
Gaston E. Hernandez ◽  
P. Waltman

The boundary value problemis studied with a view to obtaining the existence of positive solutions in C1([0, 1])∩C2((0, 1)). The function f is assumed to be singular in the second variable, with the singularity modeled after the special case f(x, y) = a(x)y−p, p>0.This boundary value problem arises in the search of positive radially symmetric solutions towhere Ω is the open unit ball in ℝN, centered at the origin, Γ is its boundary and |x| is the Euclidean norm of x.


2009 ◽  
Vol 78 (3) ◽  
pp. 309-342 ◽  
Author(s):  
Patrik Johansson

AbstractUnder Chapter VII of the Charter of the United Nations, the Security Council has the unique authority to make decisions that are binding on member states. However, the lack of a standard definition of what makes a Security Council resolution "a Chapter VII resolution" has caused disagreement regarding the status of several resolutions. This is unfortunate as the international community should never have to doubt whether a Security Council resolution is in fact adopted under Chapter VII or not. It is also unnecessary. This article addresses this problem by proposing a definition of Chapter VII resolutions, based on two criteria referred to as "Article 39 determinations" and "Chapter VII decisions". On the basis of the proposed definition, the article describes and analyses a dramatic increase in the use of Chapter VII during the post-Cold War era. It concludes that as Chapter VII has come to constitute the majority of Security Council resolutions in recent years, the resort to Chapter VII no longer signifies exceptional determination and resolve, which it did during the Cold War; instead Chapter VII today implies business as usual. An appendix lists all Chapter VII resolutions from 1946–2008.


Mathematics ◽  
2021 ◽  
Vol 9 (9) ◽  
pp. 1018
Author(s):  
Xhevdet Thaqi ◽  
Ekrem Aljimi

: In this paper, we consider the relation of more than four harmonic points in a line. For this purpose, starting from the dependence of the harmonic points, Desargues’ theorems, and perspectivity, we note that it is necessary to conduct a generalization of the Desargues’ theorems for projective complete n-points, which are used to implement the definition of the generalization of harmonic points. We present new findings regarding the uniquely determined and constructed sets of H-points and their structure. The well-known fourth harmonic points represent the special case (n = 4) of the sets of H-points of rank 2, which is indicated by P42.


2021 ◽  
Vol 10 (08) ◽  
pp. 2714-2724
Author(s):  
兴祥 刘

1973 ◽  
Vol 5 (02) ◽  
pp. 217-241 ◽  
Author(s):  
A. M. Walker

Let observations (X 1, X 2, …, Xn ) be obtained from a time series {Xt } such that where the ɛt are independently and identically distributed random variables each having mean zero and finite variance, and the gu (θ) are specified functions of a vector-valued parameter θ. This paper presents a rigorous derivation of the asymptotic distributions of the estimators of A, B, ω and θ obtained by an approximate least-squares method due to Whittle (1952). It is a sequel to a previous paper (Walker (1971)) in which a similar derivation was given for the special case of independent residuals where gu (θ) = 0 for u > 0, the parameter θ thus being absent.


1984 ◽  
Vol 21 (3) ◽  
pp. 336 ◽  
Author(s):  
Frederick Wiseman ◽  
Maryann Billington

Sign in / Sign up

Export Citation Format

Share Document