【学习笔记】离散数学(Discrete Math) - 证明 Proof 3

本文详细介绍了离散数学中的各种证明技巧,包括直接证明、对位证明、反证法、空真和平凡证明、列举法及唯一性证明。通过具体实例,深入解析每种证明方法的应用场景和步骤。

离散数学(Discrete Math)

                                                         - 证明proof

目录

离散数学(Discrete Math)

                                                         - 证明proof

 

Terminology 术语

How to prove conditional statements?

Direct proof直接证明法

Proof by contraposition对位证明法

Proof by contradiction 矛盾法/反证法

Vacaous and Trival proofs

Proof by cases 列举法

Uniqueness proofs 唯一性证明

名词补充

参考课程


Terminology 术语

Theorem 定理 :A theorem is a statement that can be shown to be true.

Proposition 命题:Less important theorems are called propositions.

Proof 证明:A proof is a valid argument that established the truth of a theorem.

Axiom 公理:Statements that we assume to be true.

Lemma 引理:A less important throrem that is helpful in the proof of other results.

Corollary 推论:A theorem that can be established directly from a theorem that has been proved.

Conjecture 推测(猜想):A statement that is being proposed to be a true statement.

How to prove conditional statements?

p->q

  1. Direct proof 直接证明法
  2. Proof by contraposition 对位证明法
  3. Proof by contradiction 矛盾法/反证法
  4. Vacaous and Trival proofs 空真和平凡证明

Direct proof 直接证明法

例:

P(n): n is odd.

Q(n): n^2 is odd.

∀n∈Z, P(n)-> Q(n)

证:

设n=2k+1,则有

n^2 = 2(2k^2+2k)+1

证毕

 

Proof by contraposition 对位证明法

p->q ≡┐q->┐p

Assume q is false by applying rule of inference, we conclude that p is false.

例:

Prove that if n is an integer and 3n+2 is odd, then n is odd.

证:

Assume n is not odd.

Then, n is

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值