« first day (4097 days earlier)      last day (918 days later) » 
00:00 - 20:0020:00 - 00:00

8:00 PM
\begin{array}{cccc} P&Q&P\vee Q & P\wedge Q \\ \hline F&F&F&F \\ T&F&T&F \end{array}
 
Sure, but how then $P \lor F \equiv P$ if we just have 2 rows given there should be 4 possibilies, or there are just 2 in case of $P \lor F$?
 
there's only two. there's nothing to differentiate your first two rows, for instance
hence it's redundant to include both of them (same with the last two)
 
I got you!
 
and what we notice now is that $Q$ being false ensures that $P\wedge Q$ is false, beause both inputs must be true (and at least one isn't)
what about $P\vee Q$?
 
How about last one pls: $P \lor T \equiv T$ and not $P \lor T \equiv P$ please?
based on table above:
https://chat.stackexchange.com/transcript/message/59425826#59425826
 
8:03 PM
in that case you want the rows of the truth table where Q is true
\begin{array}{cccc} P&Q&P\vee Q & P\wedge Q \\ \hline F&T&T&F \\ T&T&T&T \end{array}
 
So, P∨T≡T is different from P∨T≡P or we can write also P∨T≡P?
 
suppose $P\vee T=P$. then that'd mean that $F\vee T=F$ when $P$ is false.
does that match the truth table?
 
LET ME THNIK PLS
oh I see!
I see now, wow
It would change $P$ if we set $P \lor T = P$
 
right
 
@Semiclassical. Tnx
So only $p \land T = P$
 
8:07 PM
right
 
%100 clear now
tnx alot
 
another way to put it: once we know that Q is true, then we know "P OR Q" must be true. but all we know for AND is that, if 'P AND Q" will end up being false, it won't because of Q. So "P AND Q = P" in that case.
 
yes!
 
(the slightly weird one is $A\implies B$. for that one i'd default to "take it as a definition")
 
8:23 PM
haha
Honestly working is the most tricky one
It's much easier to work with symbols than with wording where mathematicians imagination flies
GOD mercy then on us
 
depends on the symbols
if i see $\Xi$ i know i'm in trouble
 
I agree
I changed my mind
 
either way it can be hard to see when boolean expressions simplify tho
 
If you say about any math problem that it's easy, then you should blame yourself
Mathematician won't leave you alone
He will stalk you till you are down
It's either you hide and seek till you escape or face him face to face
Do you think about math differently @Semiclassical. :/
 
depends on the problem
sometimes math is just straighforward and useful
sometimes it's tricky but satisfying
and then sometimes it's like "i can check that this is true, but i don't know how tf you'd ever see it without guessing"
that's where madness lies
 
8:30 PM
hahaha
:(
funny and sad
Can you see the image above please?
Those are 2 equivalent statements
 
@Semiclassical i think that's correct.
@ShaVuklia oh which one
 
Now, how for gd sake this is true: $𝑝 → (𝑞 → 𝑟)~ and ~(𝑝 ∧ 𝑞) → 𝑟$
W/o truth table!
There is a rule which says that $(p \to r) \lor (q \to r) \equiv (p \land q) \to r$. So how this is true that $p→(q→r) ~and ~(p∧q)→r$ without using truth table?
Can we solve that (p→r)∨(q→r)≡(p∧q)→r simply by taking a row from truth table and see what it would equal to? But the problem with this approach is that it's very slow as the the row we might take might yield same results
I mean try to plug same truth values for both (p→r)∨(q→r) and for (p∧q)→r and see whether they are equivvalent or not. What do you think please?
Is this the fastest approach you could think on?
Which of the following set of expressions is not equivalent to each other?
a) 𝑝 and (𝑝 ∧ 𝑞) ∨ (𝑝 ∧ ¬𝑞)
b) 𝑝 → (𝑞 → 𝑟) and (𝑝 ∧ 𝑞) → 𝑟
c) (𝑝 → 𝑞) → 𝑟 and (𝑝 ∧ 𝑞) → 𝑟
d) All of the above are correct
That is the question. You should solve this in ONE MINUTE :/
 
occupied at the moment
 
:/
 
you need to do some work!
 
8:56 PM
@LeakyNun
 
@BalarkaSen quoi
 
Consider the representation ring of $U(n)$.
 
so $\Bbb C[U(n)]$
 
Not quite, I was thinking of the Grothendieck group of the monoid of representations of $U(n)$, under direct sum.
 
ok
 
8:59 PM
For a finite group $G$, this is the center of $\Bbb C[G]$, though. Cuz characters determine representations uniquely.
 
now what
 
A $U(n)$-representation $V$ restricts to a $T^n$-representation, where $T^n$ is the maximal torus in $U(n)$ of diagonal matrices.
 
