“…Which, in case v ∈ C 2 (E), is equivalent to t))z, this shows that the positive definiteness of Hessian matrix (D 2 v) is a sufficient condition for the strict convexity, but not necessary. However if u ∈ C 2 is a k-convex solution of S k [u] = f (y) ≥ 0 with 2 ≤ k < n and f (y 0 ) = 0, then S k+1 [u](y 0 ) > 0 will never occur, so that there are two possibilities: 1) S k+1 [u](y 0 ) < 0, in this case, u is not (k + 1)-convex; 2) S k+1 [u](y 0 ) = 0, in this case, it is shown in Theorem 1.1 of [21] that, if S k [u](y 0 ) = S k+1 [u](y 0 ) = 0, then S l [u](y 0 ) = 0 for k ≤ l ≤ n. In particular, if f ≡ 0, since the case S k+1 [u] > 0 will never occur, then either S k+1 [u] < 0 in some open subset of Ω or S k+1 [u] ≡ 0 in Ω itself, in the former case u is not (k + 1)−convex and let alone strictly convex; in the latter case, S l [u] ≡ 0 for k ≤ l ≤ n, then the graph (y; u(y)) for k = 2 has the vanishing sectional curvature and must be a cylinder or a plane, see [19] and [22], meanwhile the graph (y; u(y)) for k > 2, by Lemma 3.1 of [10], is a surface of constant nullity (at least) n − k + 1 and then is a (n − k + 1)-ruled surface. Therefore if f ≡ 0, the solution u to (1.1) is not strictly convex (at least) along the rulings.…”