Authority and whole-class proving in high school geometry: The case of Ms. Finley

Students’ experiences with proving in schools often lead them to see proof as a static product rather than a negotiated process that can help students justify and make sense of mathematical ideas. We investigated how authority manifested in whole-class proving episodes within Ms. Finley’s high school geometry classroom. We designed a coding scheme that helped us identify the proving actions and interactions that occurred during whole-class proving and how Ms. Finley and her students contributed to those processes. By considering the authority over proof initiation, proof construction, and proof validation, the episodes illustrate how whole-class proving interactions might relate to students’ potential development (or maintenance) of authoritative proof schemes. In particular, the authority of the teacher and textbook limited students’ opportunities to engage collectively in proving and sometimes allowed invalid arguments to be accepted in the public discourse. We offer suggestions for research and practice with respect to authority and proof instruction.     

How do open-ended problems promote indirect argumentation? Conceptual replications in a Japanese secondary school

The possibility of connecting spontaneous indirect argumentation to indirect mathematical proof has been investigated for decades. It may be effective to use open-ended problems based on the notion of cognitive unity to promote indirect argumentation. Moreover, it also appears useful to analyze students’ indirect argumentation through a model based on the logical structure of indirect proof. However, several convincing critiques of these proposals exist. This study aimed to resolve this dispute and obtain a deeper understanding of indirect argumentation in the process. To achieve this, conceptual replications of previous research were conducted at a Japanese secondary school. The results demonstrated that the exploration of various cases in the situation of an open-ended problem could promote indirect argumentation. Furthermore, the findings indicate that indirect argumentation exhibits diverse characteristics that can be omitted if the analysis is conducted only from a logical perspective.     

Two proving strategies of highly successful mathematics majors

We examined the proof-writing behaviors of six highly successful mathematics majors on novel proving tasks in calculus. We found two approaches that these students used to write proofs, which we termed the targeted strategy and the shotgun strategy. When using a targeted strategy students would develop a strong understanding of the statement they were proving, choose a plan based on this understanding, develop a graphical argument for why the statement is true, and formalize this graphical argument into a proof. When using a shotgun strategy, students would begin trying different proof plans immediately after reading the statement and would abandon a plan at the first sign of difficulty. The identification of these two strategies adds to the literature on proving by informing how elements of existing problem-solving models interrelate.     

Investigating undergraduate students’ proof schemes and perspectives about combinatorial proof

Combinatorics is an area of mathematics with accessible, rich problems and applications in a variety of fields. Combinatorial proof is an important topic within combinatorics that has received relatively little attention within the mathematics education community, and there is much to investigate about how students reason about and engage with combinatorial proof. In this paper, we use Harel and Sowder’s (1998) proof schemes to investigate ways that students may characterize combinatorial proofs as different from other types of proof. We gave five upper-division mathematics students combinatorial-proof tasks and asked them to reflect on their activity and combinatorial proof more generally. We found that the students used several of Harel and Sowder’s proof schemes to characterize combinatorial proof, and we discuss whether and how other proof schemes may emerge for students engaging in combinatorial proof. We conclude by discussing implications and avenues for future research.     

Integrating algebra and proof in high school mathematics: An exploratory study

Frequently, in the US students’ work with proofs is largely concentrated to the domain of high school geometry, thus providing students with a distorted image of what proof entails, which is at odds with the central role that proof plays in mathematics. Despite the centrality of proof in mathematics, there is a lack of studies addressing how to integrate proof into other mathematical domains. In this paper, we discuss a teaching experiment designed to integrate algebra and proof in the high school curriculum. Algebraic proof was envisioned as the vehicle that would provide high school students the opportunity to learn not only about proof in a context other than geometry, but also about aspects of algebra. Results from the experiment indicate that students meaningfully learned about aspects of both algebra and proof in that they produced algebraic proofs involving multiple variables, based on conjectures they themselves generated.     

Conditions for proving by mathematical induction to be explanatory

In this paper we consider proving to be the activity in search for a proof, whereby proof is the final product of this activity that meets certain criteria. Although there has been considerable research attention on the functions of proof (e.g., explanation), there has been less explicit attention in the literature on those same functions arising in the proving process. Our aim is to identify conditions for proving by mathematical induction to be explanatory for the prover. To identify such conditions, we analyze videos of undergraduate mathematics students working on specially designed problems. Specifically, we examine the role played by: the problem formulation, students’ experience with the utility of examples in proving, and students’ ability to recognize and apply mathematical induction as an appropriate method in their explorations. We conclude that particular combinations of these aspects make it more likely that proving by induction will be explanatory for the prover.     