There's an $S_n$-action on $T^n$ by permuting the circle factors, which gives an $S_n$-action on the representation ring $\mathrm{Rep}(T^n)$. This map $\mathrm{Rep}(U(n)) \to \mathrm{Rep}(T^n)$ is an isomorphism onto $\mathrm{Rep}(T^n)^{S_n}$.
@ShaVuklia Oh cool, I'm fond of that construction.
 
Yea, it's pretty cool!
 
9:05 PM
@LeakyNun We can now start computing $\mathrm{Rep}(U(n))$. $T^n$-representations are sum of 1-dimensional things, concentrated on each circle factor. So $\mathrm{Rep}(T^n) \cong \Bbb Z[x_1, x_1^{-1}, \cdots, x_n, x_n^{-1}]$.
The $S_n$-action is by permuting, and the invariant subring can be verified to be $\Bbb Z[e_1, \cdots, e_n, e_n^{-1}]$.
This is $\mathrm{Rep}(U(n))$.
I would now like to pin down the "augmentation ideal" of $\mathrm{Rep}(U(n))$. For any $G$, there's a map $\mathrm{Rep}(G) \to \Bbb Z$ given by $\sum a_i [V_i] \to \sum a_i$, "degree" of the virtual representation.
The kernel is the augmentation ideal $I_G$. What is this object here?
 
is this related to some restriction-inflation sequence
 
Yeah, it's closely related, and that's what I'm exploring.
$H^*(BG) \cong H^*(BT)^W$ for any compact Lie $G$, $T$ maximal torus and $W$ it's Weyl. Similarly, $\mathrm{Rep}(G) \cong \mathrm{Rep}(T)^W$.
The two are connected but the connection isn't obvious I think
I misspoke, the map is $\sum a_i [V_i] \mapsto \sum a_i \dim V_i$ of course.
$\dim e_k = \binom{n}{k}$ I guess.
 
why is it an isomorphism?
 
