Question: Give an example of a function $f$ on $X$ to $R$ which is not $X$ measurable, but is such that the functions $|f|$ and $f^2$ are measurable.  To me, $|f|$ is measurable and $f^2$ is measurable are equivalent. However, I have no idea how to construct the example. Any hint?
Question  The following is from Bartle:  Give an example of a function $f$ on $X$ to $\mathbb{R}$  which is not $X-$measurable but is such that $|f|,$ and $f^2$ are measurable.  Relavant Information  A family $\textbf{X}$ of subsets of $X$ is a $\sigma$ algebra in case:   $\phi, \mathbb{R} \in \textbf{X}$ $X \setminus A \in \textbf{X}$ if $A \in \textbf{X}$ If $(A_n) \in \textbf{X}$, then the union $\bigcup_{n=1}^{\infty} A_n \in \textbf{X}$  Any set in $\textbf{X}$ is called $X-$ measurable.   A function is $X-$ measurable if for every real $\alpha$, the set $\{x \in X : f(x)&gt;\alpha\}$ belongs to $\textbf{X}$  Attempt  Consider the following function: $$f=\begin{cases} 1 &amp;\mbox{ if} \ x \not\in\mathbb{Q} \\                   -1 &amp;\mbox{ if} \ x \in \mathbb{Q}  \end{cases}$$ defined from $\mathbb{R}$ to $\mathbb{R}$ with $\textbf{X}$ being the Borel algebra (the $\sigma$ algebra generated by all open intervals $(a,b)$) Then if $\alpha \in [-1,1)$, the set $\{x: f(x)&gt;\alpha\}$ consists of the irrational numbers. If I can show that the irrationals are not in the Borel Algebra, then I would be done since $|f|=f^2$ is a constant and easily shown to be measurable. Unfortunately I do not know how to show that the irrationals are not in the Borel Algebra.  Edit it has been brought to my attention that the irrationals are in the Borel algebra. I think this is because the rationals, being countable, can be shown to be in the Borel algebra by constructing appropriate small neighborhoods around each rational and then taking the intersections. I now seek to construct a set that is not in the Borel algebra  Alternatively I have tried to define a set other than the irrationals that is not in the Borel Algebra and define a similar function but to no avail. I am currently self studying this book so it would be of great help to me if the answer could contain heuristics on how to tell when a set if borel measurable (although I do not require this in the answer).
How do I check OS with a preprocessor directive? guess the color of the next card There are 26 red cards and 26 black cards on the table which are randomly shuffled and are facing down onto the table. The host turns up the cards one at a time. You can stop the game any time (even at the beginning of the game). Once you stops the game, the next card is turned up: if it is red, you get $1; otherwise you pay the host one dollar. What is the payoff of this game? Example of the equality of an inequality This question is related to Daniel Fischer's answer . Suppose $f$ is a real $C^{1}$ function on $[0, 1]$ such that $f(0) = 0$ and $\int_{0}^{1}f'(x)^{2}\, dx \leq 1$. Then (essentially by Cauchy-Schwarz), we have $\left|\int_{0}^{1}f(x)\, dx\right| \leq 2/3$ as Daniel Fischer stated in his answer.  My question is: Is there an example of a function such that we have equality in $\left|\int_{0}^{1}f(x)\, dx\right| \leq 2/3$? I was thinking of maybe a smoothed version of a function which takes the value $0$ on $[0, 1/2)$ and $4/3$ on $(1/2, 1]$ but that seems complicated to construct, moreover, the derivative in some neighbourhood of $1/2$ might be hard to control. IE must close for event with jQuery to work Merge multiple video with ffmpeg single command line in specific time without cut it one by one and merge it I have 15 video files which I want to merge with ffmpeg. I want to save time by merge all of the video files in a single command line, not cut it one by one and merge it. Thanks. Using Google Music Manager in Linux from the command line My goal is to use Google Music Manager on a Linux server.  I'm wondering if the music manager can operate from the command line and with no GUI.  If I could set the software up to watch a particular directory on the server and upload from there, that would be the only necessary functionality.  Thank you. When is a function too long? How to add custom C++ keywords to be recognized by Minted? I have defined several structures and types in a C++ project. I have to write some documentation for this code, and I use  to typeset my code.   I would like to be able to add some keywords to the minted database, so minted will also recognize these and give them the appropriate color. (I would like to have them colored in the same way a type, eg. double would be colored.) Broken URL for data.stackexchange.com help page When using data.stackexchange.com I fail to remember if as [post link] is the correct alias to get the url for the post. Luckily the site has an  link. Unfortunately it is now broken. Can this be fixed? Looking for old book, SF, artificial world, different zones for different species that visitors "inhabit" What resampling method is used in the raster 'Save as...' dialog? I received a raster that was resampled using the Save as dialog in QGIS. Now I need to describe the resampling process in a report. But I could not figure out the method used in the resampling. Is it Nearest Neighbor? Bicubic?  This question has been asked before () but the answer does not specify the method used.   I also tried looking at the QGis source code in GitHub, but unfortunately, I could not find where the magic takes place (I'm not a programmer) Ubuntu on 32-bit UEFI - optimal solution I have a computer (Asus T200TA) with 2G RAM and 32-bit UEFI [Yep, what a wonderful idea to put 32-bit UEFI!]. I have two options:   Install a 64-bit system, boot manually and install grub-efi-ia32. Drawback: 2G is not much, systems with such low RAM are said to run better on 32-bit systems. Install a 32-bit version. (but from my state of knowledge it's not trivial to boot)   Which option would be better? states that if $f:X \rightarrow Y$ is a morphism of ringed space, $G$ is a locally free $O_Y$-module, then $f^*G$ is a locally free $O_X$ module.     Suppose that $G$ is a locally free $O_Y$ module, hence it is a free $O_Y|_U=O_U$ module. We have an induced map  $$f^{-1}(U) \rightarrow U$$ given by restriction of morphism of ringed spaces.   Hence, as $\bigoplus O_U \simeq G|_U$, $f^*:Mod(O_U) \rightarrow Mod(O_{f^{-1}(U)})$ is functorial, $f^*(G|_U) = (f^*G)|_{f^{-1}(U)}$, we have isomoprhism,  $$ \bigoplus O_{f^{-1}(U)} \simeq (f^*G)|_{f^{-1}(U)} $$ Note: this post is different to , which just cites part from somewhere else, without any further analysis and thinking. Furthermore, none of the answers to that post answers my question - the situations where &quot;will (going to) be doing&quot; is more appropriate.   I will be participating in IELTS test next Tuesday afternoon.  In an online class, the teacher says the following at the beginning of the lesson.  I will be using NotePod (pointed out by red rectangle) to write relevant points we talk about today.   I guess &quot;will be using&quot; is more appropriate than &quot;will use&quot; there, right?  A  explains  This &quot;tense&quot; is used for reporting a scheduled activity with special focus on its timing— as if one is standing in the future and experiencing the flow of the time. The focus is on the temporary, ongoing, or repetitive nature of the activity.   I understand the grammar rules of those verb tenses and the difference between this group  I am going to drive home tomorrow.   I am going to be driving home tomorrow.  The former is just convey my activity in the near future while the latter probably makes an implication that &quot;don't disturb me as I am driving in that time&quot; However, in the following situations, I don't see the difference between 2 verb tenses.  Welcome back to this class. Today's lesson is for the IELTS students who are going to be taking the IELTS test. it's for everybody to be honest with you. this lesson is useful for anybody who needs to do some writing.   who are going to take the IELTS test ... How do I breed Pokemon for their Hidden Abilities? I want to legitimately breed a competitive team, but I don't know how to breed for hidden abilities unless I just breed two Pokemon who have their normal ability(s) together until I breed one with a hidden ability. Does someone know a useful trick or item I could use? Change the selected value of a drop-down list with jQuery I have a drop-down list with known values. What I'm trying to do is set the drop down list to a particular value that I know exists using jQuery.  Using regular JavaScript, I would do something like:  ddl = document.getElementById("ID of element goes here"); ddl.value = 2; // 2 being the value I want to set it too.   However, I need to do this with jQuery, because I'm using a CSS class for my selector (stupid  client ids...).  Here are a few things I've tried:  $("._statusDDL").val(2); // Doesn't find 2 as a value. $("._statusDDL").children("option").val(2) // Also failed.      How can I do it with jQuery?     Update  So as it turns out, I had it right the first time with:  $("._statusDDL").val(2);   When I put an alert just above it works fine, but when I remove the alert and let it run at full speed, I get the error     Could not set the selected property. Invalid Index   I'm not sure if it's a bug with jQuery or Internet Explorer 6 (I'm guessing Internet Explorer 6), but it's terribly annoying. Why doesn't Volumetric follow the shape of Mesh in Eevee? So I was in the middle of making a ball-shaped smoke, but the volumetric effect didn't work following the basic shape. It remains cube in Eevee Blender 2.8; while in Cycle it works, but in Cycle it takes thousands of years for Render. So I want to texture clothing for example that I created using the mirror modifier. But I want the 2 sides of the clothing piece to have individual designs for instance but it is not possible since the original and the mirrored surfaces use the same UV-coordinates. How can I change that? How do I start a process from C#? How do I start a process, such as launching a URL when the user clicks a button? An irreducible polynomial of degree coprime to the degree of an extension is irreducible over this extension I'm having a hard time showing this:     If $K$ is an extension of $\mathbb{Q}$ with degree $m$ and $f(x)$ an irreducible polynomial over the rationals with degree $n$, such that $\gcd(m, n)=1$, then $f(x)$ is irreducible over $K$.   I have tried it by writing $f(x)=a(x)b(x)$ and then looking at the coefficients of those polynomials (some of them must belong to $K-\mathbb{Q}$ which could possibly result in a contradiction) to no success. I have no idea where to use the hypothesis of m and n being relatively prime.  Any help would be appreciated.