Introduction to Set Theory (precursor to better evaluation of LA)

CubicFlunky77
Messages
25
Reaction score
0
My goal: To show the dimension of space L equals the length of any maximal flag of L;

Is the following valid?

My attempt:

Let M \rightarrow {L_{i-1}, ... L_i}

where {e_i} \in L_i | e_i \not\in L_{i-1}

Assuming e_i \in M and e_i \not\in L_{i-1},

we can say: e_i \in L_i and L_i = M.

Thus: {e_1, ... ,e_i} , {e_i} \in L_i = M \ L_{i-1}

for n = dim L or "finite dimension" of L such that: L_o \subset L_1 \subset L_2 ... \subset L_n
 
Physics news on Phys.org
What are ##M## and ##L_i##?
 
I apologize for posting in a rush.

L is a maximal flag defined by L_0 \subset L_1 \subset L_2 ... and L_i is a space for which ({e_1, ... ,e_i}) forms the basis. Assuming
({e_i, ... ,e_{i-1}}) is valid, M is a linear span of the aforementioned basis of L_i.
 
Help... anyone? :(
 
Hi all, I've been a roulette player for more than 10 years (although I took time off here and there) and it's only now that I'm trying to understand the physics of the game. Basically my strategy in roulette is to divide the wheel roughly into two halves (let's call them A and B). My theory is that in roulette there will invariably be variance. In other words, if A comes up 5 times in a row, B will be due to come up soon. However I have been proven wrong many times, and I have seen some...
Thread 'Detail of Diagonalization Lemma'
The following is more or less taken from page 6 of C. Smorynski's "Self-Reference and Modal Logic". (Springer, 1985) (I couldn't get raised brackets to indicate codification (Gödel numbering), so I use a box. The overline is assigning a name. The detail I would like clarification on is in the second step in the last line, where we have an m-overlined, and we substitute the expression for m. Are we saying that the name of a coded term is the same as the coded term? Thanks in advance.

Similar threads

Back
Top