Skip to main content
Philippe Gaucher's user avatar
Philippe Gaucher's user avatar
Philippe Gaucher's user avatar
Philippe Gaucher
  • Member for 12 years, 6 months
  • Last seen this week
comment
Systems of equations in Boolean Algebra
Yes I have an application from $\mathbb{B}^n$ to $\mathbb{B}^m$, where $\mathbb{B}$ is the $2$-element Boolean algebra and I need a necessary and sufficient condition for this map to be one-to-one.
comment
Systems of equations in Boolean Algebra
@BenjaminSteinberg Indeed, it is a system of equations in a semiring.
revised
Systems of equations in Boolean Algebra
deleted 11 characters in body
Loading…
comment
Systems of equations in Boolean Algebra
@AlexDegtyarev : a mistake from me indeed; I was wrongly interpreting "xor" as the disjoint union. With $A=\{a,b\}$ and $B=\{b,c\}$, I had $A\sqcup B=\{a,b_1,b_2,c\}$ which is of course not a subset of $\{a,b,c\}$. I edit the question one more time.
comment
Systems of equations in Boolean Algebra
It is not a numerical system of equations (I cannot take a computer and ask it to solve it), but I understand what you mean. A round trip between the 2-element Boolean algebra and $\mathbb{F}_2$ could help. Anyway, any reference about the subject is welcome.
revised
Systems of equations in Boolean Algebra
added 827 characters in body
Loading…
comment
Systems of equations in Boolean Algebra
Probably because I am using the terminology in a wrong way: I don't know almost anything in Boolean algebra. I use "or", union and not "xor", for the addition. For me $1+1=1$, and not $0$.
revised
Systems of equations in Boolean Algebra
deleted 1 character in body
Loading…
asked
Loading…
comment
Non-examples of model structures, that fail for subtle/surprising reasons?
A comment about your motivations: you should read Olschok's PhD which provides more general settings to construct such model structures. The key point is to find an appropriate cylinder (for Cisinski's model categories) or cocylinder functor (for LMW's model categories).
comment
Can we "complete" model categories to compute derived functors in the usual way?
Could you explain with more details what you mean by "analogous to the case of abelian categories" please ? The only thing I can say is that taking a cofibrant (fibrant resp.) replacement in a model category is a little bit like taking a projective (injective resp.) resolution in an abelian category, but in a non-additive setting. But I guess that you already know that.
awarded
awarded
comment
What's special about the Simplex category?
Is what follows special enough ? The homotopy theory of simplicial sets is the universal homotopy theory generated by one point : http://math.uoregon.edu/~ddugger/univ.html.
comment
What's special about the Simplex category?
You are correct, up to weak homotopy equivalence.
answered
Loading…
comment
Grothendieck's Homotopy Hypothesis - Applications and Generalizations
@Charles Rezk I believe that Grothendieck did not like the notion of topological space and wanted a "purely algebraic" representation of homotopy types. Though I cannot remember where I read that.
comment
'Category-theory'-free areas of pure math, 'category-theory'-loaded areas of applied math
@AlexDegtyarev Functoriality is not a convenient language. Think for example of Brouwer's fix point theorem, the proof using the fundamental group. It is because of the functoriality of the fundamental group that supposing the nonexistence of a fix point leads to a one-to-one map from $\mathbb{Z}$ to $\{0\}$.
comment
How do I verify the Coq proof of Feit-Thompson?
Since I am curious, I did the same thing and ran into a "Error: Unbound module Genarg". It is embarassing that a proof runs fine or not depending on an implementation :-) (Ubuntu 14.04 with the coq and ocaml packages provided with it). Will one be able to run the proof again in 10 years ?
1
26 27
28
29 30
33