Proof validation and modification in secondary school geometry

Proof validation is important in school mathematics because it can provide a basis upon which to critique mathematical arguments. While there has been some previous research on proof validation, the need for studies with school students is pressing. For this paper, we focus on proof validation and modification during secondary school geometry. For that purpose, we employ Lakatos’ notion of local counterexample that rejects a specific step in a proof. By using Toulmin’s framework to analyze data from a task-based questionnaire completed by 32 ninth-grade students in a class in Japan, we identify what attempts the students made in producing local counterexamples to their proofs and modifying their proofs to deal with local counterexamples. We found that student difficulties related to producing diagrams that satisfied the condition of the set proof problem and to generating acceptable warrants for claims. The classroom use of tasks that entail student discovery of local counterexamples may help to improve students’ learning of proof and proving.     

Comprehension contradicts to the induction within Łukasiewicz predicate logic

We introduce the simpler and shorter proof of Hajek’s theorem that the mathematical induction on ω implies a contradiction in the set theory with the comprehension principle within ?ukasiewicz predicate logic ? ${\forall}$ (Hajek Arch Math Logic 44(6):763–782, 2005) by extending the proof in (Yatabe Arch Math Logic, accepted) so as to be effective in any linearly ordered MV-algebra.     

Proof complexity of intuitionistic implicational formulas

We study implicational formulas in the context of proof complexity of intuitionistic propositional logic (IPC). On the one hand, we give an efficient transformation of tautologies to implicational tautologies that preserves the lengths of intuitionistic extended Frege (EF) or substitution Frege (SF) proofs up to a polynomial. On the other hand, EF proofs in the implicational fragment of IPC polynomially simulate full intuitionistic logic for implicational tautologies. The results also apply to other fragments of other superintuitionistic logics under certain conditions.In particular, the exponential lower bounds on the length of intuitionistic EF proofs by Hrube? (2007), generalized to exponential separation between EF and SF systems in superintuitionistic logics of unbounded branching by Je?ábek (2009), can be realized by implicational tautologies.     

Argumentation and algebraic proof

This paper concerns a study analysing cognitive continuities and distances between argumentation supporting a conjecture and its algebraic proof, when solving open problems involving properties of numbers. The aim of this paper is to show that, unlike the geometrical case, the structural distance between argumentation and proof (from an abductive argumentation to a deductive proof) is not one of the possible difficulties met by students in solving such problems. On the contrary, since algebraic proof is characterized by a strong deductive structure, abductive steps in the argumentation activity can be useful in linking the meaning of the letters used in the algebraic proof with numbers used in the argumentation. The analysis of continuities and distances between argumentation and proof is based on the use of Toulmin’s model combined with ck¢ model.     

Explication as a lens for the formalization of mathematical theory through guided reinvention

Realistic Mathematics Education supports students’ formalization of their mathematical activity through guided reinvention. To operationalize “formalization” in a proof-oriented instructional context, I adapt Sjogren's (2010) claim that formal proof explicates (Carnap, 1950) informal proof. Explication means replacing unscientific or informal concepts with scientific ones. I use Carnap's criteria for successful explication – similarity, exactness, and fruitfulness – to demonstrate how the elements of mathematical theory – definitions, axioms, theorems, proofs – can each explicate their less formal correlates. This lens supports an express goal of the instructional project, which is to help students coordinate semantic (informal) and syntactic (formal) mathematical activity. I demonstrate the analytical value of the explication lens by applying it to examples of students’ mathematical activity drawn from a design experiment in undergraduate, neutral axiomatic geometry. I analyze the chains of meanings (Thompson, 2013) that emerged when formal elements were presented readymade alongside those emerging from guided reinvention.     

A sense-making approach to proof: Strategies of students in traditional and problem-based number theory courses

