Santa Barbara contains some places from CA_Places. But when I use intersects, I get noting but all False. I have spent hours on this. Both shapefiles are  for reference. CA_Counties = geopandas.read_file(&quot;CA_Counties\\CA_Counties_TIGER2016.shp&quot;) CA_places = geopandas.read_file(&quot;CA_Places\\CA_Places_TIGER2016.shp&quot;) Santa_Barbara = CA_Counties[CA_Counties['NAME'] == 'Santa Barbara'] CA_places.intersects(Santa_Barbara)  All I'm getting is this warning: C:\Users\LENOVO\.conda\envs\gdal_home\lib\site-packages\geopandas\base.py:39: UserWarning: The indices of the two GeoSeries are different. warn(&quot;The indices of the two GeoSeries are different.&quot;)
I want to check if points layer that I have intersect with polygons layer that I have, as Boolean column in the points dataframe. I have two GeoPandas dataframes, the first one is many points and looks like this: &gt;&gt;&gt;ID  geometry 0  12  POINT (5.0279 7.4547) 1  45  POINT (6.6539 12.139) ...  and the second dataframe is one layer of many different polygons  that looks something like this: &gt;&gt;&gt;name     code   geometry 0  Desert   12     POLYGON ((5.52013 13.8902, 5.5265 13.892,...) 1  Water    24     POLYGON ((5.53756 13.88472, 5.5291 13.8791,...) ...  I'm trying to check if there is any intersection between the points layer and the regions layer. For that I have determined the crs and then used intersects : regions=regions.to_crs({'init': 'epsg:4326'}) points=points.set_crs({'init': 'epsg:4326'}) inter=points.geometry.intersects(regions.geometry)  A The script runs with the following warnings:  FutureWarning: '+init=:' syntax is deprecated. ':' is the preferred initialization method. When making the change, be mindful of axis order changes: https://pyproj4.github.io/pyproj/stable/gotchas.html#axis-order-changes-in-proj-6 return _prepare_from_string(&quot; &quot;.join(pjargs)) /opt/conda/lib/python3.8/site-packages/geopandas/base.py:39: UserWarning: The indices of the two GeoSeries are different. warn(&quot;The indices of the two GeoSeries are different.&quot;)  Then when I check the results the only value is False, like all th epoints do not intersect: inter.unique().tolist() &gt;&gt;&gt;[False]  *I saw on QGIS that the there are points that intersect and there are points that do not so there is no way this result is true *I have checked the dtypes - each one of my geodataframes has one column that is geometry and called geometry. My end goal: to add new column in the points geodataframe that will tell if it intersects the regions or not.
Where can I find a standalone installer for Windows 7 Service Pack 1? $\DeclareMathOperator{\Char}{char}$$\DeclareMathOperator{\Aut}{Aut}$ Let $G$ be a finite group, $H$ a subgroup, such that $H \Char G$. If $\phi \in \Aut(H)$ is there an automorphism $\widehat{\phi} \in \Aut(G)$ such that $\widehat{\phi}|_H$ = $\phi$?  In words, if $\phi$ is an automorphism of $H$, is there necessarily an automorphism $\widehat{\phi}$ of $G$ where $\widehat{\phi}$ maps the elements in $H$ to $H$ in exactly the same way?  I am thinking this is false (consider the non-finite example of $\bar{Q}$ and $\mathbb{C}$), but would like a counter example (for the finite case). Device that makes metal malleable What's wrong with these two cron jobs? I have the following cron jobs defined.  55  8   *   *   3   /usr/bin/php /home/mark/dev/processes/customClient/events.php &gt; /home/mark/dev/processes/customClient/events-`date +%Y-%m-%d --date='last Wednesday'`-`date +%Y-%m-%d`.csv 0   9   *   *   3   /usr/bin/echo 'The csv for last week, trying my hand at automatiging this' | /usr/bin/mutt &lt;emailaddress&gt; -s 'Events from `date +%Y-%m-%d --date='last Wednesday'`-`date +%Y-%m-%d`' -a '/home/mark/dev/processes/customClient/events-`date +%Y-%m-%d --date='last Wednesday'`-`date +%Y-%m-%d`.csv'   It seems to work properly if I run it the above command directly from the command line. But when I checked the running of the script this morning I got an e-mail stating (I'm paraphrasing because I accidentally deleted them) that the back ticks weren't closed properly. Given sequence of $L-$Lipschitz functions which converges pointwise, prove uniform convergence Let $f_n:[a.b]\rightarrow \mathbb{R}$ be sequence of $L-$Lipschitz functions, that is: $$\forall x,y\in[a,b]: |f_n(x)-f_n(y)|\leq L|x-y|$$   Suppose $f_n \rightarrow f$ pointwise, prove $f_n \rightrightarrows f$   I have all the parts of the puzzle for the proof, and I'm trying to put them all together, I'm using  in my answer.  I would appreciate is you could correct my proof, and if you have an alternative proof, I would be more then happy to see it.  My proof:   Let $\epsilon&gt;0.$  $f_n$ are uniformly continuous on $[a,b]:$  $\tag{1} \exists \delta&gt;0\ \forall x,y\in[a,b]: |f_n(x)-f_n(y)|&lt;\frac{\epsilon}{3}$  $f$ is also $L-$Lipschitz:  $\tag{2} \forall x,y\in[a,b]:|f(x)-f(y)|&lt;L|x-y|=\frac{\epsilon}{3}$  Let us set a partition of $[a,b]$ such as Stephen Montgomery-Smith suggests:     Pick points $x_1,\dots,x_m \in [a,b]$ which are distance   $\frac{\epsilon}{3}$ from each other.        For each $1 \le i \le m$, find a number $N_i$ so that for all $n \ge  N_i$ we have $|f_n(x_i)-f(x_i)| \le \epsilon/3$.   Let $N = \max_{1 \le i \le m} N_i$      Now given any $x \in [a,b]$, pick $1 \le i \le m$ such that $|x-x_i| &lt;\frac{\epsilon}{3L}:  |f_n(x)-f(x)|&lt;\frac{\epsilon}{3} \tag{3}$   $$\begin{align}|f_n(y)-f(y)| &amp;=|f_n(y)-f_n(x)+f_n(x)-f(x)+f(x)-f(y)| \\ &amp;\leq |f_n(y)-f_n(x)| + |f_n(x)-f(x)|+|f(x)-f(y)| \\ &amp;&lt; \frac{\epsilon}{3} + \frac{\epsilon}{3} + \frac{\epsilon}{3} = \epsilon \\\end{align}$$ $X$,$Y$,$Z$ mutually independent implies $X+Y$ independent of $Z$ Supposing $X$, $Y$ and $Z$ and mutually independent real random variables, how can we prove that $X+Y$ and $Z$ are independent from the definition? If not from the definition, using $\sigma$-algebras?  I know that if $X$ and $Y$ are not independent this doesn't work so I know I have to make use of their independence in my proof but I can't figure out how. And it means that if I write the following, I'm making a mistake, and I can't find it:  $$\mathbb{P}(X+Y \leq k,Z \leq l)=\int_{\mathbb{R}} \mathbb{P}(X=x,Y \leq k-x, Z \leq l) dx=\int_{\mathbb{R}} \mathbb{P}(X=x,Y \leq k-x) \mathbb{P}(Z \leq l) dx = \mathbb{P}(Z \leq l)\int_{\mathbb{R}} \mathbb{P}(X=x,Y \leq k-x)dx= \mathbb{P}(Z \leq l) \mathbb{P}(X+Y \leq k) $$  PS: I have seen the proof here but it much more advanced stuff, kind of a sledgehammer... A doubt from Milnor's "Topology from a Differentiable Viewpoint". This is a doubt from Milnor's "Topology from a Differentiable Viewpoint".     For a smooth $f:M\to N$, with $M$ compact, and a regular value $y\in N$, we define $n(f^{-1}(y))$ to be the number of points in $f^{-1}(y)$. It is easy to see that $n(f^{-1}(y))$ is finite. It can also be seen that $n(f^{-1}(y))$ is locally constant; i.e. there is a neighbourhood of $y$ such that for every point $y'$ in that neighbourhood, $n(f^{-1}(y'))=n(f^{-1}(y))$.   The proof for the statement in bold is the following:     Let $x_1,x_2,\dots,x_n$ be the points of $f^{-1}(y)$, and choose disjoint neighbourhoods $U_1,U_2,\dots,U_n$ of these points, which are mapped diffeomorphically into neighbourhoods $V_1,V_2,\dots,V_n$ of $y$. The required neighbourhood is $(V_1\cap V_2\cap\dots V_n)-f(M-U_1-U_2-\dots U_n)$.   I don't understand how $(V_1\cap V_2\cap\dots V_n)-f(M-U_1-U_2-\dots U_n)$ is open. I know that $(V_1\cap V_2\cap\dots V_n)$ is open. However, how can one prove that $f(M-U_1-U_2-\dots U_n)$ is closed? I can see this working if $f$ is surjective, but not otherwise. How to create a desktop shortcut in Unity? Is there an easy way to create a desktop shortcut for an application in Unity? The ability to right click or drag and drop icons to the desktop in Unity does not seem to be there. Use ALT to move windows in Windows like in Linux In most Linux window managers, one can use the Alt key while clicking and dragging to rearrange windows. This is one of my favorite features of Linux window managers.  Is there a way to do this in Windows 7? Can I use a charger with more output amperage than the device needs? Transparent path/stroke fill in Illustrator How can I have  for Ubuntu? I recently received this rather amusing message while reviewing a user's first post:  Congratulations! This was only a test, designed to make sure you were paying attention. This post has already been removed, but thanks for taking time to leave feedback for the author.   What is the purpose of this test? How does the audit work? What happens if I fail? Why was the system expecting me to negatively review a good post, or positively review a bad post? A review is obviously an audit. Should I report it? Do review audits count toward the Reviewer badge? Do robo-reviewers dream of electric sheep? When do you use at the office? And when do you use in the office? What's the difference between the phrases? Does English allow a zero copula in subordinate clauses? In a casual search of the web, I found a few indications English does not allow zero copulas ().  However, I frequently see sentences with subordinate clauses that juxtapose a noun phrase with an adverb phrase, such as the following from a contemporary sci-fi author:  Kai stares up at me from the grave, his eyes hard as obsidian.  If this clause were made into a sentence, it would take an obligatory verb:  *His eyes hard as obsidian.  His eyes are hard as obsidian.  The original clause seems to contain an implicit "to be."  Is it an example of a zero copula?  If not, what is this construction called? How to prepare files for rsync on a case insensitive filesystem? I am transferring a large number of files on a HFS+ filesystem.  The files are currently on ext2 partitions.  I have conflicts due to case insensitivity of the target partition (HFS+).  I want to identify the files that have duplicates filenames once they are in lower case, and delete them if they are actually duplicates.  I also found that I will have duplicate folder names if I convert everyhing to lower case. Basically these hard drives contain years of unsorted data, and I happen to have this problem with folder names too.   Does this seem reasonable:  find . -type f | while read f; do echo $f:l; done | sort | uniq -d    $f:l is ZSH for convert to lower case.  Now I want to keep only one instance of each file that have duplicates. How to do this efficiently ?  I do not want to find files with duplicate content, unless they have the same lower case filename. I will deal with duplicates later. Adjoint pairs, triplets and quadruplets Often we have adjoint pairs $(A, B)$ (meaning $A$ is left adjoint to $B$). Sometimes we have adjoint triplets $(A,B,C)$ (meaning $A$ is left adjoint to $B$ and $B$ is left adjoint to $C$. No adjoint relation between $A$ and $C$ obviously, since they have the same source and target).  So the first question is: can we have quadruplets $(A,B,C,D)$ ? (meaning that $C$ is also left adjoint to $D$).  Second question: It would be then possible that we have $(A,D)$ besides $(A,B)$. But I think not, because I think that it is not possible to have a functor $A$ with two different right adjoints, $B$ and $D$. Is this correct? In many languages, including English, the most important verbs are irregular. Examples include:   to be  to do  to get  to go  to have  to make   The same applies (roughly) to many other languages I know about (Dutch, German, French, Spanish, Swedish) and presumably to many other languages too.  Is there any reason why these everyday verbs tend to be irregular? Time reversal symmetry and T^2 = -1 Double dual mappings $\newcommand{\Hom}{\operatorname{Hom}}$Let $U,V$ be vector spaces. Denote the dual space of $U$ with $U^\intercal$ and the dual mapping of a linear map $\Phi$ be $\Phi^\intercal$. Define the double dual embedding on $U$ to be $\iota_U:U \to U^{\intercal\intercal}$. ($u \in U, f \in U^\intercal$) $$ \iota_U(u)(f) = f(u) $$     If $\Phi \in \Hom(V,U)$, then $\Phi^{\intercal\intercal} \circ \iota_V = \iota_U \circ \Phi:V \to U^{\intercal\intercal}$   Proof: Let $v \in V, f \in U^\intercal$. Then $$ \iota_U \circ \Phi(v)(f) = f(\Phi(v)) $$ but how do I show that $$ \Phi^{\intercal\intercal} \circ \iota_V(v)(f) = f(\Phi(v)) $$ ?