g1

funny problem from model theory problem sheet 题面 Let L be a countable language, T a theory. Let c_1,c_2,... be new constants, L'=L\cup\lbrace c_1,...\rbrace, and let X be the set of all complete theories of L' with T\subset t. Enumerate the L' se……

集合论想学自己学去吧, 该回归一般意义上的数理逻辑了. 另外本系列持续使用中文写作. 默认的latex编译器又哈哈了, 喜欢我美刀吗￥￥￥ 上期我们浪费了一期在最为基础的集合论上, 然而集合论并不是一个很好的例子, 毕竟其中很多东西若深入讨论需要大量基础, 关于其……

Rotman algebraic topology上的题, 个人认为出的非常好, 极大增进了读者对\pi_1(S^1)计算过程的理解. 题面 A group G which is also a topology space is called a topological group if \mu:G\times G\to G:(x,y)\mapsto xy and i:G\to G:x\mapsto x^{-1} are contin……

Dieudonne的题, 真实难度不好说, 回顾一下发现其实挺简单的. 题面 Let E be a Hilbert space, F a dense linear subspace of E, distinct from E. (For example E space of l^2 sum of a suitable countable linear independent set and F space of finite sum of thi……

It's a well known fact that Euclidean domains are principal ideal domain by taking the element in a certain ideal with smallest \varphi value. Yet the converse is false, and one counterexample just lies among our familiar algebraic integer rings, \……

题目背景 为证一个非零吃大师 题面 Assuming AC, prove that for a integral domain R, if any nonzero prime ideal P contains a nonzero prime (p), R is UFD. 先想再看提示哦 提示 Let S be the set of elements that are prime factori……

This proof is due to Choudum. A sequence of nonnegative integers (d_1,...,d_n) is called graphic if there is a simple graph G with V(G)=\lbrace v_1,...,v_n\rbrace and d(v_i)=d_i. It's very easy to show that if a nonincreasing sequence, i.e. d_1\ge ……

飞机上半昏迷状态下以为无法调整, 暴力算出来的搞笑解答. 非常具有统计色彩 (nod) 题面 A simple graph G is called complete k-partite if there's a partion of V(G): A_1,..., A_k s.t. for all i there's no edge with both vertices in A_i , and for any v\in A……

It's a well-known fact that the alternating groups, A_n, are simple for n\neq 4, with small cases like A_1, A_2, A_3 very easy to verify. Yet most proofs of n\geq 5, including Hungerford's, relies heavily on 'magical' permutation composition, which……