This paper reports the results of an exploratory study of the perceptions of and approaches to mathematical proof of undergraduates enrolled in lecture-based and problem-based “transition to proof” courses. While the students in the lecture-based course demonstrated conceptions of proof that reflect those reported in the research literature as insufficient and typical of undergraduates, the students in the problem-based course were found to hold conceptions of and approach the construction of proofs in ways that demonstrated efforts to make sense of mathematical ideas. This sense-making manifested itself in the ways in which students employed initial strategies, notation, prior knowledge and experiences, and concrete examples in the proof construction process. These differences were also seen when students were asked to determine the validity of completed proofs. These results suggest that such a problem-based course may provide opportunities for students to develop conceptions of proof that are more meaningful and robust than does a traditional lecture-based course.     

Examining the role of examples in proving processes through a cognitive lens: the case of triangular numbers

In this paper, we analyze the role of examples in the proving process. The context chosen for this study was finding a general rule for triangular numbers. The aim of this paper is to show that examples are effective for the construction of a proof when they allow cognitive unity and structural continuity between argumentation and proof. Continuity in the structure is possible if the inductive argumentation is based on process pattern generalization (PPG), but this is not the case if a generalization is made on the results. Moreover, the PPG favors the development of generic examples that support cognitive unity and structural continuity between the argumentation and proof. The cognitive analysis presented in this paper is performed through Toulmin??s model.     

The proof theoretic strength of the Steinitz exchange theorem

We show that the logical theory QLA proves the Cayley-Hamilton theorem from the Steinitz exchange theorem together with a strengthening of the linear independence principle. Since QLA is a fairly weak theory (in the sense that its quantifier-free fragment, LA, translates into tautologies with TC⁰-Frege proofs—when restricted to the field Q of the rationals), it follows that the proof complexity of matrix algebra can be distilled to the Steinitz exchange theorem.     

Semantic contamination and mathematical proof: Can a non-proof prove?

The way words are used in natural language can influence how the same words are understood by students in formal educational contexts. Here we argue that this so-called semantic contamination effect plays a role in determining how students engage with mathematical proof, a fundamental aspect of learning mathematics. Analyses of responses to argument evaluation tasks suggest that students may hold two different and contradictory conceptions of proof: one related to conviction, and one to validity. We demonstrate that these two conceptions can be preferentially elicited by making apparently irrelevant linguistic changes to task instructions. After analyzing the occurrence of “proof” and “prove” in natural language, we report two experiments that suggest that the noun form privileges evaluations related to validity, and that the verb form privileges evaluations related to conviction. In short, we show that (what is judged to be) a non-proof can sometimes (be judged to) prove.     

Numerical analysis of the generalized von Kármán equations

The ‘generalized von Kármán equations’ constitute a mathematical model for a nonlinearly elastic plate subjected to boundary conditions ‘of von Kármán type’ only on a portion of its lateral face, the remaining portion being free. We establish here the convergence of a conforming finite element approximation to these equations. The proof relies in particular on a compactness method due to J.-L. Lions and on Brouwer's fixed point theorem. To cite this article: P.G. Ciarlet et al., C. R. Acad. Sci. Paris, Ser. I 341 (2005).     

Conceptual blending: Student reasoning when proving “conditional implies conditional” statements

Conceptual blending describes how humans condense information, combining it in novel ways. The blending process may create global insight or new detailed connections, but it may also result in a loss of information, causing confusion. In this paper, we describe the proof writing process of a group of four students in a university geometry course proving a statement of the form conditional implies conditional, i.e., (p → q) ⇒ (r → s). We use blending theory to provide insight into three diverse questions relevant for proof writing: (1) Where do key ideas for proofs come from?, (2) How do students structure their proofs and combine those structures with their more intuitive ideas?, and (3) How are students reasoning when they fail to keep track of the implication structure of the statements that they are using? We also use blending theory to describe the evolution of the students’ proof writing process through four episodes each described by a primary blend.     

On the complete cd-index of a Bruhat interval

We study the non-negativity conjecture of the complete cd-index of a Bruhat interval as defined by Billera and Brenti. For each cd-monomial M we construct a set of paths, such that if a “flip condition” is satisfied, then the number of these paths is the coefficient of the monomial M in the complete cd-index. When the monomial contains at most one d, then the condition follows from Dyer’s proof of Cellini’s conjecture. Hence the coefficients of these monomials are non-negative. We also relate the flip condition to shelling of Bruhat intervals.