'Cuz $x_i$'s are 1-dimensional, tensor products of these are 1-dimensional, sums of these are (# of summand)-dimensional
 
when i see products of unitaries i start to wonder if there's a QM meaning to it
for instance i feel like I have seen that T^n stuff showing up
oh, probably when i was looking up invariant integration stuff
 
9:18 PM
I feel like there's a second $T^n$ here that's ignored
which is $U(n)$ quotient its commutator subgroup
 
@LeakyNun As in the map $\mathrm{Rep}(G) \to \mathrm{Rep}(T)^W$?
 
I guess I can accept it if you quoted it as a general result
 
Yeah I am not sure why it's true, I'm blackboxing that.
 
it just sounds off to me that if you enlarge the group you somehow end up with "fewer" representations
 
bigger group, more constraints somehow?
it's a simple-minded thought, but adding more variables doesn't give you more degrees of freedom if you add still more constraints at the same time
 
9:26 PM
@BalarkaSen ok I can now follow your text
what's the significance of $I_G$?
 
Apparently, the completion of $\mathrm{Rep}(G)$ at $I_G$ is $H^*(BG)$
I want to see this fact in action
But this seems off for the above example to me, I may be doing something wrong
I know $H^*(BU(n)) \cong \Bbb Z[e_1, \cdots, e_n]$, you can blackbox that as well.
 
sure
 
I think the last statement is wrong in the sense that $H^*(BU(n)) \cong \Bbb Z[c_1, \cdots, c_n]$ is indeed a polynomial ring, but $|c_k| = 2k$, unlike $|e_k| = \binom{n}{k}$ in $\mathrm{Rep}(U(n)) \cong \Bbb Z[e_1, \cdots, e_n, e_n^{-1}]$.
I don't know how to describe the augmentation ideal in $\Bbb Z[e_1, \cdots, e_n, e_n^{-1}]$ neatly, and I am very skeptical that you can complete at a typical ideal to get a polynomial ring back.
I guess completion at eg, $(e_n)$ would indeed give you back a polynomial ring, say. But the augmentation ideal is some monster.
 
why exactly should Rep(U(n)) be commutative?
or am i getting the wrong idea
 
The monoid of iso classes of G-representations is commutative, V +W ~ W + V
So its Grothendieck group is also commutative
Then you make it a ring by putting tensor
V o W ~ W o V once again as G-reps
So the final object Rep(G) is a commutative ring
 
9:35 PM
yeah i kinda get that
@BalarkaSen remind me: if $G$ is a finite group then how does Rep(G) compare to Rep(G^ab)?
and also what does I_G look like?
 
So you want to compare Z(C[G]) vs Z(C[G^ab]) = C[G^ab]
 
yeah
or basically, compare their conjugacy classes
 
I guess can be pretty drastic right? G^ab = 0 say
A_n lol
 
this feels like it's time to look at the group action G on G by conjugation
the map G -> G^ab is G-equivariant isnt it
 
Yeah no I get you I was thinking about that a bit before
 
9:38 PM
and G^ab is G-trivial
 
True.
 
so this map G -> G^ab is the maximal G-trivial quotient
wouldn't this imply that Orb(G) = G^ab
this sounds wrong
surely there's more than 2 conjugacy classes in Sn
 
Are you trying to pin down what the finite group analogue of maximal torus is
Or something
 
yeah maybe
no
what does I_G look like?
 
I think it's center intersect kernel of the usual augmentation map C[G] -> C
\sum c_i g_i -> \sum c_i
 
9:42 PM
surely the augmentation ideal is generated by $e_i - \dim(e_i) = e_i - \binom{n}{i}$?
 
Hrm, that seems right
And $e_n^{-1} - 1$
Why tf does that complete to a polynomial ring lmao
 
$e_n^{-1} - 1 = e_n^{-1} (1 - e_n)$ so it's already inside
 
Oh yeah fine.
Just tensor everything with $\Bbb C$ so that we don't have to deal with $\Bbb Z$, I don't care.
$\Bbb C[x, y, y^{-1}]$ completion at $(x, y)$ then. This is something awful, isn't it?
Seems wrong
 
no, completion at $(x-1, y-1)$
so you're looking at $\Bbb A^n \setminus \{ (\cdots, 0) \}$ and then you're localizing at a point that is not even on that axis
 
Completing rather. But that's some power series crap
 
9:47 PM
localize first
complete later
it doesn't matter right
 
OK yeah
 
so you can forget about $e_n^{-1}$ completely
so it's just the usual thing
$\Bbb C[[e_1', e_2', \cdots, e_n']]$
where $e_i' = e_i - \binom{n}{i}$
 
So nowhere close to what I should get
 
I don't understand
you claim you would get a polynomial ring?
but that wouldn't be complete would it
 
Er, true.
 
9:50 PM
I'm having a strong algebra allergy attack.
 
Oh I see
 
oh no do we have epinephrine
 
All this calculation is correct, maybe I'm misunderstanding the topology.
Thanks, @LeakyNun.
I may be confusing $K$-theory with $KU$-theory. Damn algebraic topologists.
 
lol, 1 letter makes all the difference
@BalarkaSen anytime
 
We can think of lots of words where one letter makes all the difference :P
 
9:57 PM
mourning vs morning
synonymous to me at this point tho
 
LOL ...
 
10:12 PM
ouch
 
Gah my misunderstanding is weirder than I thought it should be.
Here are all the statements: (1) $\widehat{\mathrm{Rep}(G)}^{I_G} \cong K^*(BG)$ (2) $K^*(BG) = \bigoplus_{d \geq 0} K^d(BG)$ (3) $K^d(BG) \cong K^{d+2}(BG)$ (4) $K^0(BG) \otimes \Bbb C \cong \bigoplus_{d \, even} H^d(BG; \Bbb C)$ (5) $K^1(BG) \otimes \Bbb C \cong \bigoplus_{d \, odd} H^d(BG; \Bbb C)$
$K^*(-)$ is a graded ring, 2-periodic and when I feed in $BG$ it's known upto torsion in the $0$ and $1$ grades
If $G = U(n)$, $H^*(BU(n); \Bbb C) = \Bbb C[c_1, \cdots, c_n]$ where $|c_k| = 2k$. Fact.
So there is nothing in the odd parts and everything in the even parts.
This says $K^0(BU(n)) \otimes \Bbb C \cong \Bbb C[c_1, \cdots, c_n]$ as groups.
One second. $K^n(-)$ is individually a ring too, and the above isomorphism is a ring isomorphism
So what is $K^*(-)$ damnit
There's some extra structure
Maybe one should be careful about what the 2-periodicity map $K^d(X) \cong K^{d+2}(X)$ is
$K^{2}(X) = K^0(X \wedge S^2)$ and $X \wedge S^2$ is a basepoint version of $X \times S^2$. I can tensor a bundle over $X$ with the canonical bundle of $S^2$, and I guess that's the periodicity map $K^0(X) \to K^2(X) \to \cdots$
 
10:57 PM
This stuff is incomprehensible man
What in the world is $K^*(X)$
 
11:23 PM
AHA that's not the isomorphism, you tensor with the virtual bundle $\mathcal{O}(-1) - \mathcal{O}(0)$
 
11:58 PM
Gotta love line bundles virtually of rank 0.
 
Driving me nuts
 
00:00 - 20:0020:00 - 00:00

« first day (4097 days earlier)      last day (918 days later) »